On the nonoptimality of the foreground-background discipline for IMRL service times

Journal of Applied Probability

Volumn 43, Issue 2, 2006, Pages 523-534

  Aalto, S ^a   Ayesta, U ^b,c  

^a AALTO UNIVERSITY   (Finland)

^b CWI   (Netherlands)

^c LAAS CNRS   (France)

Author keywords

FB; IMRL; M G 1; Mean delay; MLPS; PS; Queueing theory; Scheduling

Indexed keywords

EID: 33845322990     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1152413739     Document Type: Article

References (7)

1. AALTO, S., AYESTA, U. AND NYBERG-UKSANEN, E. (2004). Two-level processor-sharing scheduling disciplines: mean delay analysis. In ACM SIGMETRICS Performance Evaluation Review (Proc. SIGMETRICS 2004/PERFORMANCE 2004), Association for Computing Machinery, New York, pp. 97-105.
2. COFFMAN, E. G., JR. AND DENNING, P. J. (1973). Operating Systems Theory. Prentice-Hall, Englewood Cliffs, NJ.
3. KLEINROCK, L. (1976). Queueing Systems, Vol. II, Computer Applications. John Wiley, New York.
4. RICHTER, R. AND SHANTHIKUMAR, J. G. (1989). Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Prob. Eng. Inf. Sci. 3, 323-333.
5. RICHTER, R., SHANTHIKUMAR, J. G. AND YAMAZAKI, G. (1990). On extremal service disciplines in single-stage queueing systems. J. Appl. Prob. 27, 409-416.
6. WIERMAN, A., BANSAL, N. AND HARCHOL-BALTER, M. (2004). A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues. Operat. Res. Lett. 32, 73-76.
7. YASHKOV, S. F. (1987). Processor-sharing queues: some progress in analysis. Queueing Systems 2, 1-17.