• DocumentCode
    843839
  • Title

    Serving process with least thinking time maximizes resource utilization

  • Author

    Courcoubetis, Costas ; Varaiya, Pravin P.

  • Author_Institution
    Bell Laboratories, Murray Hill, NJ, USA
  • Volume
    29
  • Issue
    11
  • fYear
    1984
  • fDate
    11/1/1984 12:00:00 AM
  • Firstpage
    1005
  • Lastpage
    1008
  • 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
    Markov processes; Optimal stochastic control; Queuing analysis; Stochastic optimal control; Computer science; Cost function; Delay effects; Laboratories; Mathematical model; Open systems; Resource management; Stochastic processes;
  • fLanguage
    English
  • Journal_Title
    Automatic Control, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9286
  • Type

    jour

  • DOI
    10.1109/TAC.1984.1103432
  • Filename
    1103432
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=843839