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 条

[21] Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling
Balbastre, Patricia
Ripoll, Ismael
Crespo, Alfons
2009 15TH IEEE INTERNATIONAL CONFERENCE ON EMBEDDED AND REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS, 2009, : 315 - 320
[22] Timing Analysis of Fixed Priority Self-Suspending Sporadic Tasks
Nelissen, Geoffrey
Fonseca, Jose
Raravit, Gurulingesh
Neils, Vincent
PROCEEDINGS OF THE 2015 27TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS (ECRTS 2015), 2015, : 80 - 89
[23] Worst-Case Response Time Analysis of a Synchronous Dataflow Graph in a Multiprocessor System with Real-Time Tasks
Choi, Junchul
Ha, Soonhoi
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2017, 22 (02)
[24] Improved Uniprocessor Scheduling of Systems of Sporadic Constrained-Deadline Elastic Tasks
Baruah, Sanjoy
PROCEEDINGS OF 31ST INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS, RTNS 2023, 2023, : 67 - 75
[25] Improved Response Time Analysis of Sporadic DAG Tasks for Global FP Scheduling
Fonseca, Jose
Nelissen, Geoffrey
Nelis, Vincent
PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS (RTNS 2017), 2017, : 28 - 37
[26] Response Time Analysis for Fixed-Priority Tasks with Multiple Probabilistic Parameters
Maxim, Dorin
Cucu-Grosjean, Liliana
IEEE 34TH REAL-TIME SYSTEMS SYMPOSIUM (RTSS 2013), 2013, : 224 - 235
[27] Schedulability Analysis of Fixed Priority Servers for Scheduling Aperiodic Real-Time Tasks - A Review
Zhang, Fengxiang
MATERIAL SCIENCE, CIVIL ENGINEERING AND ARCHITECTURE SCIENCE, MECHANICAL ENGINEERING AND MANUFACTURING TECHNOLOGY II, 2014, 651-653 : 1933 - 1936
[28] Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time Tasks
Sun, Youcheng
Di Natale, Marco
ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2017, 16
[29] Best-case response times of real-time tasks under fixed-priority scheduling with preemption thresholds
Rivera-Verduzco, Hector J.
Bril, Reinder J.
PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS (RTNS 2017), 2017, : 307 - 317
[30] Uniprocessor scheduling of real-time synchronous dataflow tasks
Singh, Abhishek
Ekberg, Pontus
Baruah, Sanjoy
REAL-TIME SYSTEMS, 2019, 55 (01) : 1 - 31

← 1 2 3 4 5 →