Combining (/sub m//sup n/)-hard deadlines and dual priority scheduling
- 22 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Mode changes in priority preemptively scheduled systemsPublished 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
- Flexible scheduling for adaptable real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Skip-Over: algorithms and complexity for overloaded systems that allow skipsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient transient overload tests for real-time systemsPublished by Springer Nature ,1997
- A Practitioner’s Handbook for Real-Time AnalysisPublished by Springer Nature ,1993
- A real-time locking protocolIEEE Transactions on Computers, 1991
- Some Results of the Earliest Deadline Scheduling AlgorithmIEEE Transactions on Software Engineering, 1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973