Scheduling Periodic Tasks in a Hard Real-Time Environment

We consider a real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks $ au_i=(c_i,p_i)$ on a minimum number of identical machines and to compute offsets $a_i$ for the tasks such that no collision occurs. A task $ au_i$ releases a job of running time $c_i$ at each time $a_i + kcdot p_i, , k in mathbb{N}_0$ and a collision occurs if two jobs are simultaneously active on the same machine. We shed some light on the complexity and approximability landscape of this problem. Although the problem cannot be approximated within a factor of $n^{1-varepsilon}$ for any $varepsilon>0$, an interesting restriction is much more tractable: If the periods are dividing (for each $i,j$ one has $p_i | p_j$ or $p_j | p_i$), the problem allows for a better structured representation of solutions, which leads to a 2-approximation. This result is tight, even asymptotically.

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

[2]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[3]  Giorgio C. Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications (Real-Time Systems Series) , 2010 .

[4]  C. L. Liu,et al.  On a Periodic Maintenance Problem , 1983, Oper. Res. Lett..

[5]  Yingfeng Oh,et al.  The design and analysis of scheduling algorithms for real-time and fault-tolerant computer systems , 1994 .

[6]  P. Shiu An introduction to the theory of numbers (5th edition) , by I. Niven, H. S. Zuckerman and H. L. Montgomery. Pp 529. £14·50. 1991. ISBN 0-471-5460031 (Wiley) , 1991 .

[7]  Jan Karel Lenstra,et al.  Periodic Multiprocessor Scheduling , 1991, PARLE.

[8]  Jan Karel Lenstra,et al.  Scheduling Periodic Tasks , 1996, INFORMS J. Comput..

[9]  E. T. An Introduction to the Theory of Numbers , 1946, Nature.

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

[11]  Sudarshan K. Dhall,et al.  An On Line Algorithm for Real-Time Tasks Allocation , 1986, IEEE Real-Time Systems Symposium.

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

[13]  Sang Hyuk Son,et al.  Allocating fixed-priority periodic tasks on multiprocessor systems , 1995, Real-Time Systems.

[14]  Omri Serlin,et al.  Scheduling of time critical processes , 1899, AFIPS '72 (Spring).

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

[16]  Laurence A. Wolsey,et al.  The Mixing Set with Divisible Capacities , 2008, IPCO.

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[19]  D. Simchi-Levi New worst‐case results for the bin‐packing problem , 1994 .

[20]  Sanjoy K. Baruah,et al.  Feasibility Problems for Recurring Tasks on one Processor , 1993, Theor. Comput. Sci..

[21]  Hiroaki Ishii,et al.  Approximation algorithms for scheduling problems , 2000 .

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

[23]  Joseph Y.-T. Leung,et al.  Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[24]  Emile H. L. Aarts,et al.  A Polynomial-Time Algorithm for Knapsack with Divisible Item Sizes , 1997, Inf. Process. Lett..

[25]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[26]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[27]  Ronald V. Book,et al.  Review: Michael R. Garey and David S. Johnson, Computers and intractability: A guide to the theory of $NP$-completeness , 1980 .

[28]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[29]  Sang Hyuk Son,et al.  Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems , 1994 .

[30]  Odile Marcotte The cutting stock problem and integer rounding , 1985, Math. Program..

[31]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[32]  Godfrey H. Hardy,et al.  An introduction to the theory of numbers (5. ed.) , 1995 .

[33]  Randeep Bhatia,et al.  Minimizing service and operation costs of periodic scheduling , 2002, SODA '98.

[34]  Ming Zhao,et al.  The mixing-MIR set with divisible capacities , 2008, Math. Program..

[35]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .