DocumentCode
2272556
Title
Sporadic Multiprocessor Scheduling with Few Preemptions
Author
Andersson, Bjorn ; Bletsas, Konstantinos
Author_Institution
IPP-HURRAY! Res. Group, Polytech. Inst. of Porto (ISEP-IPP), Porto
fYear
2008
fDate
2-4 July 2008
Firstpage
243
Lastpage
252
Abstract
Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions).
Keywords
processor scheduling; interarrival time; sporadic multiprocessor scheduling; worst-case execution time; Algorithm design and analysis; Dispatching; Frequency; Partitioning algorithms; Process design; Processor scheduling; Real time systems; Scheduling algorithm; multiprocessor; real-time; scheduling; sporadic;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems, 2008. ECRTS '08. Euromicro Conference on
Conference_Location
Prague
ISSN
1068-3070
Print_ISBN
978-0-7695-3298-1
Type
conf
DOI
10.1109/ECRTS.2008.9
Filename
4573120
Link To Document