Limited Busy Periods in Response Time Analysis for Tasks Under Global EDF Scheduling

被引:0
|
作者
Zhou, Quan [1 ]
Li, Guohui [2 ]
Zhou, Chunyang [2 ]
Li, Jianjun [1 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan 430074, Peoples R China
[2] Huazhong Univ Sci & Technol, Sch Software Engn, Wuhan 430074, Peoples R China
基金
中国国家自然科学基金;
关键词
Task analysis; Processor scheduling; Job shop scheduling; Real-time systems; Interference; Time factors; Program processors; Accuracy and efficiency; global EDF scheduling; limited busy periods; real-time systems; response time analysis (RTA); SCHEDULABILITY;
D O I
10.1109/TCAD.2020.2994265
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Response time analysis (RTA) is a kind of effective methods to test the schedulability of real-time tasks under the global earliest deadline first (G-EDF) scheduling. The main idea of the RTA methods is to judge the schedulability of the task set by comparing the worst-case response time (WCRT) and deadline of each task. For obtaining a safe WCRT, existing RTA methods assume that the response times of carry-in jobs are equal to the WCRTs of the tasks generating these jobs. This assumption causes the low accuracy of existing RTA methods, since the busy period lengths of carry-in jobs are usually limited and the response times of these jobs thus cannot always reach the assumed WCRTs. This article proposes a new RTA method that has a higher accuracy than existing RTAs. The main idea of the new method is to limit the busy period lengths of carry-in jobs in the WCRT calculation. We also propose an efficiency improvement scheme for the new method. A set of experiments is conducted to evaluate the performances of the new method and the efficiency improvement scheme. The experimental results show that the new method has a higher acceptance ratio than the state-of-the-art RTA methods and the efficiency improvement scheme can significantly reduce the execution time of the new method.
引用
收藏
页码:232 / 245
页数:14
相关论文
共 50 条
  • [1] Improved schedulability analysis of implicit deadline tasks under limited preemption EDF scheduling
    Short, Michael
    [J]. 2011 IEEE 16TH CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2011,
  • [2] Global EDF scheduling for parallel real-time tasks
    Li, Jing
    Luo, Zheng
    Ferry, David
    Agrawal, Kunal
    Gill, Christopher
    Lu, Chenyang
    [J]. REAL-TIME SYSTEMS, 2015, 51 (04) : 395 - 439
  • [3] Global EDF scheduling for parallel real-time tasks
    Jing Li
    Zheng Luo
    David Ferry
    Kunal Agrawal
    Christopher Gill
    Chenyang Lu
    [J]. Real-Time Systems, 2015, 51 : 395 - 439
  • [4] Response Time Analysis for Tasks with Fixed Preemption Points under Global Scheduling
    Zhou, Quan
    Li, Guohui
    Li, Jianjun
    Deng, Chenggang
    Yuan, Ling
    [J]. ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2019, 18 (05)
  • [5] Worst case response time analysis of sporadic graph tasks with EDF scheduling on a uniprocessor
    Zhao, Hui Xue
    George, Laurent
    Midonnet, Serge
    [J]. 12TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2006, : 271 - +
  • [6] Feasibility Analysis of Engine Control Tasks under EDF Scheduling
    Biondi, Alessandro
    Buttazzo, Giorgio
    Simoncelli, Stefano
    [J]. PROCEEDINGS OF THE 2015 27TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS (ECRTS 2015), 2015, : 139 - 148
  • [7] Response time analysis for tasks scheduled under EDF within fixed priorities
    Harbour, MG
    Palencia, JC
    [J]. RTSS 2003: 24TH IEEE INTERNATIONAL REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2003, : 200 - 209
  • [8] Response-Time Analysis of DAG Tasks under Fixed Priority Scheduling with Limited Preemptions
    Serrano, Maria A.
    Melani, Alessandra
    Bertogna, Marko
    Quinones, Eduardo
    [J]. PROCEEDINGS OF THE 2016 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2016, : 1066 - 1071
  • [9] Utilization-Tensity Bound for Real-Time DAG Tasks under Global EDF Scheduling
    Jiang, Xu
    Sun, Jinghao
    Tang, Yue
    Guan, Nan
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2020, 69 (01) : 39 - 50
  • [10] Tardiness Bounds for Sporadic Gang Tasks Under Preemptive Global EDF Scheduling
    Dong, Zheng
    Yang, Kecheng
    Fisher, Nathan
    Liu, Cong
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2021, 32 (12) : 2867 - 2879