Title :
The serving process with least thinking time maximizes resource utilization
Author :
Courcoubetis, C. ; Varaiya, P.
Author_Institution :
Bell Laboratories, Murray Hill, New Jersey
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;
Conference_Titel :
Decision and Control, 1983. The 22nd IEEE Conference on
Conference_Location :
San Antonio, TX, USA
DOI :
10.1109/CDC.1983.269709
