DocumentCode
2404485
Title
Multiprocessor EDF and deadline monotonic schedulability analysis
Author
Baker, Theodore P.
Author_Institution
Dept. of Comput. Sci., Florida State Univ., Tallahassee, FL, USA
fYear
2003
fDate
3-5 Dec. 2003
Firstpage
120
Lastpage
129
Abstract
Schedulability tests are presented for preemptive earlier-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a single-queue m-server system, in which the deadline of a task may be less than or equal to the task period. These results subsume and generalize several known utilization-based multiprocessor schedulability tests, and are derived via an independent proof.
Keywords
multiprocessing systems; processor scheduling; queueing theory; real-time systems; resource allocation; deadline-monotonic scheduling; multiprocessors; periodic real-time tasks; preemptive earlier-deadline-first scheduling; schedulability tests; single-queue m-server system; sporadic real-time tasks; utilization-based multiprocessor; Computer science; Delta modulation; Multiprocessing systems; Processor scheduling; Real time systems; Scheduling algorithm; Sufficient conditions; System testing; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Real-Time Systems Symposium, 2003. RTSS 2003. 24th IEEE
Print_ISBN
0-7695-2044-8
Type
conf
DOI
10.1109/REAL.2003.1253260
Filename
1253260
Link To Document