An Efficient Zero-Laxity Based Real-Time Multiprocessor Scheduling Algorithm

In this paper, we present an efficient global real- time multiprocessor scheduling algorithm based on the beneficial Zero-Laxity policy. The algorithm selects tasks for execution based on their execution requirements. Tasks with largest execution requirements are always scheduled first; however when a task reaches zero laxity it is given the highest priority and executed until completion. The simulation showed that the proposed algorithm misses few deadlines and achieves high schedulability levels compared to currently existing zero laxity based algorithms.

[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]  Phillip A. Laplante.  Real-Time Systems Design and Analysis , 1992 .

[3]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[4]  Björn Andersson,et al.  Multiprocessor Scheduling with Few Preemptions , 2006, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06).

[5]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

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

[7]  Insup Lee,et al.  Zero-laxity based real-time multiprocessor scheduling , 2011, J. Syst. Softw..

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

[9]  Binoy Ravindran,et al.  An Optimal Real-Time Scheduling Algorithm for Multiprocessors , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[10]  Phillip A. Laplante.  Real-Time Systems Design and Analysis: Laplante/Real-Time Systems Design , 2004 .

[11]  Shelby Funk,et al.  LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines , 2010, Real-Time Systems.

[12]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

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

[14]  Scott A. Brandt,et al.  DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling , 2011, Real-Time Systems.

[15]  Alan Burns,et al.  A survey of hard real-time scheduling for multiprocessor systems , 2011, CSUR.

[16]  Sanjoy K. Baruah,et al.  A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms , 2004, Handbook of Scheduling.