loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
24th IEEE International Real-Time Systems Symposium (RTSS'03)
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
Cancun, Mexico
December 03-December 05
ISBN: 0-7695-2044-8
Theodore P. Baker, Florida State University, Tallahassee
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a single-queue-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.
Citation:
Theodore P. Baker, "Multiprocessor EDF and Deadline Monotonic Schedulability Analysis," rtss, pp.120, 24th IEEE International Real-Time Systems Symposium (RTSS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.