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 条
  • [41] New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
    Guan, Nan
    Stigge, Martin
    Yi, Wang
    Yu, Ge
    2009 30TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 2009, : 387 - +
  • [42] Schedulability Analysis for Real-Time P-FRP Tasks Under Fixed Priority Scheduling
    Jiang, Yu
    Cheng, Albert M. K.
    Zou, Xingliang
    2015 IEEE 21ST INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, 2015, : 31 - 40
  • [43] Energy aware fixed priority scheduling for real time sporadic task with task synchronization
    Zhang, Yi-wen
    Wang, Cheng
    Liu, Jin
    JOURNAL OF SYSTEMS ARCHITECTURE, 2018, 83 : 12 - 22
  • [44] Multiprocessor Scheduling of an SDF Graph with Library Tasks Considering the Worst Case Contention Delay
    Jung, Hanwoong
    Oh, Hyunok
    Ha, Soonhoi
    14TH ACM/IEEE SYMPOSIUM ON EMBEDDED SYSTEMS FOR REAL-TIME MULTIMEDIA (ESTIMEDIA 2016), 2016, : 84 - 93
  • [45] Scheduling with precedence constraints: Worst-case analysis of priority algorithms
    Singh, G
    BULLETIN OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2003, 67 (02) : 351 - 352
  • [46] Real-time scheduling of non-preemptive sporadic tasks on uniprocessor systems using supervisory control of timed DES
    Devaraj, Rajesh
    Sarkar, Arnab
    Biswas, Santosh
    2017 AMERICAN CONTROL CONFERENCE (ACC), 2017, : 3212 - 3217
  • [47] Response Time Analysis for Fixed Priority Servers
    Hamann, Arne
    Dasari, Dakshina
    Martinez, Jorge
    Ziegenbein, Dirk
    PROCEEDINGS OF THE 26TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS (RTNS 2018), 2018,
  • [48] Fixed-Parameter Analysis of Preemptive Uniprocessor Scheduling Problems
    Baruah, Sanjoy
    Ekberg, Pontus
    Singh, Abhishek
    2022 IEEE 43RD REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2022), 2022, : 185 - 196
  • [49] Scheduling fixed-priority hard real-time tasks in the presence of faults
    Lima, G
    Burns, A
    DEPENDABLE COMPUTING, PROCEEDINGS, 2005, 3747 : 154 - 173
  • [50] Worst case response time analysis of hard real-time sporadic traffic in FIP networks
    Pedro, P
    Burns, A
    NINTH EUROMICRO WORKSHOP ON REAL TIME SYSTEMS, PROCEEDINGS, 1997, : 3 - 10
12345