TY - GEN
T1 - Schedulability of Strictly Periodic Tasks with Communication Dependence
AU - Wang, Jiahui
AU - Chen, Jinchao
AU - Du, Chenglie
AU - Han, Pengcheng
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/6
Y1 - 2020/6
N2 - Non-preemptive tasks with strict periods are usually adopted in practical multi-core real-time systems when continual sampling and processing of data are required. Systems designers need to provide a proper scheduling strategy such that the tasks deadlines will be met even under the worst-case conditions. In this paper, we study the scheduling problem of non-preemptive tasks with strict periods in multi-core real-time systems. First, we analyze the characteristics of the multi-core real-time system, build a task model with strict periodic constraints, analyze the requirements of space resources, time resources and communication delay when the system can be scheduled, and propose a solution to determine the task schedulability based on mixed integer linear programming. The practical results show that the proposed solution can not only be used to determine the schedulability of multi-core real-time system, but also to obtain the minimum number of processors needed by the system, which can guide the design of the system.
AB - Non-preemptive tasks with strict periods are usually adopted in practical multi-core real-time systems when continual sampling and processing of data are required. Systems designers need to provide a proper scheduling strategy such that the tasks deadlines will be met even under the worst-case conditions. In this paper, we study the scheduling problem of non-preemptive tasks with strict periods in multi-core real-time systems. First, we analyze the characteristics of the multi-core real-time system, build a task model with strict periodic constraints, analyze the requirements of space resources, time resources and communication delay when the system can be scheduled, and propose a solution to determine the task schedulability based on mixed integer linear programming. The practical results show that the proposed solution can not only be used to determine the schedulability of multi-core real-time system, but also to obtain the minimum number of processors needed by the system, which can guide the design of the system.
KW - multi-core system
KW - multi-task scheduling
KW - non-preemptive scheduling
KW - strictly periodic task
UR - http://www.scopus.com/inward/record.url?scp=85091071385&partnerID=8YFLogxK
U2 - 10.1109/ITOEC49072.2020.9141794
DO - 10.1109/ITOEC49072.2020.9141794
M3 - 会议稿件
AN - SCOPUS:85091071385
T3 - Proceedings of 2020 IEEE 5th Information Technology and Mechatronics Engineering Conference, ITOEC 2020
SP - 1134
EP - 1138
BT - Proceedings of 2020 IEEE 5th Information Technology and Mechatronics Engineering Conference, ITOEC 2020
A2 - Xu, Bing
A2 - Mou, Kefen
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th IEEE Information Technology and Mechatronics Engineering Conference, ITOEC 2020
Y2 - 12 June 2020 through 14 June 2020
ER -