loading...
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
Cancun, Mexico December 03-December 05
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/REAL.2003.125326024th IEEE International Real-Time Sys ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.