DocumentCode
2381597
Title
Fixed-Priority Multiprocessor Scheduling with Liu and Layland´s Utilization Bound
Author
Guan, Nan ; Stigge, Martin ; Yi, Wang ; Yu, Ge
fYear
2010
fDate
12-15 April 2010
Firstpage
165
Lastpage
174
Abstract
Liu and Layland discovered the famous utilization bound for fixed-priority scheduling on single processor systems in the 1970´s. Since then, it has been a long standing open problem to find fixed-priority scheduling algorithms with the same bound for multiprocessor systems. In this paper, we present a partitioning-based fixed-priority multiprocessor scheduling algorithm with Liu and Layland´s utilization bound.
Keywords
multiprocessing systems; processor scheduling; Liu and Layland utilization bound; fixed priority scheduling; partitioning based fixed priority multiprocessor scheduling; single processor systems; Application software; Computer science; H infinity control; Information technology; Multiprocessing systems; Partitioning algorithms; Processor scheduling; Real time systems; Scheduling algorithm; Testing; fixed priority scheduling; multiprocessor; real-time systems; utilization bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time and Embedded Technology and Applications Symposium (RTAS), 2010 16th IEEE
Conference_Location
Stockholm
ISSN
1080-1812
Print_ISBN
978-1-4244-6690-0
Electronic_ISBN
1080-1812
Type
conf
DOI
10.1109/RTAS.2010.39
Filename
5465974
Link To Document