The feasibility of general task systems with precedence constraints on multiprocessor platforms

Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-real-time jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. The collection of jobs may contain precedence constraints upon the order of execution of these jobs. The derived tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.

[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]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) , 1997, Symposium on the Theory of Computing.

[3]  Sanjoy K. Baruah,et al.  Generalized Multiframe Tasks , 1999, Real-Time Systems.

[4]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..

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

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

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

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

[9]  Marco Spuri,et al.  How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling , 1994, IEEE Trans. Computers.

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

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

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

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

[14]  R. A. Silverman,et al.  Introductory Real Analysis , 1972 .

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

[16]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[17]  Aloysius K. Mok,et al.  A Multiframe Model for Real-Time Tasks , 1997, IEEE Trans. Software Eng..