Partitioned Aperiodic Scheduling on Multiprocessors
Paper i proceeding, 2003

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.

Författare

Björn Andersson

Chalmers, Institutionen för datorteknik

T. Abdelzaher

University of Virginia

Jan Jonsson

Chalmers, Institutionen för datorteknik

Proceedings. International Parallel and Distributed Processing Symposium, 2003

1530-2075 (ISSN)

Ämneskategorier

Datorteknik

DOI

10.1109/IPDPS.2003.1213083

ISBN

0-7695-1926-1