• DocumentCode
    934559
  • Title

    The Utah TENEX scheduler

  • Author

    Ellison, Carl M.

  • Author_Institution
    University of Utah, Salt Lake City, Utah
  • Volume
    63
  • Issue
    6
  • fYear
    1975
  • fDate
    6/1/1975 12:00:00 AM
  • Firstpage
    940
  • Lastpage
    945
  • Abstract
    A scheduling algorithm which is a modification of the standard TENEX scheduler is described. This algorithm differs from those commonly used in time-sharing systems in that it treats the case of multiple critical resources. The Utah scheduler considers CPU usage and real core occupancy, but the same techniques can be applied to cases of more than two critical resources. Similar scheduling tehniques can be applied to interactive batch-processing systems and to resource sharing systems.
  • Keywords
    Assembly systems; Computer science; Processor scheduling; Programming profession; Resource management; Runtime; Scheduling algorithm; Size measurement; Time sharing computer systems;
  • fLanguage
    English
  • Journal_Title
    Proceedings of the IEEE
  • Publisher
    ieee
  • ISSN
    0018-9219
  • Type

    jour

  • DOI
    10.1109/PROC.1975.9858
  • Filename
    1451788
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=934559