Some Results of the Earliest Deadline Scheduling Algorithm
- 1 October 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 15 (10), 1261-1269
- https://doi.org/10.1109/tse.1989.559777
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A fault-tolerant scheduling problemIEEE Transactions on Software Engineering, 1986
- On Scheduling Tasks with a Quick Recovery from FailureIEEE Transactions on Computers, 1986
- Dynamic Task Scheduling in Hard Real-Time Distributed systemsIEEE Software, 1984
- Scheduling periodically occurring tasks on multiple processorsInformation Processing Letters, 1981
- A note on preemptive scheduling of periodic, real-time tasksInformation Processing Letters, 1980
- Reliability Issues in Computing System DesignACM Computing Surveys, 1978
- Deterministic Processor SchedulingACM Computing Surveys, 1977
- Fault-Tolerant Software for Real-Time ApplicationsACM Computing Surveys, 1976
- Some simple scheduling algorithmsNaval Research Logistics Quarterly, 1974
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973