EDZL scheduling analysis

A schedulability test is derived for the global Earliest Deadline Zero Laxity (EDZL) scheduling algorithm on a platform with multiple identical processors. The test is sufficient, but not necessary, to guarantee that a system of independent sporadic tasks with arbitrary deadlines will be successfully scheduled, with no missed deadlines, by the multiprocessor EDZL algorithm. Global EDZL is known to be at least as effective as global Earliest-Deadline-First (EDF) in scheduling task sets to meet deadlines. It is shown, by testing on large numbers of pseudo-randomly generated task sets, that the combination of EDZL and the new schedulability test is able to guarantee that far more task sets meet deadlines than the combination of EDF and known EDF schedulability tests.In the second part of the paper, an improved version of the EDZL-schedulability test is presented. This new algorithm is able to efficiently exploit information on the slack values of interfering tasks, to iteratively refine the estimation of the interference a task can be subjected to. This iterative algorithm is shown to have better performance than the initial test, in terms of schedulable task sets detected.

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

[2]  Theodore P. Baker,et al.  A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[3]  Sanjoy K. Baruah,et al.  Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors , 2003, Real-Time Systems.

[4]  Jane W.-S. Liu,et al.  Validating timing constraints in multiprocessor and distributed real-time systems , 1994, 14th International Conference on Distributed Computing Systems.

[5]  ParkMinkyu,et al.  Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor*This work is supported in part by Brain Korea 21 project and in part by ICT. , 2005 .

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

[7]  Kirk Pruhs,et al.  Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks , 2008 .

[8]  Lui Sha,et al.  Aperiodic task scheduling for Hard-Real-Time systems , 2006, Real-Time Systems.

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

[10]  19th Euromicro Conference on Real-Time Systems, ECRTS'07, 4-6 July 2007, Pisa, Italy, Proceedings , 2007, ECRTS.

[11]  Rhan Ha,et al.  Validating timing constraints in multiprocessor and distributed systems , 1995 .

[12]  Kwei-Jay Lin,et al.  Efficient Real-Time Scheduling Algorithms for Multiprocessor Systems , 2002 .

[13]  Theodore P. Baker,et al.  A Comparison of Global and Partitioned EDF Schedulability Tests for Multiprocessors TR-051101 , 2005 .

[14]  Theodore P. Baker,et al.  Brute-Force Determination of Multiprocessor Schedulability for Sets of Sporadic Hard-Deadline Tasks , 2007, OPODIS.

[15]  Theodore P. Baker,et al.  EDZL Scheduling Analysis , 2007, ECRTS.

[16]  Giuseppe Lipari,et al.  Improved schedulability analysis of EDF on multiprocessor platforms , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[17]  Yookun Cho,et al.  Predictability of earliest deadline zero laxity algorithm for multiprocessor real-time systems , 2006, Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'06).

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

[19]  Alan Burns,et al.  Sustainable Scheduling Analysis , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[20]  Sanjoy K. Baruah,et al.  Proportionate progress: A notion of fairness in resource allocation , 1993, Algorithmica.

[21]  Michele Cirinei,et al.  Exploiting the Power of Multiprocessors for Real-Time Systems , 2007 .