Fault-tolerant deadline-monotonic algorithm for scheduling hard-real-time tasks
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Allocating fixed-priority periodic tasks on multiprocessor systemsReal-Time Systems, 1995
- Implications of classical scheduling results for real-time systemsComputer, 1995
- Enhancing fault-tolerance in rate-monotonic schedulingReal-Time Systems, 1994
- Scheduling algorithms for fault-tolerance in hard-real-time systemsReal-Time Systems, 1994
- An extendible approach for analyzing fixed priority hard real-time tasksReal-Time Systems, 1994
- Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processorReal-Time Systems, 1990
- Decentralized decision-making for task reallocation in a hard real-time systemIEEE Transactions on Computers, 1989
- Distributed scheduling of tasks with deadlines and resource requirementsIEEE Transactions on Computers, 1989
- Finding Response Times in a Real-Time SystemThe Computer Journal, 1986
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973