An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 110-123
- https://doi.org/10.1109/real.1992.242671
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Evaluation of the probability of dynamic failure and processor utilization for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The transient server approach to scheduling time-critical recovery operationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Tolerating transient faults in MARSPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Resource reclaiming in real timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- Some Results of the Earliest Deadline Scheduling AlgorithmIEEE Transactions on Software Engineering, 1989
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOperations Research, 1968