DocumentCode
1659079
Title
Partitioned aperiodic scheduling on multiprocessors
Author
Andersson, Björn ; Abdelzaher, Tarek ; Jonsson, Jan
Author_Institution
Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden
fYear
2003
Abstract
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.
Keywords
parallel algorithms; processor scheduling; aperiodic tasks; capacity bound; multiprocessor scheduling; partitioned aperiodic scheduling; Admission control; Computational complexity; Frequency; Parallel processing; Partitioning algorithms; Processor scheduling; Real time systems; Research initiatives; Scheduling algorithm; Web server;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium, 2003. Proceedings. International
ISSN
1530-2075
Print_ISBN
0-7695-1926-1
Type
conf
DOI
10.1109/IPDPS.2003.1213083
Filename
1213083
Link To Document