Abstract
We give a rigorous account on the complexity landscape of an important real-time scheduling problem that occurs in the design of software-based aircraft control. The goal is to distribute tasks τ 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 τ i releases a job of running time c i at each time \(a_i + k\cdot p_i, \, k \in {\mathbb N}_0\) and a collision occurs if two jobs are simultaneously active on the same machine. Our main results are as follows: (i) We show that the minimization problem cannot be approximated within a factor of n 1 − ε for any ε> 0. (ii) If the periods are harmonic (for each i,j one has p i |p j or p j |p i ), then there exists a 2-approximation for the minimization problem and this result is tight, even asymptotically. (iii) We provide asymptotic approximation schemes in the harmonic case if the number of different periods is constant.
This work was partially supported by Berlin Mathematical School, by DFG research center Matheon, by the DFG Focus Program 1307 within the project “Algorithm Engineering for Real-time Scheduling and Routing”, and by the Swiss National Science Foundation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bar-Noy, A., Bhatia, R., Naor, J., Schieber, B.: Minimizing service and operation costs of periodic scheduling. Math. Oper. Res. 27(3) (2002)
Bhatia, R.: Approximation Algorithms for Scheduling Problems. PhD thesis, University of Maryland (1998)
Baruah, S.K., Howell, R.R., Rosier, L.E.: Feasibility problems for recurring tasks on one processor. In: Selected papers of the 15th International Symposium on Mathematical Foundations of Computer Science, pp. 3–20. Elsevier, Amsterdam (1993)
Baruah, S., Rousier, L., Tulchinsky, I., Varvel, D.: The complexity of periodic maintenance. In: Proceedings of the International Computer Symposium (1990)
Buttazzo, G.C.: Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications. Springer, Heidelberg (2004)
Conforti, M., Di Summa, M., Wolsey, L.A.: The mixing set with divisible capacities. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 435–449. Springer, Heidelberg (2008)
Eisenbrand, F., Hähnle, N., Niemeier, M., Skutella, M., Verschae, J., Wiese, A.: Scheduling periodic tasks in a hard real-time environment. Technical report, EPF Lausanne & TU Berlin (February 2010), http://disopt.epfl.ch/webdav/site/disopt/shared/PM_EHNSVW10_report.pdf
de la Fernandez Vega, W., Lueker, G.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1, 349–355 (1981)
Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann, New York (1979)
Korst, J., Aarts, E., Lenstra, J.K.: Scheduling periodic tasks. INFORMS Journal on Computing 8, 428–435 (1996)
Korst, J., Aarts, E., Lenstra, J.K., Wessels, J.: Periodic multiprocessor scheduling. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds.) PARLE 1991. LNCS, vol. 505, pp. 166–178. Springer, Heidelberg (1991)
Karmakar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional binpacking problem. In: Foundations of Computer Science (FOCS), vol. 23, pp. 312–320 (1982)
Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman & Hall/CRC (2004)
Marcotte, O.: The cutting stock problem and integer rounding. Mathematical Programming 33, 82–92 (1985)
Niven, I., Zuckerman, H.S., Montgomery, H.L.: An Introduction to the Theory of Numbers, 5th edn. Wiley, Chichester (1991)
Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics 41, 579–585 (1994)
Verhaegh, W.F.J., Aarts, E.H.L.: A polynomial-time algorithm for knapsack with divisible item sizes. Information Processing Letters 62, 217–221 (1997)
Wei, W.D., Liu, C.L.: On a periodic maintenance problem. Operations Research Letters 2, 90–93 (1983)
Zhao, M., de Farias Jr., I.R.: The mixing-MIR set with divisible capacities. Mathematical Programming 115, 73–103 (2008)
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing 3, 103–128 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eisenbrand, F., Hähnle, N., Niemeier, M., Skutella, M., Verschae, J., Wiese, A. (2010). Scheduling Periodic Tasks in a Hard Real-Time Environment . In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds) Automata, Languages and Programming. ICALP 2010. Lecture Notes in Computer Science, vol 6198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14165-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-14165-2_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14164-5
Online ISBN: 978-3-642-14165-2
eBook Packages: Computer ScienceComputer Science (R0)