This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Process Scheduling in a Computer System
July 1985 (vol. 34 no. 7)
pp. 633-645
Z. Rosberg, Department of Computer Science, Technion-Israel Institute of Technology
A computer system is modeled by an exponential queueing network with different classes of customers and a general class of service policies. The mean cost per unit time is taken as the loss function. Three lower bounds of the loss function under the whole class of service policies, as well as an upper bound of the minimal loss, are derived. The loss function is expressed in a convenient form from which we derive a simple heuristic service policy so called "Klimov policy." This policy is applied to several examples of computer systems and is evaluated by the bounds. The examples recommend using "Klimov policy" in any case; so we have a first rule for deciding how to provide service capacity to different customers in a network of queues.
Index Terms:
service policies, Average cost criterion, Markov chains, queueing networks
Citation:
Z. Rosberg, "Process Scheduling in a Computer System," IEEE Transactions on Computers, vol. 34, no. 7, pp. 633-645, July 1985, doi:10.1109/TC.1985.1676601
Usage of this product signifies your acceptance of the Terms of Use.