Scheduling aperiodic tasks in dynamic priority systems
- 1 March 1996
- journal article
- Published by Springer Nature in Real-Time Systems
- Vol. 10 (2) , 179-210
- https://doi.org/10.1007/bf00360340
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished 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 servers in a deadline scheduling environmentReal-Time Systems, 1995
- Stack-based scheduling of realtime processesReal-Time Systems, 1991
- Dynamic priority ceilings: A concurrency control protocol for real-time systemsReal-Time Systems, 1990
- Dynamic scheduling of real-time tasks under precedence constraintsReal-Time Systems, 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