Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	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 Joël Goossens Articles by Raymond Devillers

Sixth International Conference on Real-Time Computing Systems and Applications (RTCSA'99)

Hong Kong, China

December 13-December 15

ISBN: 0-7695-0306-3

	ASCII Text	x
	Joël Goossens, Raymond Devillers, "Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines," Real-Time Computing Systems and Applications, International Workshop on, pp. 54, Sixth International Conference on Real-Time Computing Systems and Applications (RTCSA'99), 1999.

	BibTex	x
	@article{ 10.1109/RTCSA.1999.811193, author = {Joël Goossens and Raymond Devillers}, title = {Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {1999}, issn = {1530-1427}, pages = {54}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1999.811193}, 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 - Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines SN - 1530-1427 SP EP A1 - Joël Goossens, A1 - Raymond Devillers, PY - 1999 KW - hard real-time scheduling KW - periodic task set KW - arbitrary deadline KW - feasibility interval KW - Deadline driven scheduler VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

Joël Goossens, Universit? Libre de Bruxelles

Raymond Devillers, Universit? Libre de Bruxelles

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.1999.811193

In this paper, we extend the determination of feasibility intervals to task sets with arbitrary deadlines, both in the synchronous and the asynchronous case. Meanwhile we also improve the arguments and results generally found in the literature.

Index Terms:

hard real-time scheduling, periodic task set, arbitrary deadline, feasibility interval, Deadline driven scheduler

Citation:

Joël Goossens, Raymond Devillers, "Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines," rtcsa, pp.54, Sixth International Conference on Real-Time Computing Systems and Applications (RTCSA'99), 1999

Peer Review Notice | Give Us Feedback

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