Multiprocessor EDF and deadline monotonic schedulability analysis

By T. Baker. RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003, 2003

305 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/b65ba272b2f415c9aa167dad6597463cb3c56539

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Björn B. Brandenburg
2. Aaron D. Block
3. James H. Anderson
4. Hennadiy Leontyev
5. Umamaheswari Devi
6. John M. Calandrino
7. Alan Burns
8. Aloysius Ka-Lau Mok

In Hardware and Architecture

1. Björn B. Brandenburg
2. Alan Burns
3. Aaron D. Block
4. James H. Anderson
5. Hennadiy Leontyev
6. Umamaheswari Devi
7. John M. Calandrino
8. Aloysius Ka-Lau Mok

Citations in the corpus

• Real Time Scheduling Theory: A Historical Perspective (2004, methodology): “This algorithm can guarantee a system utilization least (m+1)/3 for θ = 1/3 [28].”
• Scheduling and locking in multiprocessor real-time operating systems (2011, background): “17: Illustration of Baker’s problem window analysis (Baker, 2003) for m = 3 processors.”
• LITMUS^RT : A Testbed for Empirically Comparing Real-Time Multiprocessor Schedulers (2006, methodology): “For G-EDF, the sufficient schedulability test in [4, 12] was used.”