This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Queuing Networks with Random Selection for Service
May 1979 (vol. 5 no. 3)
pp. 287-289
J.R. Spirn, Department of Computer Science, Pennsylvania State University
To the class of queuing networks analyzable by the method of Baskett, Chandy, Muntz, and Palacios, we add service centers whose scheduling is random. That is, upon completion of a service interval, the server chooses next to serve one of the waiting customers selected at random. As in the case of first-come first-served (FCFS) scheduling, all tasks must have the same exponentially distributed service time at such a center. We show that for purposes of this analysis, the results are identical to FCFS queuing. Example applications for random selection scheduling in computer system modeling are provided.
Index Terms:
resource polling, Network of queues, queuing theory, random scheduling
Citation:
J.R. Spirn, "Queuing Networks with Random Selection for Service," IEEE Transactions on Software Engineering, vol. 5, no. 3, pp. 287-289, May 1979, doi:10.1109/TSE.1979.234189
Usage of this product signifies your acceptance of the Terms of Use.