Periodic multiprocessor scheduling

  • Jan Korst
  • Emile Aarts
  • Jan Karel Lenstra
  • Jaap Wessels
Submitted Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 505)


A number of scheduling and assignment problems are presented involving the execution of periodic operations in a multiprocessor environment. We consider the computational complexity of these problems and propose approximation algorithms for operations with identical periods as well as for operations with arbitrary integer periods.


periodic scheduling periodic assignment cyclic scheduling nonpreemptive scheduling 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bartholdi, J.J. [1981], A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering, Operations Research 29, 501–510.Google Scholar
  2. Bartholdi, J.J., J.B. Orlin, and H.D. Ratliff [1980], Cyclic scheduling via integer programs with circular ones, Operations Research 28, 1074–1085.PubMedGoogle Scholar
  3. Bertossi, A.A. and M.A. Bonuccelli [1983], Preemptive scheduling of periodic jobs in uniform multiprocessor systems, Information Processing Letters 16, 3–6.CrossRefGoogle Scholar
  4. Bertossi, A.A. and M.A. Bonuccelli [1985], A polynomial feasibility test for preemptive periodic scheduling of unrelated processors, Discrete Applied Mathematics 12, 195–201.CrossRefGoogle Scholar
  5. Burkard, R.E. [1986], Optimal schedules for periodically recurring events, Discrete Applied Mathematics 15, 167–180.CrossRefGoogle Scholar
  6. Chetto, H. and M. Chetto [1989], Scheduling periodic and sporadic tasks in a real-time system, Information Processing Letters 30, 177–184.CrossRefGoogle Scholar
  7. Coffmann, E.G., Jr., M.R. Garey, and D.S. Johnson [1984], Approximation algorithms for bin packing — an updated survey, in: G. Ausiello, M. Lucertini, and P. Serafini (Eds.), Algorithms Design and Computer System Design, CISM Courses and Lectures 284, Springer, Vienna, 49–106.Google Scholar
  8. Dhall, S.K. and C.L. Liu [1978], On a real-time scheduling problem, Operations Research 26, 127–140.Google Scholar
  9. Edmonds, J. [1965], Paths, trees and flowers, Canadian Journal of Mathematics 17, 449–467.Google Scholar
  10. Garey, M.R. and D.S. Johnson [1979], Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco.Google Scholar
  11. Garey, M.R., D.S. Johnson, G.L. Miller, and C.H. Papadimitriou [1980], The complexity of coloring circular arcs and chords, SIAM Journal on Algebraic and Discrete Methods 1, 216–227.Google Scholar
  12. Gonzalez, M.J. and J.W. Soh [1975], Periodic job scheduling in a distributed processor system, IEEE Transactions on Aerospace and Electronic Systems 12, 530–536.Google Scholar
  13. Gupta, U.I., D.T. Lee, and J.Y.-T. Leung [1979], An optimal solution for the channel-assignment problem, IEEE Transaction on Computers 28, 807–810.Google Scholar
  14. Hashimoto, A. and J. Stevens [1971], Wire routing by optimizing channel assignment with large apertures, Proceedings of the 8th Design Automation Conference, 155–169.Google Scholar
  15. Hopcroft, J.E. and R.M. Karp [1973], An n 5/2 algorithm for maximum matchings in bipartite graphs, SIAM Journal on Computing 2, 225–231.CrossRefGoogle Scholar
  16. Korst, J.H.M., E.H.L. Aarts, J.K. Lenstra, and J. Wessels [1991], Periodic Assignment and Graph Colouring, Philips Research Manuscript.Google Scholar
  17. Labetoulle, J. [1974], Some theorems on real time scheduling, in: E. Gelenbe and R. Mahl (Eds.), Computer Architecture and Networks, North-Holland, Amsterdam, 285–293.Google Scholar
  18. Lawler, E.L. and C.U. Martel [1981], Scheduling periodically occurring tasks on multiple processors, Information Processing Letters 12, 9–12.CrossRefGoogle Scholar
  19. Leung, J.Y.-T. and M.L. Merrill [1980], A note on preemptive scheduling of periodic, real-time tasks, Information Processing Letters 11, 115–118.CrossRefGoogle Scholar
  20. Leung, J.Y.-T. and J. Whitehead [1982], On the complexity of fixed-priority scheduling of periodic, real-time tasks, Performance Evaluation 2, 237–250.CrossRefGoogle Scholar
  21. Liu, C.L. and J.W. Layland [1973], Scheduling algorithms for multiprogramming in a hard real-time environment, Journal of the Association for Computing Machinery 20, 46–61.Google Scholar
  22. Orlin, J.B. [1982], Minimizing the number of vehicles to meet a fixed periodic schedule: an application of periodic posets, Operations Research 30, 760–776.Google Scholar
  23. Orlin, J.B., M.A. Bonuccelli, and D.P. Bovet [1981], An O(n 2) algorithm for coloring proper circular arc graphs, SIAM Journal on Algebraic and Discrete Methods 2, 88–93.Google Scholar
  24. Park, K.S. and D.K. Yun [1985], Optimal scheduling of periodic activities, Operations Research 33, 690–695.Google Scholar
  25. Serafini, P. and W. Ukovich [1989], A mathematical model for periodic scheduling problems, SIAM Journal on Discrete Mathematics 2, 550–581.CrossRefGoogle Scholar
  26. Shih, W.-K. and W.-L. Hsu [1989], An O(n 1.5) algorithm to color proper circular arcs, Discrete Applied Mathematics 25, 321–323.CrossRefGoogle Scholar
  27. Tucker, A. [1975], Coloring a family of circular arcs, SIAM Journal on Applied Mathematics 29, 493–552.CrossRefGoogle Scholar
  28. Vince, J. [1989], Scheduling periodic events, Discrete Applied Mathematics 25, 299–310.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Jan Korst
    • 1
  • Emile Aarts
    • 1
    • 2
  • Jan Karel Lenstra
    • 2
    • 3
  • Jaap Wessels
    • 2
  1. 1.Philips Research LaboratoriesEindhoventhe Netherlands
  2. 2.Eindhoven University of TechnologyEindhoventhe Netherlands
  3. 3.CWIAmsterdamthe Netherlands

Personalised recommendations