Aperiodic task scheduling for Hard-Real-Time systems

By B. Sprunt, Lui Raymond Sha, John P. Lehoczky. Real-time systems, 2006

590 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/64ed2d0af8b9ac845c38ab18e620bd1f92bd2b54

How researchers see this paper

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

In Computer Networks and Communications

1. Alan Burns
2. Aloysius Ka-Lau Mok
3. Giorgio C. Buttazzo
4. Tarek F. Abdelzaher
5. Marco Caccamo
6. Lui Raymond Sha
7. T. Baker
8. P. Arun Raj Kumar

In Hardware and Architecture

1. Alan Burns
2. Aloysius Ka-Lau Mok
3. Giorgio C. Buttazzo
4. Tarek F. Abdelzaher
5. Marco Caccamo
6. T. Baker
7. Robert I. Davis
8. Björn B. Brandenburg

Citations in the corpus

• Rate Monotonic vs. EDF: Judgment Day (2003, unknown): “, 1995), and the Sporadic Server (Sprunt et al., 1989), which have good responsiveness and easy implementation complexity.”
• Real Time Scheduling Theory: A Historical Perspective (2004, background): “The Priority Exchange, Deferrable Server [217, 124], and Sporadic Server algorithms [206]1 are based on principles similar to those underlying the polling server.”