The equivalence between processor sharing and service in random order

Operations Research Letters

Volumn 31, Issue 4, 2003, Pages 254-262

  Borst, S C ^a,b,c   Boxma, O J ^a,b   Morrison, J A ^c   Nunez Queija R ^a,b  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAY CONTROL SYSTEMS; OPERATIONS RESEARCH; POISSON DISTRIBUTION; PROGRAM PROCESSORS; TIME SHARING SYSTEMS;

WAITING TIME;

QUEUEING THEORY;

EID: 0038210215     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00006-3     Document Type: Article

References (28)

1. Barbour A.D. Networks of queues and the method of stages. Adv. Appl. Probab. 8:1976;584-591.
2. Baskett F., Chandy K.M., Muntz R.R., Palacios F.G. Open, closed, and mixed networks of queues with different classes of customers. J. ACM. 22:1975;248-260.
3. Boxma O.J., Denteneer D., Resing J.A.C. Some models for contention resolution in cable networks. Gregori E.et al. Networking 2002. Lecture Notes in Computer Science. Vol. 2345:2002;117-128 Springer, Berlin.
4. Coffman E.G. Jr., Muntz R.R., Trotter H. Waiting time distribution for processor-sharing systems. J. ACM. 17:1970;123-130.
5. Cohen J.W. The multiple phase service network with generalised processor sharing. Acta Inform. 12:1979;245-284.
6. Cohen J.W. The Single Server Queue. 2nd Edition:1982;North-Holland, Amsterdam.
7. Cohen J.W. On processor sharing and random service (Letter to the editor). J. Appl. Probab. 21:1984;937-937.
8. Flatto L. The waiting time distribution for the random order service M/M/1 queue. Ann. Appl. Probab. 7:1997;382-409.
9. Jagerman D.L., Sengupta B. The GI/M/1 processor-sharing queue and its heavy traffic analysis. Comm. Statist. Stochastic Models. 7:1991;379-395.
10. Kelly F.P. Reversibility and Stochastic Networks. 1979;Wiley, Chichester.
11. Kendall D.G. Stochastic processes occurring in the theory of queues and their analysis by the method of the embedded Markov chain. Ann. Math. Statist. 24:1953;338-354.
12. Kleinrock L. Analysis of a time-shared processor. Naval Res. Logist. Quart. 11:1964;59-73.
13. Kleinrock L. Time-shared systems. a theoretical treatment J. ACM. 14:1967;242-261.
14. L. Massoulié, J.W. Roberts, Bandwidth sharing: objectives and algorithms, in: Proceedings of the IEEE INFOCOM '99, 1999, pp. 1395-1403.
15. Mitra D. Waiting time distributions from closed queueing network models of shared-processor systems. Kylstra F.J. Proceedings of Performance '81. 1981;113-131 North-Holland, Amsterdam.
16. Mitra D., Morrison J.A. Asymptotic expansions of moments of the waiting time in closed and open processor-sharing systems with multiple job classes. Adv. Appl. Probab. 15:1983;813-839.
17. Morrison J.A. Response-time distribution for a processor-sharing system. SIAM J. Appl. Math. 45:1985;152-167.
18. Morrison J.A., Mitra D. Heavy-usage asymptotic expansions for the waiting time in closed processor-sharing systems with multiple classes. Adv. Appl. Probab. 17:1985;163-185.
19. R. Núñez Queija, Processor-sharing models for integrated-services networks, Ph.D. Thesis, Eindhoven University of Technology, 2000, ISBN 90-646-4667-8 (http://www.cwi.nl/̃sindo).
20. Núñez Queija R. Note on the GI/GI/1 queue with LCFS-PR observed at arbitrary times. Probab. Eng. Inf. Sci. 15:2001;179-187.
21. Ott T.J. The sojourn time distributions in the M/G/1 queue with processor sharing. J. Appl. Probab. 21:1984;360-378.
22. Ramaswami V. The sojourn time in the GI/M/1 queue with processor sharing. J. Appl. Probab. 21:1984;437-442.
23. M. Sakata, S. Noguchi, J. Oizumi, Analysis of a processor-shared queueing model for time-sharing systems, in: Proceedings of the Second Hawaii International Conference on System Sciences, 1969, pp. 625-628.
24. Sakata M., Noguchi S., Oizumi J. An analysis of the M/G/1 queue under round-robin scheduling. Oper. Res. 19:1971;371-385.
25. Sengupta B., Jagerman D.L. A conditional response time of the M/M/1 processor-sharing queue. AT&T Tech. J. 64:1985;409-421.
26. Sevcik K.C., Mitrani I. The distribution of queuing network states at input and output instants. J. ACM. 28:1981;358-371.
27. Yashkov S.F. Processor-sharing queues. some progress in analysis Queueing Systems. 2:1987;1-17.
28. Yashkov S.F. Mathematical problems in the theory of processor-sharing queueing systems. J. Soviet Math. 58:1992;101-147.