A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues

Operations Research Letters

Volumn 32, Issue 1, 2004, Pages 73-76

  Wierman, Adam ^a   Bansal, Nikhil ^a   Harchol Balter, Mor ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Feedback (FB); Least attained service (LAS); M G 1; Processor sharing (PS); Response time; Scheduling; Shortest elapsed time (SET); Sojourn time

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; SCHEDULING; THEOREM PROVING;

LEAST ATTAINED SERVICES (LAS);

QUEUEING THEORY;

EID: 0142124821     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00061-0     Document Type: Article

References (6)

1. Coffman E.G., Denning P. Operating System Theory. 1973;Prentice-Hall, Englewood Cliffs, NJ.
2. L. Kleinrock, Queueing Systems, Vol. II, Computer Applications, Wiley, New York, 1976.
3. I. Rai, G. Urvoy-Keller, E. Biersack, Analysis of LAS scheduling for job size distributions with high variance, in: Proceedings of ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, San Diego, CA, 2003.
4. Schrage L.E., Miller L.W. The queue M/G/1 with the shortest remaining processing time discipline. Oper. Res. 14:1966;670-684.
5. Stoyan D., Daley D.J. Comparison Methods for Queues and Other Stochastic Models. 1983;Wiley, New York.
6. Wolff R.W. Stochastic Modeling and the Theory of Queues. 1989;Prentice-Hall, Englewood Cliffs, NJ.