Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems
- 1 January 1996
- journal article
- Published by Springer Nature in Real-Time Systems
- Vol. 10 (1), 23-43
- https://doi.org/10.1007/bf00357882
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On-line scheduling of hard deadline aperiodic tasks in fixed-priority systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Scheduling slack time in fixed priority pre-emptive systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Aperiodic task scheduling for Hard-Real-Time systemsReal-Time Systems, 1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973