Schedulability comparisons among periodic and distance-constrained real-time schedulers

	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
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Chih-Wen Hsueh Articles by K.-J. Lin

Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97)

Taipei, TAIWAN

October 27-October 29

ISBN: 0-8186-8073-3

	ASCII Text	x
	Chih-Wen Hsueh, K.-J. Lin, "Schedulability comparisons among periodic and distance-constrained real-time schedulers," Real-Time Computing Systems and Applications, International Workshop on, pp. 60, Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97), 1997.

	BibTex	x
	@article{ 10.1109/RTCSA.1997.629174, author = {Chih-Wen Hsueh and K.-J. Lin}, title = {Schedulability comparisons among periodic and distance-constrained real-time schedulers}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {1997}, isbn = {0-8186-8073-3}, pages = {60}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.1997.629174}, 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 - Schedulability comparisons among periodic and distance-constrained real-time schedulers SN - 0-8186-8073-3 SP EP A1 - Chih-Wen Hsueh, A1 - K.-J. Lin, PY - 1997 KW - real-time systems; schedulability comparisons; distance-constrained real-time schedulers; real-time system; timing constraints; pinwheel schedulers; transformed harmonic distance constraints VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

Chih-Wen Hsueh, Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA

K.-J. Lin, Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA

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

Tasks in a real-time system must be scheduled to meet their timing constraints. In this paper, we discuss the schedulability relationship among two well-known schedulers EDF and RM, and a recently proposed scheduler Sr/sup b/. We also compare the schedulability of Sr/sup b/ to other pinwheel schedulers Sx, Sr, and Sx/sup b/. Although EDF has the biggest schedulable task set than RM and Sr/sup b/, the schedules produced by EDF are the most vulnerable to system overloads and with the least predictability. RM has a better predictability than EDF for tasks with a high priority but not for lower priority tasks. Since Sr/sup b/ schedules the tasks according to a set of transformed harmonic distance constraints, the produced schedule is very regular and provides the best predictability.

Index Terms:

real-time systems; schedulability comparisons; distance-constrained real-time schedulers; real-time system; timing constraints; pinwheel schedulers; transformed harmonic distance constraints

Citation:

Chih-Wen Hsueh, K.-J. Lin, "Schedulability comparisons among periodic and distance-constrained real-time schedulers," rtcsa, pp.60, Fourth International Workshop on Real-Time Computing Systems and Applications (RTCSA'97), 1997

Peer Review Notice | Give Us Feedback

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