Fairness and scheduling in single server queues

Surveys in Operations Research and Management Science

Volumn 16, Issue 1, 2011, Pages 39-48

  Wierman, Adam ^a  

^a California Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957161358     PISSN: 18767354     EISSN: None     Source Type: Book Series    
DOI: 10.1016/j.sorms.2010.07.002     Document Type: Review

References (56)

1. Schrage L.E. A proof of the optimality of the shortest remaining processing time discipline. Operations Research 1968, 16:678-690.
2. Conway R.W., Maxwell W.L., Miller L.W. Theory of Scheduling 1967, Addison-Wesley Publishing Company.
3. Harchol-Balter M., Schroeder B., Agrawal M., Bansal N. Size-based scheduling to improve web performance. ACM Transactions on Computer Systems 2003, 21(2).
4. M. Rawat, A. Kshemkalyani, SWIFT: scheduling in web servers for fast response time, in: Symp. on Net. Comp. and App., 2003.
5. I.A. Rai, G. Urvoy-Keller, E. Biersack, Analysis of FB scheduling for job size distributions with high variance, in: Proc. of ACM Sigmetrics, 2003.
6. I.A. Rai, G. Urvoy-Keller, M. Vernon, E.W. Biersack, Performance modeling of FB based scheduling in packet switched networks, in: Proc. of ACM Sigmetrics-Performance, 2004.
7. M. Hu, J. Zhang, J. Sadowsky, A size-aided opportunistic scheduling scheme in wireless networks, in: Proc. of Globecom, 2003.
8. Yang S., de Veciana G. Enhancing both network and user performance for networks supporting best effort traffic. Transactions on Networking 2004, 12(2):349-360.
9. H. Feng, V. Misra, D. Rubenstein, PBS: a unified priority-based CPU scheduler, in: Proc. of ACM Sigmetrics, 2007.
10. M. Bender, S. Chakrabarti, S. Muthukrishnan, Flow and stretch metrics for scheduling continous job streams, in: Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998.
11. Silberschatz A., Galvin P. Operating System Concepts 1998, John Wiley & Sons. 5th edition.
12. Stallings W. Operating Systems 1995, Prentice Hall. 2nd edition.
13. Tanenbaum A. Modern Operating Systems 1992, Prentice Hall.
14. D. Raz, H. Levy, B. Avi-Itzhak, A resource-allocation queueing fairness measure, in: Proc. of ACM Sigmetrics-Performance, 2004.
15. D. Raz, B. Avi-Itzhak, H. Levy, Fairness considerations in multi-server and multi-queue systems, in: Proc. of Valuetools, 2006.
16. W. Sandmann, A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement, in: Proc. of Euro NGI Conf. on Next Generation Int. Nets, 2005.
17. Wierman A. Fairness and classifications. Performance Evaluation Review 2007, 34(4):4-12.
18. A. Wierman, M. Harchol-Balter, Classifying scheduling policies with respect to unfairness in an M/GI/1, in: Proc. of ACM Sigmetrics, 2003.
19. A. Wierman, Scheduling for today's computer systems: bridging theory and practice, Ph.D. Thesis, Carnegie Mellon University, 2007.
20. Kelly F., Maulloo A., Tan D. Rate control for communication networks: shadow prices, proportional fairness, and stability. Journal of the Operations Research Society 1998, 49.
21. M. Dianati, M. Shen, S. Naik, A new fairness index for radio resource allocation in wireless networks, in: Proc. of WCNC, 2005.
22. C.E. Koksal, H.I. Kassab, H. Balakrishnan, An anaysis of shortterm fairness in wireless media access protocols, in: Proc. of ACM Sigmetrics, 2000.
23. Mo J., Walrand J. Fair end-to-end window-based congestion control. Transactions on Networking 2000, 8(5):556-567.
24. T. Bonald, L. Massoulie, Impact of fairness on internet performance, in: Proc. of ACM Sigmetrics, 2001.
25. T. Lan, D. Gao, M. Chiang, A. Sabharwal, An axiomatic theory of fairness, in: Proc. of Infocom, 2010.
26. Rafaeli A., Barron G., Haber K. The effects of queue structure on attidues. Journal of Service Research 2002, 5(2):125-139.
27. Larson R. Perspectives on queues: social justice and the psychology of queueing. Operations Research 1987, 35:895-905.
28. E.S. Gordon, New problems in queues: social injustic and server production management, Ph.D. Thesis, Massachusetts Institute of Technology, 1987.
29. Avi-Itzhak B., Levy H., Raz D. A resource allocation fairness measure: properties and bounds. Queueing Systems Theory and Applications 2007, 56(2):65-71.
30. Kleinrock L. Queueing Systems. Computer Applications 1976, vol. II. John Wiley & Sons.
31. Nuyens M., Wierman A., Zwart B. Preventing large sojourn times using SMART scheduling. Operations Research 2008, 56(1):88-101.
32. A. Wierman, M. Harchol-Balter, T. Osogami, Nearly insensitive bounds on SMART scheduling, in: Proc. of ACM Sigmetrics, 2005.
33. Rhodes R., Battin M.P., Silvers A. Medicine and Social Justice 2002, Oxford University Press.
34. N. Bansal, M. Harchol-Balter, Analysis of SRPT scheduling: investigating unfairness, in: Proc. of ACM Sigmetrics, 2001.
35. Harchol-Balter M., Sigman K., Wierman A. Asymptotic convergence of scheduling policies with respect to slowdown. Performance Evaluation 2002, 49(1-4):241-256.
36. M.A. Marson, M. Gerla, Fairness in local computing networks, in: Proc. of IEEE ICC, 1982.
37. S. Doroudi, A. Wierman, Understanding fairness via a queueing game (submitted for publication).
38. Kelly F. Reversibility and Stochastic Networks 1979, John Wiley & Sons.
39. Brown P. Comparing FB and PS scheduling policies. Performance Evaluation Review 2006, 34(3):18-20.
40. M. Gong, C. Williamson, Quantifying the properties of SRPT scheduling, in: IEEE/ACM Symposium on Mod., Anal., and Sim. of Comp. and Telecomm. Sys., MASCOTS, 2003.
41. E. Friedman, S. Henderson, Fairness and efficiency in web server protocols, in: Proc. of ACM Sigmetrics, 2003.
42. M. Gong, C. Williamson, Simulation evaluation of hybrid SRPT scheduling policies, in: Proc. of IEEE MASCOTS, 2004.
43. Gong M., Williamson C. Revisiting unfairness in web server scheduling. Computer Networks 2006, 50(13):2183-2203.
44. Borst S., Boxma O., Nunez-Queija R., Zwart B. The impact of the service discipline on delay asymptotics. Performance Evaluation 2003, 54:175-206.
45. Borst S., Nunez-Queija R., Zwart B. Sojourn time asymptotics in processor-sharing queues. Queueing Systems Theory and Applications 2006, 53(1-2).
46. A. Wierman, M. Harchol-Balter, Classifying scheduling policies with respect to higher moments of response time, in: Proc. of ACM Sigmetrics, 2005.
47. Avi-Itzhak B., Levy H. On measuring fairness in queues. Advances of Applied Probability 2004, 36(3):919-936.
48. J.F.C. Kingman, The effect of queue discipline on waiting time variance, in: Proc. of the Cambridge Philosophical Society, 1962.
49. Levy H., Raz D., Avi-Itzhak B. Locality of reference and the use of sojourn time variance for measuring queue unfairness. Operations Research Letters 2007, 35(3):311-318.
50. B. Avi-Itzhak, E. Brosh, H. Levy, SQF: a slowdown queueing fairness measure, Performance Evaluation 64, 1121-1136.
51. G.M. Sabin, Unfairness in parallel job scheduling, Ph.D. Thesis, Ohio State University, 2006.
52. G. Sabin, V. Sahasrabudhe, P. Sadayappan, On fairness in distributed job scheduling across multiple sites, in: Proc. of Cluster, 2004.
53. Raz D., Levy H., Avi-Itzhak B. Class prioritization and server dedication in queueing systems: discrimination and fairness. Performance Evaluation 2010, 67:235-247.
54. W. Sandmann, Analysis of a queueing fairness measure, in: GI/ITG Conf. on Measurement, Modeling, and Eval. of Comp. and Comm. Sys., 2006.
55. M. Armony, A.R. Ward, Blind fair routing in large-scale service systems (submitted for publication).
56. Nuyens M., Wierman A. The foreground-background queue: a survey. Performance Evaluation 2008, 65(3-4):286-307.