The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Para obter um cronograma viável de um sistema rígido de tempo real, técnicas baseadas em heurísticas são a solução de escolha. Nos últimos anos, os solucionadores de otimização ganharam a atenção das comunidades de pesquisa devido à sua capacidade de lidar com um grande número de restrições. Recentemente, alguns trabalhos utilizaram programação linear inteira (ILP) para resolver escalonamento monoprocessador de sistemas de tempo real. Na verdade, o ILP é comumente usado para escalonamento estático de sistemas multiprocessadores. No entanto, dois solucionadores principais são usados para resolver o problema indistintamente. Mas qual é o melhor para obter um sistema escalonável para sistemas rígidos de tempo real? Este artigo faz uma comparação de dois pacotes de software de otimização bem conhecidos (CPLEX e GUROBI) para o problema de encontrar um escalonamento viável em sistemas rígidos de tempo real monoprocessados.
Ana GUASQUE
Universitat Politècnica de València
Patricia BALBASTRE
Universitat Politècnica de València
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Ana GUASQUE, Patricia BALBASTRE, "Evaluation and Comparison of Integer Programming Solvers for Hard Real-Time Scheduling" in IEICE TRANSACTIONS on Information,
vol. E105-D, no. 10, pp. 1726-1733, October 2022, doi: 10.1587/transinf.2022EDP7073.
Abstract: In order to obtain a feasible schedule of a hard real-time system, heuristic based techniques are the solution of choice. In the last few years, optimization solvers have gained attention from research communities due to their capability of handling large number of constraints. Recently, some works have used integer linear programming (ILP) for solving mono processor scheduling of real-time systems. In fact, ILP is commonly used for static scheduling of multiprocessor systems. However, two main solvers are used to solve the problem indistinctly. But, which one is the best for obtaining a schedulable system for hard real-time systems? This paper makes a comparison of two well-known optimization software packages (CPLEX and GUROBI) for the problem of finding a feasible schedule on monoprocessor hard real-time systems.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2022EDP7073/_p
Copiar
@ARTICLE{e105-d_10_1726,
author={Ana GUASQUE, Patricia BALBASTRE, },
journal={IEICE TRANSACTIONS on Information},
title={Evaluation and Comparison of Integer Programming Solvers for Hard Real-Time Scheduling},
year={2022},
volume={E105-D},
number={10},
pages={1726-1733},
abstract={In order to obtain a feasible schedule of a hard real-time system, heuristic based techniques are the solution of choice. In the last few years, optimization solvers have gained attention from research communities due to their capability of handling large number of constraints. Recently, some works have used integer linear programming (ILP) for solving mono processor scheduling of real-time systems. In fact, ILP is commonly used for static scheduling of multiprocessor systems. However, two main solvers are used to solve the problem indistinctly. But, which one is the best for obtaining a schedulable system for hard real-time systems? This paper makes a comparison of two well-known optimization software packages (CPLEX and GUROBI) for the problem of finding a feasible schedule on monoprocessor hard real-time systems.},
keywords={},
doi={10.1587/transinf.2022EDP7073},
ISSN={1745-1361},
month={October},}
Copiar
TY - JOUR
TI - Evaluation and Comparison of Integer Programming Solvers for Hard Real-Time Scheduling
T2 - IEICE TRANSACTIONS on Information
SP - 1726
EP - 1733
AU - Ana GUASQUE
AU - Patricia BALBASTRE
PY - 2022
DO - 10.1587/transinf.2022EDP7073
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E105-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2022
AB - In order to obtain a feasible schedule of a hard real-time system, heuristic based techniques are the solution of choice. In the last few years, optimization solvers have gained attention from research communities due to their capability of handling large number of constraints. Recently, some works have used integer linear programming (ILP) for solving mono processor scheduling of real-time systems. In fact, ILP is commonly used for static scheduling of multiprocessor systems. However, two main solvers are used to solve the problem indistinctly. But, which one is the best for obtaining a schedulable system for hard real-time systems? This paper makes a comparison of two well-known optimization software packages (CPLEX and GUROBI) for the problem of finding a feasible schedule on monoprocessor hard real-time systems.
ER -