On satisfying timing constraints in hard-real-time systems
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 19 (1) , 70-84
- https://doi.org/10.1109/32.210308
Abstract
The authors explain why pre-run-time scheduling is essential if one wishes to guarantee that timing constraints will be satisfied in a large complex hard-real-time system. They examine some of the major concerns in pre-run-time scheduling and consider what formulations of mathematical scheduling problems can be used to address those concerns. This work provides a guide to the available algorithms.<>Keywords
This publication has 44 references indexed in Scilit:
- Multiprocessor online scheduling of hard-real-time tasksIEEE Transactions on Software Engineering, 1989
- Real-Time Euclid: A language for reliable real-time systemsIEEE Transactions on Software Engineering, 1986
- Preemptive Scheduling with Release Times, Deadlines, and Due TimesJournal of the ACM, 1982
- Formal Specification and Mechanical Verification of SIFT: A Fault-Tolerant Flight Control SystemIEEE Transactions on Computers, 1982
- Scheduling periodically occurring tasks on multiple processorsInformation Processing Letters, 1981
- A note on preemptive scheduling of periodic, real-time tasksInformation Processing Letters, 1980
- Guaranteed Response Times in a Hard-Real-Time EnvironmentIEEE Transactions on Software Engineering, 1980
- On Scheduling with Ready Times and Due Dates to Minimize Maximum LatenessOperations Research, 1975
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973