The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%

Porto, Portugal July 02-July 04

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/EMRTS.2003.1212725

15th Euromicro Conference on Real-Tim ...

	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 Björn Andersson Articles by Jan Jonsson

	ASCII Text	x
	Björn Andersson, Jan Jonsson, "The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%," Real-Time Systems, Euromicro Conference on, pp. 33, 15th Euromicro Conference on Real-Time Systems (ECRTS'03), 2003.

	BibTex	x
	@article{ 10.1109/EMRTS.2003.1212725, author = {Björn Andersson and Jan Jonsson}, title = {The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%}, journal ={Real-Time Systems, Euromicro Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1936-9}, pages = {33}, doi = {http://doi.ieeecomputersociety.org/10.1109/EMRTS.2003.1212725}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Systems, Euromicro Conference on TI - The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50% SN - 0-7695-1936-9 SP EP A1 - Björn Andersson, A1 - Jan Jonsson, PY - 2003 KW - null VL - 0 JA - Real-Time Systems, Euromicro Conference on ER -

Björn Andersson, Chalmers University of Technology

Jan Jonsson, Chalmers University of Technology

This paper studies preemptive static-priority scheduling on multiprocessors. We consider two approaches: global pfair static-priority scheduling and partitioned traditional static-priority scheduling. We prove that if presented algorithms are used and if less than 50% of the capacity is used then all deadlines are met. It is known that no static-priority multiprocessor scheduling algorithm can achieve a utilization bound greater than 50%.

Citation:

Björn Andersson, Jan Jonsson, "The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%," ecrts, pp.33, 15th Euromicro Conference on Real-Time Systems (ECRTS'03), 2003

Peer Review Notice | Give Us Feedback

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