An Efficient Non-Preemptive Real-Time Scheduling

Traditional real-time systems are designed using preemptive scheduling and worst-case execution time estimates to guarantee the execution of high priority tasks. There is, however, an interest in exploring non-preemptive scheduling models for real-time systems, particularly for soft real-time multimedia applications. In this paper we propose a new algorithm that uses multiple scheduling strategies. Our goal in this research is to improve the success rate of the well-known Earliest Deadline First (EDF) approach even when the load on the system is very high. Our approach, known as group-EDF (gEDF) is based on (dynamic) grouping of tasks with deadlines that are very close to each other, and using Shortest Job First (SJF) technique to schedule tasks within the group. We will present results comparing gEDF and EDF using randomly generated tasks with varying execution times, release times, deadlines and tolerance to missing deadlines, under varying workloads. We believe that the grouping of tasks with similar deadlines and utilizing information other than deadlines (such as execution times, priorities or resource availability) for scheduling tasks within a group can lead to new and more efficient real-time scheduling algorithms.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Luciano Lavagno,et al.  Scheduling for Embedded Real-Time Systems , 1998, IEEE Des. Test Comput..

[3]  A. L. Narasimha Reddy,et al.  Disk scheduling in a multimedia I/O system , 1993, MULTIMEDIA '93.

[4]  C. D. Locke,et al.  Best-effort decision-making for real-time scheduling , 1986 .

[5]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[6]  Charles U. Martel,et al.  On non-preemptive scheduling of period and sporadic tasks , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[7]  Shlomo Zilberstein,et al.  Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..

[8]  Paul Muhlethaler,et al.  A Few Results on Non-Preemptive Real Time Scheduling , 1999 .

[9]  Reinhard Wilhelm,et al.  The influence of processor architecture on the design and the results of WCET tools , 2003, Proceedings of the IEEE.

[10]  Marco Spuri,et al.  Value vs. deadline scheduling in overload conditions , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[11]  Sanjoy K. Baruah,et al.  Scheduling for Overload in Real-Time Systems , 1997, IEEE Trans. Computers.

[12]  Donald F. Towsley,et al.  Efficient on-line processor scheduling for a class of IRIS (increasing reward with increasing service) real-time tasks , 1993, SIGMETRICS '93.

[13]  Guillem Bernat,et al.  WCET analysis of probabilistic hard real-time systems , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[14]  John P. Lehoczky,et al.  Quantized EDF scheduling in a stochastic environment , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[15]  Krishna M. Kavi,et al.  Scheduled Dataflow: Execution Paradigm, Architecture, and Performance Evaluation , 2001, IEEE Trans. Computers.

[16]  Rohit Jain,et al.  Soft real-time scheduling on simultaneous multithreaded processors , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[17]  Gabriele Turi,et al.  Scuola Normale Superiore , 2003 .

[18]  S. Shreve,et al.  Real-time queues in heavy traffic with earliest-deadline-first queue discipline , 2001 .