Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 251-258
- https://doi.org/10.1109/real.1988.51120
Abstract
Real-time scheduling algorithms that provide responsive aperiodic service in the presence of hard real-time periodic tasks require the creation of a high-priority periodic server task for servicing aperiodic requests. The authors describe the extended priority exchange algorithm, which can provide better aperiodic response than previous aperiodic service algorithms, particularly for cases where the worst-case periodic load is high and little or no utilization is left for a server task. The extended-priority-exchange (EPE) algorithm attains better aperiodic responsiveness by exploiting unused time allocated to periodic tasks for aperiodic service. The average aperiodic response times for the EPE algorithm and four other aperiodic service algorithms (background, polling, deferrable server, and priority exchange) are compared for a range of periodic and aperiodic loads. Simulation results show that for a difference between the average and worst-case periodic load of only 12.5%, the EPE algorithm provides significantly better response times for aperiodic tasks.Keywords
This publication has 3 references indexed in Scilit:
- Priority-driven, preemptive I/O controllers for real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Instruction Level Timing Mechanisms for Accurate Real-Time Task SchedulingIEEE Transactions on Computers, 1987
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973