Partitioned Aperiodic Scheduling on Multiprocessors

Nice, France April 22-April 26

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213083

International Parallel and Distribute ...

	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 Tarek Abdelzaher Articles by Jan Jonsson

	ASCII Text	x
	Björn Andersson, Tarek Abdelzaher, Jan Jonsson, "Partitioned Aperiodic Scheduling on Multiprocessors," Parallel and Distributed Processing Symposium, International, pp. 8b, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003.

	BibTex	x
	@article{ 10.1109/IPDPS.2003.1213083, author = {Björn Andersson and Tarek Abdelzaher and Jan Jonsson}, title = {Partitioned Aperiodic Scheduling on Multiprocessors}, journal ={Parallel and Distributed Processing Symposium, International}, volume = {0}, year = {2003}, issn = {1530-2075}, pages = {8b}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213083}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel and Distributed Processing Symposium, International TI - Partitioned Aperiodic Scheduling on Multiprocessors SN - 1530-2075 SP EP A1 - Björn Andersson, A1 - Tarek Abdelzaher, A1 - Jan Jonsson, PY - 2003 KW - real-time scheduling KW - multiprocessor systems KW - aperiodic tasks KW - EDF KW - partitioning KW - online scheduling VL - 0 JA - Parallel and Distributed Processing Symposium, International ER -

Björn Andersson, Chalmers University of Technology

Tarek Abdelzaher, University of Virginia

Jan Jonsson, Chalmers University of Technology

This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0.31. No algorithm for tasks without migration capabilities can have a capacity bound greater than 0.50.

Index Terms:

real-time scheduling, multiprocessor systems, aperiodic tasks, EDF, partitioning, online scheduling

Citation:

Björn Andersson, Tarek Abdelzaher, Jan Jonsson, "Partitioned Aperiodic Scheduling on Multiprocessors," ipdps, pp.8b, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003

Peer Review Notice | Give Us Feedback

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