Approximate Slack Stealing Algorithms for Fixed Priority Pre-emptive Systems

Recent research into the problem of jointly scheduling tasks with both hard and soft time constraints has focused on the development of optimal slack stealing algorithms. Theoretically, these optimal algorithms offer significant performance improvements over previous bandwidth preserving algorithms such as the Sporadic Server or Extended Priority Exchange algorithm. However, there are problems associated with the practical application of both static and dynamic variants of optimal slack stealing algorithms. In this report, we address these problems by providing approximate slack stealing algorithms which offer close to optimal performance with practical utility.

[1]  Lui Sha,et al.  Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm , 1988, Proceedings. Real-Time Systems Symposium.

[2]  W. Tindell.  AN EXTENDIBLE APPROACH FOR ANALYSING FIXED PRIORITY HARD REAL-TIME TASKS , 1994 .

[3]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[4]  Neil Audsley,et al.  Flexible Scheduling in Hard Real-Time Systems , 1993 .

[5]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[6]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[7]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[8]  John P. Lehoczky,et al.  An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[9]  Jay K. Strosnider,et al.  ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS. , 1987, RTSS 1987.

[10]  Alan Burns,et al.  Scheduling slack time in fixed priority pre-emptive systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[11]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[12]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.