The Foreground-Background queue: A survey

Performance Evaluation

Volumn 65, Issue 3-4, 2008, Pages 286-307

  Nuyens, Misja ^a   Wierman, Adam ^b  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b Carnegie Mellon University ^*  (United States)

Author keywords

FB; FBPS; LAS; LAST; M G 1 queue; Scheduling policies; SEPT; SET

Indexed keywords

COMPUTER NETWORKS; COMPUTER SYSTEMS PROGRAMMING; QUEUEING THEORY; SCHEDULING;

FOREGROUND BACKGROUND QUEUEING; THEORETICAL ANALYSIS;

QUEUEING NETWORKS;

EID: 38749109251     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2007.06.028     Document Type: Article

References (75)

1. S. Aalto, U. Ayesta, Mean delay analysis of multi level processor sharing disciplines, in: Proceedings of Infocom, Barcelona, Spain, 2006, pp. 23-29
2. Aalto S., and Ayesta U. On the non-optimality of the foreground-background discipline for imrl service times. Journal of Applied Probability 43 2 (2006) 523-534
3. S. Aalto, U. Ayesta, E. Nyberg-Oksanen, Two-level processor-sharing scheduling disciplines: Mean delay analysis, in: Proceedings ACM Sigmetrics, New York, USA, 2004, pp. 97-105
4. Aalto S., Ayesta U., and Nyberg-Oksanen E. M/G/1 MLPS compared to M/G/1 PS. Operations Research Letters 33 (2004) 519-524
5. S. Aalto, U. Ayesta, Mean delay optimization for the M/G/1 queue with Pareto type service times, in: Extended abstract in ACM Sigmetrics, San Diego, USA, 2007, pp. 383-384
6. Asmussen S. Extreme values for queues via cycle maxima. Extremes 1 2 (1998) 137-168
7. Avi-Itzhak B., and Levy H. On measuring fairness in queues. Advances in Applied Probability 36 3 (2004) 919-936
8. Balkema A., and Verwijmeren S. Stability of an M/G/1 queue with thick tails and excess capacity. Proceedings of the 19th Seminar on Stability Problems for Stochastic Models, Part II, Vologda, 1998. Journal of Mathematical Science 99 4 (2000) 1386-1392
9. Bansal N., and Gamarnik D. Handling load with less stress. Queueing Systems 54 1 (2006) 45-54
10. N. Bansal, A. Wierman, Competitive analysis of M/GI/1 queueing policies, Technical Report CMU-CS-02-201, Carnegie Mellon University, 2002
11. Borel E. Sur l'emploi du théorème de Bernoulli pour faciliter le calcul d'une infinité de coefficients. Application au problème de l'attente à un guichet. Comptes Rendus de l'Académie des Sciences, Paris 214 (1942) 452-456
12. Borst S., Boxma O., Núñez Queija R., and Zwart A. The impact of the service discipline on delay asymptotics. Performance Evaluation 54 (2003) 175-206
13. Borst S., Núñez Queija R., and Zwart A. Sojourn time asymptotics in processor sharing queues. Queueing Systems 53 (2006) 31-51
14. Brown P. Comparing FB and PS scheduling policies. ACM Sigmetrics Performance Evaluation Review 34 3 (2006) 18-22
15. Coffman E., and Denning P. Operating Systems Theory (1973), Prentice-Hall
16. Coffman E., and Kleinrock L. Feedback queueing models for time-shared systems. Journal of the Association for Computing Machinery 15 (1968) 549-576
17. M. Crovella, A. Bestavros, Self-similarity in world wide web traffic: Evidence and possible causes, in: Proceedings ACM Sigmetrics, Philadelphia, USA, 1996, pp. 160-169
18. Cohen J. The Single Server Queue (1982), North-Holland
19. De Meyer A., and Teugels J. On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1. Journal of Applied Probability 17 3 (1980) 802-813
20. Dellart B. How tolerable is delay? consumers evaluations of internet web sites after waiting. Journal of Interactive Marketing 13 (1999) 41-54
21. Egorova R., Zwart B., and Boxma O. Sojourn time tails in the M/D/1 processor sharing queue. Probability in the Engineering and Informational Sciences 20 3 (2006) 429-446
22. Feng H., and Misra V. Mixed scheduling disciplines for network flows. ACM Sigmetrics Performance Evaluation Review 31 2 (2003) 36-39
23. Feng H., and Misra V. On the relationship between coefficient of variation and the performance of M/G/1-FB queues. ACM Sigmetrics Performance Evaluation Review 32 2 (2004) 17-19
24. H. Feng, V. Misra, D. Rubenstein, PBS: A unified priority-based CPU scheduler, in: Proceedings of ACM Sigmetrics, San Diego, USA, 2007, pp. 203-214
25. Gittins J. Multi-Armed Bandit Allocation Indices (1989), Wiley, Chichester
26. Guillemin F., Robert P., and Zwart A. Tail asymptotics for processor sharing queues. Advances in Applied Probability 36 2 (2004) 525-543
27. Harchol-Balter M., Schroeder B., Bansal N., and Agrawal M. Size-based scheduling to improve web performance. ACM Transactions on Computer Systems (2003) 207-233
28. Harchol-Balter M., Sigman K., and Wierman A. Asymptotic convergence of scheduling policies with respect to slowdown. Performance Evaluation 49 (2002) 241-256
29. Jean-Marie A., and Robert P. On the transient behaviour of the processor sharing queue. Queueing Systems 17 (1994) 129-136
30. Kelly F. Reversibility and Stochastic Networks (1979), John Wiley & Sons
31. Kleinrock L. Queueing systems. Computer Applications vol. II (1976), Wiley
32. Klimov G. Time-sharing service systems, I. Theory of Probability and its Applications 19 (1974) 532-551
33. Klimov G. Time-sharing service systems, II. Theory of Probability and its Applications 23 (1978) 314-321
34. Mandjes M., and Nuyens M. Sojourn times in the M/G/1 FB queue with light-tailed service times. Probability in the Engineering and Informational Sciences 19 3 (2005) 351-361
35. Mandjes M., and Zwart A. Large deviations for waiting times in processor sharing queues. Queueing Systems 52 4 (2006) 237-250
36. McKinney J. A survey of analytical time-sharing models. Computing Surveys 1 2 (1969) 105-116
37. Nagonenko V., and Pechinkin A. Heavy loading in FBPS shared-processor systems. Izv. Akad. Nauk. SSSR, Tekh. Kibernet 6 (1980) 62-67
38. R. Núñez Queija, Processor-sharing models for integrated-services networks, Ph.D. Thesis, Eindhoven University, 2000
39. Núñez Queija R. Queues with equally heavy sojourn time and service requirement distributions. Annals of Operations Research 113 (2002) 101-117
40. M. Nuyens, The Foreground-Background queue, Ph.D. Thesis, University of Amsterdam. Available from: http://www.few.vu.nl/~mnuyens/publications, 2004
41. Nuyens M. The maximum queue length for heavy-tailed service times. Queueing Systems 47 (2004) 107-116
42. M. Nuyens, A. Wierman, A. Zwart, Preventing large sojourn times using SMART scheduling, Operations Research (in press)
43. Nuyens M., and Zwart A. A large-deviations analysis of the GI/GI/1 SRPT queue. Queueing Systems 54 2 (2006) 85-97
44. Pechinkin A. Stationary probabilities in a system with discipline of advantageous distribution of a process. Engineering Cybernetics 18 5 (1981) 52-56
45. I. Rai, E. Biersack, G. Urvoy-Keller, LAS scheduling approach to avoid bandwidth hogging in heterogeneous TCP networks, in: 7th IEEE International Conference on High Speed Networks and Multimedia Communications HSNMC'04, Toulouse, France, 2004, pp. 179-190
46. Rai I., Biersack E., and Urvoy-Keller G. Size-based scheduling to improve the performance of short TCP flows. IEEE Network Magazine 19 1 (2005) 12-17
47. I. Rai, G. Urvoy-Keller, E. Biersack, Analysis of LAS scheduling for job size distributions with high variance, in: Proceedings of ACM Sigmetrics, San Diego, USA, 2003, pp. 218-228
48. I. Rai, G. Urvoy-Keller, E. Biersack, Performance models for LAS-based scheduling disciplines in a packet switched network, in: Proceedings of ACM Sigmetrics, New York, USA, 2004, pp. 106-117
49. D. Raz, H. Levy, B. Avi-Itzhak, A resource-allocation queueing fairness measure, in: Proceedings of ACM Sigmetrics, New York, USA, 2004, pp. 130-141
50. Raz D., Levy H., and Avi-Itzhak B. On the twin measure and system predictability and fairness. ACM Sigmetrics Performance Evaluation Review 34 3 (2006) 15-17
51. Rhodes R., Battin M.P., and Silvers A. Medicine and Social Justice (2002), Oxford University Press
52. Righter R., and Shanthikumar J. Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Probability in the Engineering and Informational Sciences 3 (1989) 323-333
53. Righter R., Shanthikumar J., and Yamazaki G. On extremal service disciplines in single-stage queueing systems. Journal of Applied Probability 27 (1990) 409-416
54. W. Sandmann, A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement, in: Proceedings of Euro NGI Conference on Next Generation Internet Networks, Rome, Italy, 2005, pp. 106-113
55. W. Sandmann, Analysis of a queueing fairness measure, in: Proceedings of the 13th GI/ITG Conference on Measurement, Modelling and Evaluation of Computer and Communication Systems, Nurnberg, Germany, 2006, pp. 219-231
56. Schassberger R. The steady state distribution of spent service times present in the M/G/1 foreground-background processor-sharing queue. Journal of Applied Probability 25 7 (1988) 194-203
57. Schrage L. The queue M/G/1 with feedback to lower priority queues. Management Science 18 7 (1967) 466-474
58. Schrage L. A proof of the optimality of the shortest remaining service time discipline. Queueing Systems 16 (1968) 670-690
59. Schrage L., and Miller L. The M/G/1 queue with the shortest remaining processing time first discipline. Operations Research 14 4 (1966) 670-684
60. Shaked M., and Shanthikumar J. Stochastic Orders and their Applications (1994), Academic Press
61. Silberschatz A., Galvin P.B., and Gagne G. Applied Operating Systems Concepts (2000), John Wiley & Sons
62. Taqqu M., Willinger W., and Erramilli A. A bibliographical guide to self-similar traffic and performance modeling for modern high-speed networks. Stochastic Networks: Theory and Applications (1996), Oxford University Press 339-366
63. Verloop I., Borst S., and Núñez Queija R. Stability of size-based scheduling disciplines in resource-sharing networks. Proceedings Performance 2005. Performance Evaluation 62 (2005) 247-262 (Special issue)
64. Wierman A., Bansal N., and Harchol-Balter M. A note comparing response times in the M/GI/1/FB and M/GI/1/PS queues. Operations Research Letters 32 1 (2004) 73-76
65. A. Wierman, M. Harchol-Balter, Classifying scheduling policies with respect to unfairness in an M/GI/1, in: Proceedings of ACM Sigmetrics, San Diego, USA, 2003, pp. 238-249
66. A. Wierman, M. Harchol-Balter, Classifying scheduling policies with respect to higher moments of response time in an M/GI/1, in: Proceedings of ACM Sigmetrics, Banff, CA, 2005, pp. 229-240
67. A. Wierman, M. Harchol-Balter, Nearly insensitive bounds for SMART scheduling, in: Proceedings of ACM Sigmetrics, Banff, CA, 2005, pp. 205-216
68. Wierman A. Fairness and classifications. ACM Sigmetrics Performance Evaluation Review 34 4 (2007) 4-12
69. R. Wu, D. Down, Scheduling multi-server systems using foreground-background processing, in: Proceedings of the 42nd Annual Allerton Conference on Communications, Control, and Computing, Urbana, Illinois, 2004
70. Yashkov S. Analysis of a system with priority-based processor-sharing. Automatic Control and Computer Sciences 18 3 (1984) 27-36
71. Yashkov S. Processor-sharing queues: Some progress in analysis. Queueing Systems 2 (1987) 1-17
72. Yashkov S. Mathematical problems in the theory of shared-processor systems. Journal of Soviet Mathematics 58 2 (1992) 101-147
73. Yashkov S., and Yashkova A. A note on a heavy traffic limit theorem for the M/D/1-FBPS queue. Information Processes 4 3 (2004) 251-255
74. Zhou M., and Zhou L. How does waiting duration information influence customers' reactions to waiting for services. Journal of Applied Social Psychology 26 (1996) 1702-1717
75. Zwart A., and Boxma O. Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Systems 35 (2000) 141-166