Scheduling of hard real-time systems

  • Abha Moitra
Session 6 Scheduling
Part of the Lecture Notes in Computer Science book series (LNCS, volume 241)


In this paper we study hard real-time systems: systems where strict time deadlines have to be met. We analyze a special case as well as a general model for hard real-time systems and study pre-emptive, static, scheduling policies for a single processor. The analysis is exact and can handle any arbitrary choice of strict deadlines thereby allowing us to prove the correctness of critical systems. For both the special and general model we present a feasible scheduling algorithm; that is a scheduling algorithm that always produces a priority assignment where all deadlines are met if such a priority assignment exists.

Index Terms

Deadline pre-emptive rate-monotonic real-time systems scheduling policy 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.Google Scholar
  2. [2]
    Bertossi, A.A., and Bonuccelli, M.A. Preemptive scheduling of periodic jobs in uniform multiprocessor systems. Inf. Proc. Lett. 16, 3–6, 1983.Google Scholar
  3. [3]
    Dhall, S.K., and Liu, C.L. On a real time scheduling problem. Oper. Res 2, 6, 127–140, 1978.Google Scholar
  4. [4]
    Frederickson, G.N. Scheduling unit-time tasks with integer release times and deadlines. Inf. Proc. Lett. 16, 171–173, 1983.Google Scholar
  5. [5]
    Gabow, H.N., and Tarjan, R.E. A linear-time algorithm for a special case of disjoint set union. Proc. of the 1983 Symp. on Theory of Computing, 1983, 246–251.Google Scholar
  6. [6]
    Garey, M.R., Johnson, D.S., Simons, B.B., and Tarjan, R.E. Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J. Comput. 10, 256–269, 1981.Google Scholar
  7. [7]
    Gonzalez, T. and Sahni, S. Preemptive scheduling of uniform processor systems. J. ACM 25, 92–101, 1978.Google Scholar
  8. [8]
    Gonzalez, M.J., and Soh, J.W. Periodic job scheduling in a distributed processor system. IEEE Trans. Aerospace Electron. Syst. 12, 530–535, 1976.Google Scholar
  9. [9]
    Joseph, M. On a problem in real-time computing. Inf. Proc. Lett. 20, 173–177, 1985.Google Scholar
  10. [10]
    Joseph, M., and Pandya, P. Finding response time in a real-time system. to appear in Comp. J., 1986.Google Scholar
  11. [11]
    Kleinrock, L. Queueing Systems, Vol. II: Computer Applications. Wiley Interscience, New York, 1976.Google Scholar
  12. [12]
    Lawler, E.L., and Martel, C.U. Scheduling periodically occurring tasks on multiple processors. Inf. Proc. Lett. 12, 9–12, 1981.Google Scholar
  13. [13]
    Liu, C.L., and Layland, J.W. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM. 20, 46–61, 1973.Google Scholar
  14. [14]
    Liu, C.L., Liu, J.W.S., and Liestman, L. Scheduling with slack time. Acta Inf. 17, 31–41, 1982.Google Scholar
  15. [15]
    Mok, A.K. The design of real-time programming systems based on process models. Proc. of the IEEE Real-Time Systems Symposium, Austin, Texas, Dec. 1984, pp. 5–17.Google Scholar
  16. [16]
    Simons, B. A fast algorithm for multiprocessor scheduling. Proc. 21st Symp. on Foundations of Computer Science, Syracuse, NY, 1980, pp. 50–53.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Abha Moitra
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthaca

Personalised recommendations