Non-migratory feasibility and migratory schedulability analysis of multiprocessor real-time systems

Abstract The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where job migration between processors is forbidden. The fixed-priority scheduling of real-time jobs with job migration is analyzed, and sufficient tests of schedulability are obtained for the deadline-monotonic (dm) and the earliest-deadline-first (edf) scheduling algorithms. The feasibility and schedulability tests of this paper may be applied even when the collection of jobs is incompletely specified. The applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks is discussed. In particular, sufficient conditions for the dm scheduling of sporadic task systems are derived and compared to previously-known tests.

[1]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[2]  Aloysius K. Mok,et al.  A multiframe model for real-time tasks , 1996, 17th IEEE Real-Time Systems Symposium.

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

[4]  Samarjit Chakraborty,et al.  System-level timing analysis and scheduling for embedded packet processors , 2003 .

[5]  Chenyang Lu,et al.  A utilization bound for aperiodic tasks and priority driven scheduling , 2004, IEEE Transactions on Computers.

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

[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.  Generalized Multiframe Tasks , 1999, Real-Time Systems.

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

[10]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

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

[12]  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).

[13]  Lothar Thiele,et al.  On the complexity of scheduling conditional real-time code , 2001 .

[14]  Giuseppe Lipari,et al.  New Schedulability Tests for Real-Time Task Sets Scheduled by Deadline Monotonic on Multiprocessors , 2005, OPODIS.

[15]  Theodore P. Baker An Analysis of Deadline-Monotonic Schedulability on a Multiprocessor , 2003 .

[16]  Aloysius K. Mok,et al.  Improvement in feasibility testing for real-time tasks , 1996, Real-Time Systems.

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

[18]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[19]  Sanjoy K. Baruah,et al.  A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines , 2006, J. Embed. Comput..

[20]  Sanjoy K. Baruah,et al.  The partitioned scheduling of sporadic real-time tasks on multiprocessor platforms , 2005, 2005 International Conference on Parallel Processing Workshops (ICPPW'05).

[21]  Sanjoy K. Baruah,et al.  Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks , 2004, Real-Time Systems.

[22]  Theodore P. Baker,et al.  An Analysis of Fixed-Priority Schedulability on a Multiprocessor , 2006, Real-Time Systems.

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

[24]  Sanjoy K. Baruah,et al.  Algorithms for Determining the Demand-Based Load of a Sporadic Task System , 2006, 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06).