Schedulability issues for EDZL scheduling on real-time multiprocessor systems

EDZL (Earliest Deadline first until Zero Laxity) is an efficient and practical scheduling algorithm on multiprocessor systems. It has a comparable number of context switch to EDF (Earliest Deadline First) and its schedulable utilization seems to be higher than that of EDF. Previously, there was a conjecture that the utilization bound of EDZL is 3m/4=0.75m for m processors. In this paper, we disprove this conjecture and show that the utilization bound of EDZL is no greater than m(1-1/e)~0.6321m, where e~2.718 is the Euler's number.

[1]  Suk Kyoon Lee.  On-line multiprocessor scheduling algorithms for real-time tasks , 1994, Proceedings of TENCON'94 - 1994 IEEE Region 10's 9th Annual International Conference on: 'Frontiers of Computer Technology'.

[2]  Aloysius K. Mok,et al.  Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks , 1989, IEEE Trans. Software Eng..

[3]  Sanjoy K. Baruah,et al.  Deadline-based scheduling of periodic task systems on multiprocessors , 2002, Inf. Process. Lett..

[4]  Kwei-Jay Lin,et al.  Designing multimedia applications on real-time systems with SMP architecture , 2002, Fourth International Symposium on Multimedia Software Engineering, 2002. Proceedings..

[5]  Tei-Wei Kuo,et al.  Utilization bound revisited , 2003 .

[6]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[7]  Yookun Cho,et al.  Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor , 2005, IEICE Trans. Inf. Syst..