Skip to main content
SpringerLink
Log in

Feasible processor allocation in a Hard-Real-Time environment

  • Published:
Real-Time Systems Aims and scope Submit manuscript

Abstract

Consider the problem of scheduling a set of preemptible tasks in one or more processor systems. The task system consists of a set of independent tasks or a task set with precedence relations. Each task is characterized by execution time and deadline. This article presents scheduling algorithms that guarantee all time constraints. These algorithms are so easy to implement that they can be used in real-time operating systems. An overview is given for the different feasible scheduling algorithms of some task and processor systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • BlazewiczJ., M.Drabowski, and J.Weglarz, 1986. Scheduling Multiprocessor Tasks to Minimize Schedule Length.IEEE Trans. Computer 35 (5): 389–393.

    MathSciNet  Google Scholar 

  • CoffmannE. G.Jr., and P. J.Denning. 1973.Operating System Theory. Prentice-Hall, Englewood Cliffs, N.J.

    Google Scholar 

  • Eichenauer, B. 1975. Dynamische Prioritätsvergabe an Tasks in Prozessrechensystemen, Dissertation, University of Stuttgart.

  • Heen, R., and S. Lehnhoff. 1973. Strategien zur pseudo-kollateralen Verarbeitung von Programmen unter Berücksichtigung vorgegebener Antwortzeiten. Math. Report 7307 Technical University of Munich.

  • Henn, R. 1975. Deterministische Modelle fur die Prozessorzuteilung in einer harten Realzeitungebung. Dissertation, Technical University of Munich.

  • — 1978. Antwortzeitgesteurerte Prozessorzuteilung unter strengen Zeitbedingungen.Computing C 19: 209–220.

    Article  MATH  MathSciNet  Google Scholar 

  • T. C.Hu: 1961. Parallel Sequencing and Assembly Line Problems.Operations Research 8 (6): 841–848.

    Google Scholar 

  • Jensen, E. D., C. D. Locke, and H. Tokuda. 1985. A Time-Driven Scheduling Model for Real-Time Operating Systems.Proc. IEEE Real-Time Systems Symposium, pp. 112–122.

  • Johnson, H. H., and M. Maddison. 1974. Deadline Scheduling for a Real-Time Multiprocessor:Eurocomp. Conf. Proc., pp. 139–153.

  • Leinbaugh, D. 1980. Guaranteed Response Times in a Hard-Real-Time Environment,IEEE Trans. Software Engineering SE-6.

  • LiuC. L. and J. W.Layland. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment.JACM 20 (1): 46–61.

    Article  MathSciNet  Google Scholar 

  • Mok, A.K.-L, and M. Dertouzos. 1978. Multiprocessor Scheduling in a Hard-Real-Time Environment.Proc. Seventh Texas Conference on Computing Systems.

  • MuntzR. R., and E. G.CoffmannJr. 1970. Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems.JACM 17 (2): 324–338.

    Article  Google Scholar 

  • RamamrithamK., and J. A.Stankovic. 1984. Dynamic Task Scheduling in Distributed Real-Time Systems,IEEE Software 1 (3): 65–75.

    Google Scholar 

  • StankovicJ. A., K.Ramamritham, and S.Cheng. 1986. Evaluation of a Bidding Algorithm for Hard-Real-Time Distributed Systems.IEEE Trans. Computers. C 34 (12): 1130–1143.

    Google Scholar 

  • Zhao, W., K. Ramamritham, and J. A. Stankovic. 1987a. Preemptive Scheduling under Time and Resource Constraints in a Hard-Real-Time System.IEEE Trans. Computers C-36 (8).

  • Zhao, W., 1987b. Scheduling Tasks with Resource Requirements in Hard-Real-Time Systems.IEEE Trans. Software Engineering SE-13 (5).

Download references

Author information

Authors and Affiliations

  1. GPP Gesellschaft für Prozessrechnerprogrammierung mbH Kolpingring 18a, 8024, Oberhaching, West Germany

    Richard K. J. Henn

Authors
  1. Richard K. J. Henn
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Henn, R.K.J. Feasible processor allocation in a Hard-Real-Time environment. Real-Time Syst 1, 77–93 (1989). https://doi.org/10.1007/BF02341922

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02341922

Keywords

Search

Navigation