Uniprocessor scheduling under precedence constraints for embedded systems design

In this paper, we present a novel approach to the constrained scheduling problem, while addressing a more general class of constraints that arise from the timing requirements on real-time embedded controllers. We provide general necessary and sufficient conditions for scheduling under precedence constraints and derive sufficient conditions for two well-known scheduling policies. We define mathematical problems that provide optimum priority and deadline assignments, while ensuring both precedence constraints and system's schedulability. We show how these problems can be relaxed to corresponding integer linear programming (ILP) formulations leveraging on available solvers. The results are demonstrated on a real design case.

[1]  José R. Correa,et al.  Single-Machine Scheduling with Precedence Constraints , 2005, Math. Oper. Res..

[2]  Wang Yi,et al.  Schedulability Analysis Using Two Clocks , 2003, TACAS.

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

[4]  Maurice Queyranne,et al.  Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, SIAM J. Comput..

[5]  Celso C. Ribeiro,et al.  Multiprocessor scheduling under precedence constraints: Polyhedral results , 2006, Discret. Appl. Math..

[6]  Alan Burns,et al.  Real Time Scheduling Theory: A Historical Perspective , 2004, Real-Time Systems.

[7]  Theodore P. Baker,et al.  Stack-based scheduling of realtime processes , 1991, Real-Time Systems.

[8]  Björn Lisper,et al.  Response-time Calculation and Priority Assignment with Integer Programming Methods , 2001 .

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

[10]  Giorgio C. Buttazzo,et al.  Rate Monotonic vs. EDF: Judgment Day , 2003, Real-Time Systems.

[11]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[12]  Maurice Queyranne,et al.  Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, IPCO.

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

[14]  Ruud C. M. de Rooij,et al.  The MSP.RTL real-time scheduler synthesis tool , 1996, 17th IEEE Real-Time Systems Symposium.

[15]  David Lorge Parnas,et al.  Scheduling Processes with Release Times, Deadlines, Precedence, and Exclusion Relations , 1990, IEEE Trans. Software Eng..

[16]  Wang Yi,et al.  A Generic Approach to Schedulability Analysis of Real-Time Tasks , 2004, Nord. J. Comput..

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

[18]  Jane W.-S. Liu,et al.  Scheduling tasks with AND/OR precedence constraints , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[19]  Giorgio C. Buttazzo,et al.  Schedulability analysis of periodic fixed priority systems , 2004, IEEE Transactions on Computers.