Fundamentals of Real-Time Scheduling (Extended Abstract)

  • C. L. Liu
Conference paper
Part of the NATO ASI Series book series (NATO ASI F, volume 127)


For a given set of jobs the general scheduling problem asks for an order according to which the jobs are to be executed such that various constraints are satisfied. Typically, a job is characterized by its execution time, ready time, deadline, and recourse requirements. The execution of a job might or might not be interrupted (pre-emptive) or (non-preemptive scheduling). Over the set of jobs, there is a precedence relation which constrains the order of execution. Specifically, the execution of a job cannot begin until the execution of all its predecessors (according to the precedence relation) is completed. The system on which the jobs are to be executed is characterized by the amounts of resources available.


Execution Time Schedule Problem Schedule Algorithm Ready Time Precedence Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Hu, T. C., Parallel scheduling and assembly line problems, Oper. Res., Vol. 9, 1961, 841–848.CrossRefGoogle Scholar
  2. 2.
    Coffman, E. G., Jr. and R. L. Graham, Optimal scheduling for two processor systems, Acta Informatica, Vol. 1, 1972, 200–213.MathSciNetCrossRefGoogle Scholar
  3. 3.
    Labetoulle, J., Some theorems on real time scheduling, Computer Architectures and Networks, E. Gelenbe and R. Mehl (eds.), North-Holland Publ. Co., 1974, 285–298.Google Scholar
  4. 4.
    Liu, C. L., and J. W. Layland, Scheduling algorithms for multiprogramming in a Hard-real-time environment, J. ACM, Vol. 20, 1973, 46–61.MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Serlin, O., Scheduling of time critical processes Proc. of the Spring Joint Computers Conference, 1972, 925–932.Google Scholar
  6. 6.
    Mok, A. K., Fundamental Design Problems of Distributed Systems for Hard Real- Time Environment, Ph.D. Thesis, MIT, 1983.Google Scholar
  7. 7.
    Leung, J. and Whitehead, J., On the complexity of fixed-priority scheduling of periodic, real-time tasks, Performance Evaluation, Vol. 2, 1982, 237–250.MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Lehoczky, J. P., Fixed priority scheduling of periodic task sets with arbitrary deadlines, Proceedings of the 11th IEEE Real-Time Systems Symposium, December 1990, 201–209.Google Scholar
  9. 9.
    Lehoczky, J. P., and Sha, L., Performance of red-time bus scheduling algorithms, ACM Performance Evaluation Review, Vol. 14, 1986.Google Scholar
  10. 10.
    Peng, D-T. and Shin, K. G., A new performance measure for scheduling independent real-time tasks, Technical Report, Real-Time Computing Laboratory, University of Michigan, 1989.Google Scholar
  11. 11.
    Shih, Wei Kuan, J. W. S. Liu, and C. L. Liu, Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines,submitted.Google Scholar
  12. 12.
    Chan, M. Y. and F. Y. L. Chin, General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction, IEEE Trans. on Computers, Vol. 91, No. 6, 1992, 755–768.CrossRefGoogle Scholar
  13. 13.
    Wei, W. D. and C. L. Liu, On a Periodic Maintenance Problem, Operations Research Letters, Vol. 2, No. 2, 1983, 90–93.MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Dhall, S. K. and C. L. Liu, On a real-time scheduling problem, Operations Research, Vol. 26, 1978, 127–140.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • C. L. Liu
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations