Minimizing aperiodic response times in a firm real-time environment
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 25 (1) , 22-32
- https://doi.org/10.1109/32.748916
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Accounting for interrupt handling costs in dynamic priority task systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Combining (/sub m//sup n/)-hard deadlines and dual priority schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal deadline assignment for scheduling soft aperiodic tasks in hard real-time environmentsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Robust aperiodic scheduling under dynamic priority 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
- Scheduling aperiodic tasks in dynamic priority systemsReal-Time Systems, 1996
- Aperiodic servers in a deadline scheduling environmentReal-Time Systems, 1995
- A dynamic priority assignment technique for streams with (m, k)-firm deadlinesIEEE Transactions on Computers, 1995
- Efficient aperiodic service under earliest deadline schedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1994
- Stack-based scheduling of realtime processesReal-Time Systems, 1991