This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05)
Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor
Hong Kong, China
August 17-August 19
ISBN: 0-7695-2346-3
ASCII Text
x 
 
Hui Xue Zhao, Serge Midonnet, Laurent George, "Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor," 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, pp. 23-29, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/RTCSA.2005.103,
author = {Hui Xue Zhao and Serge Midonnet and Laurent George},
title = {Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor},
journal ={2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications},
volume = {0},
year = {2005},
issn = {1533-2306},
pages = {23-29},
doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2005.103},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
TI - Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor
SN - 1533-2306
SP23
EP29
A1 - Hui Xue Zhao,
A1 - Serge Midonnet,
A1 - Laurent George,
PY - 2005
KW - feasibility analysis
KW - fixed priority scheduling
KW - non preemptive/preemptive
KW - precedence constraint real time
KW - worst case response time
VL - 0
JA - 2012 IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
ER -
 
Hui Xue Zhao, ESIGETEL and LISSI Universit? Paris 12
Serge Midonnet, ESIGETEL and IGM Universit? de Marne la Vall?
Laurent George, LACSC, ECE and LISSI Universit? Paris 12
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.
Index Terms:
feasibility analysis, fixed priority scheduling, non preemptive/preemptive, precedence constraint real time, worst case response time
Citation:
Hui Xue Zhao, Serge Midonnet, Laurent George, "Worst Case Response Time Analysis of Sporadic Graph Tasks with Fixed Priority Scheduling on a Uniprocessor," rtcsa, pp.23-29, 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.