LRE-TL: an optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines

This article presents a detailed discussion of LRE-TL (Local Remaining Execution-TL-plane), an algorithm that schedules hard real-time periodic and sporadic task sets with unconstrained deadlines on identical multiprocessors. The algorithm builds upon important concepts such as the TL-plane construct used in the development of the LLREF algorithm (Largest Local Remaining Execution First). This article identifies the fundamental TL-plane scheduling principles used in the construction of LLREF . These simple principles are examined, identifying methods of simplifying the algorithm and allowing it to handle a more general task model. For example, we identify the principle that total local utilization can never increase within any TL-plane as long as a minimal number of tasks are executing. This observation leads to a straightforward approach for scheduling task arrivals within a TL-plane. In this manner LRE-TL can schedule sporadic tasks and tasks with unconstrained deadlines. Like LLREF, the LRE-TL scheduling algorithm is optimal for task sets with implicit deadlines. In addition, LRE-TL can schedule task sets with unconstrained deadlines provided they satisfy the density test for multiprocessor systems. While LLREF has a O(n2) runtime per TL-plane, LRE-TL’s runtime is O(nlog n) per TL-plane.

[1]  Shinpei Kato,et al.  Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors , 2009, 2009 21st Euromicro Conference on Real-Time Systems.

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

[3]  Shelby Funk,et al.  LRE-TL: An Optimal Multiprocessor Scheduling Algorithm for Sporadic Task Sets , 2009 .

[4]  Theodore P. Baker,et al.  Multiprocessor EDF and deadline monotonic schedulability analysis , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

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

[6]  Theodore P. Baker,et al.  EDZL scheduling analysis , 2007, 19th Euromicro Conference on Real-Time Systems (ECRTS'07).

[7]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[8]  Sanjoy K. Baruah,et al.  Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible , 2010, Real-Time Systems.

[9]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.

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

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

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

[13]  Joseph Y.-T. Leung,et al.  On-line scheduling of real-time tasks , 1988, Proceedings. Real-Time Systems Symposium.

[14]  James H. Anderson,et al.  Fair scheduling of dynamic task systems on multiprocessors , 2005, J. Syst. Softw..

[15]  James H. Anderson,et al.  A schedulable utilization bound for the multiprocessor EPDF Pfair algorithm , 2008 .

[16]  Shih-Ying Chen,et al.  Optimal Dynamic-Priority Real-Time Scheduling Algorithms for Uniform Multiprocessors , 2008, 2008 Real-Time Systems Symposium.

[17]  Theodore P. Baker,et al.  An analysis of EDF schedulability on a multiprocessor , 2005, IEEE Transactions on Parallel and Distributed Systems.