Title :
Serving process with least thinking time maximizes resource utilization
Author :
Courcoubetis, Costas ; Varaiya, Pravin P.
Author_Institution :
Bell Laboratories, Murray Hill, NJ, USA
fDate :
11/1/1984 12:00:00 AM
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;
Journal_Title :
Automatic Control, IEEE Transactions on
DOI :
10.1109/TAC.1984.1103432
