Scheduling algorithms for fault-tolerance in hard-real-time systems
- 1 November 1994
- journal article
- Published by Springer Nature in Real-Time Systems
- Vol. 7 (3) , 229-245
- https://doi.org/10.1007/bf01088520
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Workload redistribution for fault-tolerance in a hard real-time distributed computing systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Scheduling Strategies Adopted in Spring: An OverviewPublished by Springer Nature ,1991
- Fail-stop processorsACM Transactions on Computer Systems, 1983
- Preemptive scheduling of periodic jobs in uniform multiprocessor systemsInformation Processing Letters, 1983
- 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
- On a Real-Time Scheduling ProblemOperations Research, 1978
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Scheduling with Deadlines and Loss FunctionsManagement Science, 1959