Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks

Partitioned multiprocessor scheduling has been widely accepted in academia and industry to statically assign and partition real-time tasks onto identical multiprocessor systems. This paper studies fixed-priority partitioned multiprocessor scheduling for sporadic real-time systems, in which deadline-monotonic scheduling is applied on each processor. Prior to this paper, the best known results are by Fisher, Baruah, and Baker with speedup factors 4-2/M and 3-1/M for arbitrary-deadline and constrained-deadline sporadic real-time task systems, respectively, where M is the number of processors. We show that a greedy mapping strategy has a speedup factor 3-1/M when considering task systems with arbitrary deadlines. Such a factor holds for polynomial-time schedulability tests and exponential-time (exact) schedulability tests. Moreover, we also improve the speedup factor to 2.84306 when considering constrained-deadline task systems. We also provide tight examples when the fitting strategy in the mapping stage is arbitrary and M is sufficiently large. For both constrained-and arbitrary-deadline task systems, the analytical result surprisingly shows that using exact tests does not gain theoretical benefits (with respect to speedup factors) if the speedup factor analysis is oblivious of the particular fitting strategy used.

[1]  Sanjoy K. Baruah,et al.  The partitioned multiprocessor scheduling of deadline-constrained sporadic task systems , 2006, IEEE Transactions on Computers.

[2]  Sanjoy K. Baruah,et al.  The partitioned scheduling of sporadic tasks according to static-priorities , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).

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

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

[5]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[6]  Jian-Jia Chen,et al.  Partitioned Packing and Scheduling for Sporadic Real-Time Tasks in Identical Multiprocessor Systems , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[7]  Giorgio C. Buttazzo,et al.  Rate Monotonic Analysis: The Hyperbolic Bound , 2003, IEEE Trans. Computers.

[8]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[9]  Sanjoy K. Baruah,et al.  A Response-Time Bound in Fixed-Priority Scheduling with Arbitrary Deadlines , 2009, IEEE Transactions on Computers.

[10]  Sanjoy K. Baruah,et al.  The Partitioned EDF Scheduling of Sporadic Task Systems , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[11]  Jian-Jia Chen,et al.  Schedulability and optimization analysis for non-preemptive static priority scheduling based on task utilization and blocking factors , 2015, 2015 27th Euromicro Conference on Real-Time Systems.

[12]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[13]  Friedrich Eisenbrand,et al.  Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard , 2008, 2008 Real-Time Systems Symposium.

[14]  Robert I. Davis,et al.  Quantifying the Sub-optimality of Uniprocessor Fixed Priority Pre-emptive Scheduling for Sporadic Tasksets with Arbitrary Deadlines , 2009 .

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

[16]  Nathan Wayne Fisher,et al.  How Hard is Partitioning for the Sporadic Task Model? , 2009, 2009 International Conference on Parallel Processing Workshops.

[17]  Jian-Jia Chen,et al.  k2U: A General Framework from k-Point Effective Schedulability Analysis to Utilization-Based Tests , 2015, 2015 IEEE Real-Time Systems Symposium.

[18]  Lothar Thiele,et al.  Approximate schedulability analysis , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[19]  Thomas Rothvoß,et al.  A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks , 2010, WAOA.

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

[21]  Alan Burns,et al.  Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling , 2009, Real-Time Systems.

[22]  Sang Hyuk Son,et al.  New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems , 1995, IEEE Trans. Computers.

[23]  Jian-Jia Chen,et al.  Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks , 2013, Real-Time Systems.

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

[25]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[26]  Sanjoy K. Baruah,et al.  A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[27]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[28]  Enhanced utilization bounds for QoS management , 2004, IEEE Transactions on Computers.

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

[30]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

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

[32]  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..