• DocumentCode
    3054030
  • Title

    The serving process with least thinking time maximizes resource utilization

  • Author

    Courcoubetis, C. ; Varaiya, P.

  • Author_Institution
    Bell Laboratories, Murray Hill, New Jersey
  • fYear
    1983
  • fDate
    - Dec. 1983
  • Firstpage
    1181
  • Lastpage
    1184
  • Abstract
    A fixed number of processes (users) share a common resource. Each process is described by a Markov chain with a "thinking" state and a "request" for service state. A policy is a preemptive scheme that assigns the resource to one of the simultaneously requesting processes. The policy that maximizes resource utilization assigns the resource to the process with least thinking time.
  • Keywords
    Cost function; Delay; Resource management; Time sharing computer systems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Decision and Control, 1983. The 22nd IEEE Conference on
  • Conference_Location
    San Antonio, TX, USA
  • Type

    conf

  • DOI
    10.1109/CDC.1983.269709
  • Filename
    4047740
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3054030