An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines Under Dynamic Priority Scheduling

Schedulability is a fundamental problem in real-time scheduling, but it has to be approximated due to the intrinsic computational hardness. As the most popular algorithm for deciding schedulability on multiprocess platforms, the speedup factor of partitioned-EDF is challenging to analyze and is far from being determined. Partitioned-EDF was first proposed in 2005 by Barush and Fisher [1], and was shown to have a speedup factor at most 3-1/m, meaning that if the input of sporadic tasks is feasible on m processors with speed one, partitioned-EDF will always succeed on m processors with speed 3-1/m. In 2011, this upper bound was improved to 2.6322-1/m by Chen and Chakraborty [2], and no more improvements have appeared ever since then. In this paper, we develop a novel method to discretize and regularize sporadic tasks, which enables us to improve, in the case of constrained deadlines, the speedup factor of partitioned-EDF to 2.5556-1/m, very close to the asymptotic lower bound 2.5 in [2].

[1]  Sanjoy K. Baruah,et al.  Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[2]  Jian-Jia Chen,et al.  Resource Augmentation Bounds for Approximate Demand Bound Functions , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[3]  Raymond R. Devillers,et al.  Liu and Layland's schedulability test revisited , 2000, Inf. Process. Lett..

[4]  Robert I. Davis,et al.  Exact speedup factors and sub-optimality for non-preemptive scheduling , 2017, Real-Time Systems.

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

[6]  Giorgio C. Buttazzo,et al.  Measuring the Performance of Schedulability Tests , 2005, Real-Time Systems.

[7]  Frank Slomka,et al.  An event stream driven approximation for the analysis of real-time systems , 2004, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004..

[8]  Sanjoy K. Baruah,et al.  The EDF Scheduling of Sporadic Task Systems on Uniform Multiprocessors , 2008, 2008 Real-Time Systems Symposium.

[9]  Robert I. Davis,et al.  On the Pitfalls of Resource Augmentation Factors and Utilization Bounds in Real-Time Scheduling , 2017, ECRTS.

[10]  Sanjoy K. Baruah,et al.  Intractability Issues in Mixed-Criticality Scheduling , 2018, ECRTS.

[11]  Sanjoy K. Baruah,et al.  The partitioned multiprocessor scheduling of sporadic task systems , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[12]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[13]  Zhishan Guo.  Regarding the Optimality of Speedup Bounds of Mixed-Criticality Schedulability Tests , 2017 .

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

[15]  Friedrich Eisenbrand,et al.  EDF-schedulability of synchronous periodic task systems is coNP-hard , 2010, SODA '10.

[16]  Enrico Bini,et al.  The Quadratic Utilization Upper Bound for Arbitrary Deadline Real-Time Tasks , 2015, IEEE Transactions on Computers.