Real Time Scheduling Theory: A Historical Perspective
By Lui Raymond Sha, Tarek F. Abdelzaher, Karl-Erik Årzén, A. Cervin, T. Baker, Alan Burns, Giorgio C. Buttazzo, Marco Caccamo, John P. Lehoczky, Aloysius Ka-Lau Mok. Real-time systems, 2004
665 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Hardware and Architecture
View Paper: https://www.semanticscholar.org/paper/06fddf2c514c22c926d1542afd2a3510ba01d90a
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
- Alberto L. Sangiovanni-Vincentelli
- Kim Guldstrand Larsen
- Edward A. Lee
- Kyoung-Dae Kim
- Werner Damm
- Roberto Passerone
- Sanjit A. Seshia
- P. Arun Raj Kumar
In Hardware and Architecture
- Alberto L. Sangiovanni-Vincentelli
- Werner Damm
- Roberto Passerone
- Edward A. Lee
- Thomas A. Henzinger
- Dejan Nickovic
- Albert Benveniste
- Kim Guldstrand Larsen
Citations in the corpus
- Introduction to Embedded Systems - A Cyber-Physical Systems Approach (2013, background): “In 1990, Sha et al. (1990) gave a solution to the priority inversion problem called priority inheritance.”
- An Evaluation of SMT-Based Schedule Synthesis for Time-Triggered Multi-hop Networks (2010, background): “A reflection on the last decades of real-time scheduling is given in [14] with a focus on dynamic scheduling.”
- Control: A perspective (2014, methodology): “This conservatism can be reduced by applying scheduling algorithms based on feedback [22,594].”
- Contracts for System Design (2018, background): “In the literature about real-time scheduling analysis [189, 69, 238], there exist a common understanding about typical task parameters, which are important for 1) defining timing constraints and 2) defining algorithms solving scheduling problems like checking feasibility of a schedule or the schedul”
- Cyber–Physical Systems: A Perspective at the Centennial (2012, background): “This motivated the development in 1973 of real-time computation [6],[7], which involved the problem of how to schedule computational tasks so that every job in every task was completed before its deadline.”