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
하드 실시간 시스템의 실행 가능한 일정을 얻기 위해서는 휴리스틱 기반 기술이 선택되는 솔루션입니다. 지난 몇 년 동안 최적화 솔버는 수많은 제약 조건을 처리하는 능력으로 인해 연구 커뮤니티로부터 주목을 받았습니다. 최근 일부 연구에서는 실시간 시스템의 모노 프로세서 스케줄링을 해결하기 위해 정수 선형 프로그래밍(ILP)을 사용했습니다. 실제로 ILP는 다중 프로세서 시스템의 정적 스케줄링에 일반적으로 사용됩니다. 그러나 문제를 불분명하게 해결하기 위해 두 가지 주요 솔버가 사용됩니다. 그러나 하드 실시간 시스템을 위한 예약 가능한 시스템을 확보하는 데 가장 적합한 시스템은 무엇입니까? 이 문서에서는 단일 프로세서 하드 실시간 시스템에서 실행 가능한 일정을 찾는 문제에 대해 두 가지 잘 알려진 최적화 소프트웨어 패키지(CPLEX 및 GUROBI)를 비교합니다.
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.
부
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
부
@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},}
부
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 -