Worst case response time analysis of sporadic graph tasks with fixed priority scheduling on a uniprocessor

被引：0
|
作者：
Zhao, HX [1 ]
Midonnet, S [1 ]
George, L [1 ]
机构：
[1] ESIGETEL, F-77210 Avon, France
来源：
11TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS | 2005年
关键词：
feasibility analysis; fixed priority scheduling; non-preemptive/preemptive; precedence constraint real-time; worst case response time;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper considers the problem of hard real-time fixed priority scheduling of sporadic graph tasks on a uniprocessor. We study feasibility conditions based on the computation of the worst case response times of the graph tasks. A sporadic graph task associated to an application is characterized by a set of subtasks under precedence constraints. We investigate the late deadline constraint. We extend already published papers established in the preemptive case to the non-preemptive case and to the hybrid case of an application composed of preemptive and non preemptive subtasks.
引用
下载
收藏
页码：23 / 29
页数：7
相关论文
共 50 条
  • [31] Response Time Analysis for Hybrid Task Sets under Fixed Priority Scheduling
    Zhou, Quan
    Huang, Jihua
    Li, Jianjun
    Li, Zhi
    2022 IEEE 28TH REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS), 2022, : 108 - 120
  • [32] Improving the Response Time Analysis of Global Fixed-Priority Multiprocessor Scheduling
    Sun, Youcheng
    Lipari, Giuseppe
    Guan, Nan
    Yi, Wang
    2014 IEEE 20TH INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA), 2014,
  • [33] On Fixed-Priority Schedulability Analysis of Sporadic Tasks with Self-Suspension
    Mohaqeqi, Morteza
    Ekberg, Pontus
    Yi, Wang
    PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS PROCEEDINGS (RTNS 2016), 2016, : 109 - 118
  • [34] An FPTAS for Response Time Analysis of Fixed Priority Real-Time Tasks with Resource Augmentation
    Thi Huyen Chau Nguyen
    Richard, Pascal
    Grolleau, Emmanuel
    IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (07) : 1805 - 1818
  • [35] Uniprocessor scheduling of real-time synchronous dataflow tasks
    Abhishek Singh
    Pontus Ekberg
    Sanjoy Baruah
    Real-Time Systems, 2019, 55 : 1 - 31
  • [36] Response Time Analysis for Tasks with Fixed Preemption Points under Global Scheduling
    Zhou, Quan
    Li, Guohui
    Li, Jianjun
    Deng, Chenggang
    Yuan, Ling
    ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2019, 18 (05)
  • [37] ON THE COMPLEXITY OF FIXED-PRIORITY SCHEDULING OF PERIODIC, REAL-TIME TASKS
    LEUNG, JYT
    WHITEHEAD, J
    PERFORMANCE EVALUATION, 1982, 2 (04) : 237 - 250
  • [38] Towards best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds
    Rivera-Verduzco, Hector J.
    Bril, Reinder J.
    2017 22ND IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2017,
  • [39] Probabilistic Schedulability Tests for Uniprocessor Fixed-Priority Scheduling under Soft Errors
    Chen, Kuan-Hsun
    Chen, Jian-Jia
    2017 12TH IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL EMBEDDED SYSTEMS (SIES), 2017, : 107 - 114
  • [40] Starvation-avoidance CAN Scheduling for Shorter Worst-case Response Time with Priority Queues
    Kimm, Haklin
    Chelladurai, Jeyaprakash
    2020 21ST IEEE INTERNATIONAL SYMPOSIUM ON A WORLD OF WIRELESS, MOBILE AND MULTIMEDIA NETWORKS (IEEE WOWMOM 2020), 2020, : 373 - 378
12345