An optimal algorithm for scheduling soft aperiodic tasks in dynamic-priority preemptive systems
- 1 June 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 23 (6) , 388-400
- https://doi.org/10.1109/32.601081
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- 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
- Improvement in feasibility testing for real-time tasksReal-Time Systems, 1996
- Dynamic priority scheduling of periodic and aperiodic tasks in hard real-time systemsReal-Time Systems, 1994
- Dynamic scheduling of hard real-time tasks and real-time threadsIEEE Transactions on Software Engineering, 1992
- Dynamic adaptation of real-time softwareACM Transactions on Computer Systems, 1991
- Some Results of the Earliest Deadline Scheduling AlgorithmIEEE Transactions on Software Engineering, 1989
- A note on preemptive scheduling of periodic, real-time tasksInformation Processing Letters, 1980
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973