Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

DOI Web Site 被引用文献194件
  • C. L. Liu
    Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL and Project MAC, Massachusetts Institute of Technology
  • James W. Layland
    Jet Propulsion Laboratory, California Institute of Technology, 4800 Oak Grove Drive, Pasadena, CA

この論文をさがす

説明

<jats:p>The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadlines. A combination of these two scheduling techniques is also discussed.</jats:p>

収録刊行物

  • Journal of the ACM

    Journal of the ACM 20 (1), 46-61, 1973-01

    Association for Computing Machinery (ACM)

被引用文献 (194)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ