On a novel property of the earliest deadline first algorithm

Real-time scheduling theory plays a key role in many time critical control systems or applications. In this paper, an interesting property of the Earliest Deadline First (EDF) algorithm, which has never been discussed before, is examined. To be specific, we conjecture that if a task set is schedulable under EDF, then for any task pair (τi, τj) such that pi ≥ pj in this task set, there must be at least one whole execution of τj occurring between the release time and deadline of any τi's job. Although this property is not hard to describe, its proof is far more difficult than expected. To prove this property, we first show the correctness of the conjecture for task sets consisting of only two real-time tasks. In view of the hardness in extending the proof to task sets having more than 2 members, extensive simulation experiments are conducted to support our intuition for general cases. The conjecture holds under a substantial number of parameter settings we have tried.

[1]  Krithi Ramamritham,et al.  Broadcast on demand: efficient and timely dissemination of data in mobile environments , 1997, Proceedings Third IEEE Real-Time Technology and Applications Symposium.

[2]  Sanjoy K. Baruah,et al.  Pinwheel scheduling for fault-tolerant broadcast disks in real-time database systems , 1997, Proceedings 13th International Conference on Data Engineering.

[3]  Louis E. Rosier,et al.  Pinwheel Scheduling with Two Distinct Numbers , 1992, Theor. Comput. Sci..

[4]  Jianliang Xu,et al.  Time-critical on-demand data broadcast: algorithms, analysis, and performance evaluation , 2006, IEEE Transactions on Parallel and Distributed Systems.

[5]  Rafael Alonso,et al.  Broadcast Disks: Data Management for Asymmetric Communication Environments , 1994, Mobidata.

[6]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

[7]  Nitin H. Vaidya,et al.  Scheduling data broadcast to “impatient” users , 1999, MobiDe '99.

[8]  Yingyuan Xiao,et al.  Scheduling Periodic Continuous Queries in Real-Time Data Broadcast Environments , 2012, IEEE Transactions on Computers.

[9]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[10]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[11]  Victor C. S. Lee,et al.  Scheduling algorithm for multi-item requests with time constraints in mobile computing environments , 2007, 2007 International Conference on Parallel and Distributed Systems.

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

[13]  Sang Hyuk Son,et al.  Prediction-Based QoS Management for Real-Time Data Streams , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[14]  Kwok-Wa Lam,et al.  Scheduling Real-Time Requests in On-Demand Broadcast Environments , 2007, NBiS.

[15]  Alan Burns,et al.  Real Time Scheduling Theory: A Historical Perspective , 2004, Real-Time Systems.

[16]  Daniel A. Menascé,et al.  QoS Issues in Web Services , 2002, IEEE Internet Comput..