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 条

[1] Worst case response time analysis of sporadic graph tasks with EDF scheduling on a uniprocessor
Zhao, Hui Xue
George, Laurent
Midonnet, Serge
12TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2006, : 271 - +
[2] Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
Bril, Reinder J.
Lukkien, Johan J.
Verhaegh, Wim F. J.
REAL-TIME SYSTEMS, 2009, 42 (1-3) : 63 - 119
[3] Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
Reinder J. Bril
Johan J. Lukkien
Wim F. J. Verhaegh
Real-Time Systems, 2009, 42 : 63 - 119
[4] Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption revisited
Bril, Reinder J.
Lukkien, Johan J.
Verhaegh, Wim F. J.
19TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2007, : 269 - +
[5] Execution overrun management for fixed-priority preemptive scheduling of sporadic graph tasks
Bougueroua, Lamine
Zhao, Hui Xue
George, Laurent
Midonnet, Serge
2006 IEEE CONFERENCE ON EMERGING TECHNOLOGIES & FACTORY AUTOMATION, VOLS 1 -3, 2006, : 245 - +
[6] Worst-case response time analysis for partitioned fixed-priority DAG tasks on identical processors
Ben-Amor, Slim
Cucu-Grosjean, Liliana
Maxim, Dorin
2019 24TH IEEE INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2019, : 1423 - 1426
[7] Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks
Chen, Jian-Jia
PROCEEDINGS OF THE 28TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS ECRTS 2016, 2016, : 251 - 261
[8] Speeding Up the Schedulability Analysis and Priority Assignment of Sporadic Tasks Under Uniprocessor FPNS
Zhang, Weizhe
Bai, Enci
Li, Jing
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (10) : 6382 - 6392
[9] Analysis of Deadline Miss Rates for Uniprocessor Fixed-Priority Scheduling
Chen, Kuan-Hsun
von der Brueggen, Georg
Chen, Jian-Jia
2018 IEEE 24TH INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS (RTCSA), 2018, : 168 - 178
[10] Response Time Bounds for Sporadic Arbitrary-Deadline Tasks under Global Fixed-Priority Scheduling on Multiprocessors
Huang, Wen-Hung
Chen, Jian-Jia
PROCEEDINGS OF THE 23RD INTERNATIONAL CONFERENCE ON REAL-TIME AND NETWORKS SYSTEMS (RTNS) 2015, 2015, : 215 - 224

← 1 2 3 4 5 →