Worst Case Response Time Analysis of Sporadic Graph Tasks with EDF Scheduling on a Uniprocessor

Sydney, Australia August 16-August 18

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/RTCSA.2006.65

12th IEEE International Conference on ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Hui Xue Zhao Articles by Laurent George Articles by Serge Midonnet

	ASCII Text	x
	Hui Xue Zhao, Laurent George, Serge Midonnet, "Worst Case Response Time Analysis of Sporadic Graph Tasks with EDF Scheduling on a Uniprocessor," Real-Time Computing Systems and Applications, International Workshop on, pp. 271-278, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), 2006.

	BibTex	x
	@article{ 10.1109/RTCSA.2006.65, author = {Hui Xue Zhao and Laurent George and Serge Midonnet}, title = {Worst Case Response Time Analysis of Sporadic Graph Tasks with EDF Scheduling on a Uniprocessor}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {2006}, issn = {1533-2306}, pages = {271-278}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2006.65}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Computing Systems and Applications, International Workshop on TI - Worst Case Response Time Analysis of Sporadic Graph Tasks with EDF Scheduling on a Uniprocessor SN - 1533-2306 SP271 EP278 A1 - Hui Xue Zhao, A1 - Laurent George, A1 - Serge Midonnet, PY - 2006 KW - null VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

Hui Xue Zhao, ESIGETEL, France

Laurent George, LACSC, ECE, France

Serge Midonnet, IGM - Universit? de Marne la Vall?e, France

This paper considers the problem of preemptive hard real-time scheduling of sporadic graph tasks on a uniprocessor with Earliest Deadline First (EDF). A sporadic graph task associated to an application is characterized by a set of subtasks under precedence constraints with deadline constraints. We study feasibility conditions based on the computation of the worst case response time of any subtask of a graph task. We investigate the late deadline constraint.

Citation:

Hui Xue Zhao, Laurent George, Serge Midonnet, "Worst Case Response Time Analysis of Sporadic Graph Tasks with EDF Scheduling on a Uniprocessor," rtcsa, pp.271-278, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), 2006

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.