On the impact of heterogeneity and back-end scheduling in load balancing designs

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2267-2275

  Chen, Ho Lin ^a   Marden, Jason R ^a   Wierman, Adam ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BACK-END SERVERS; DISTRIBUTED ARCHITECTURE; LOAD-BALANCING; MEAN RESPONSE TIME; PROCESSOR SHARING; SCHEDULING DISCIPLINE; SHORTEST REMAINING PROCESSING TIME; TASK ASSIGNMENT;

SCHEDULING;

SERVERS;

EID: 70349686634     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062152     Document Type: Conference Paper

References (38)

1. E. Altman, U. Ayesta, and B. J. Prabhu. Optimal load balancing in processor sharing systems. In Proc. of GameComm, 2008.
2. M. Arlitt and C. Williamson. Web server workload characterization: the search for invariants. In Proc. of ACM Sigmetrics, 1996.
3. B. Avi-Itzhak, H. Levy, and D. Raz. A resource allocation fairness measure: properties and bounds. Queueing Systems Theory and Applications, 56(2):65-71, 2007.
4. N. Bansal. On the average sojourn time under M/M/1/SRPT. Oper. Res. Letters, 22(2):195-200, 2005.
5. N. Bansal and D. Gamarnik. Handling load with less stress. Queueing Systems, 54(1):45-54, 2006.
6. O. Boxma and B. Zwart. Tails in scheduling. Perf. Eval. Rev., 34(4):13-20, 2007.
7. J. Cao, W. Cleveland, D. Lin, and D. Sun. Internettraffic tends toward poisson and independent as the load increases. Springer, New York, 2002.
8. M. Crovella and A. Bestavros. Self-similarity in world wide web traffic: Evidence and possible causes. Trans. on Networking, 5(6):835-846, 1997.
9. D. G. Down and R. Wu. Multi-layered round robin routing for parallel servers. Queueing Sys., 53(4):177-188, 2006.
10. A. B. Downey. A parallel workload model and its implications for processor allocation. In Proc. of High Performance Distributed Computing, pages 112-123, August 1997.
11. M. Harchol-Balter, B. Schroeder, M. Agrawal, and N. Bansal. Size-based scheduling to improve web performance. ACM Transactions on Computer Systems, 21(2), May 2003.
12. J. M. Harrison. Brownian motion and stochastic flow systems. John Wiley and Sons, New York, USA, 1985.
13. M. Haviv and T. Roughgarden. The price of anarchy in an exponential multi-server. Oper. Res. Letters, 35:421-426, 2007.
14. M. Hu, J. Zhang, and J. Sadowsky. A size-aided opportunistic scheduling scheme in wireless networks. In Globecom, 2003.
15. L. Kleinrock. Queueing Systems, volume II. Computer Applications. John Wiley & Sons, 1976.
16. D. Lu, P. Dinda, Y. Qiao, and H. Sheng. Effects and implications of file size/service time correlation on web server scheduling policies. In Proc. of IEEE MASCOTS, 2005.
17. D. Lu, H. Sheng, and P. Dinda. Size-based scheduling policies with inaccurate scheduling information. In Proc. of IEEE MASCOTS, 2004.
18. R. Mangharam, M. Demirhan, R. Rajkumar, and D. Raychaudhuri. Size matters: Size-based scheduling for MPEG-4 over wireless channels. In SPIE & ACM Proceedings in Multimedia Computing and Networking, pages 110-122, 2004.
19. N. Nissan, T. Roughgarden, E. Tardos, and V. V. Vazirani. Algorithmic game theory. Cambridge University Press, New York, NY, USA, 2007.
20. M. Nuyens and A. Wierman. The foreground-background queue: A survey. Performance evaluation, 65(3-4):286-307, 2008.
21. M. Nuyens, A. Wierman, and B. Zwart. Preventing large sojourn times using SMART scheduling. Oper. Res., 56(1):88-101, 2008.
22. A. Pigou. The Economics of Welfare. Macmillan, 1920.
23. M. Rawat and A. Kshemkalyani. SWIFT: Scheduling in web servers for fast response time. In Symp. on Net. Comp. and App., 2003.
24. T. Roughgarden. The price of anarchy is independent of the network topology. J. Comp. Syst. Sci., 67(2):341-364, 2003.
25. T. Roughgarden and E. Tardos. How bad is selfish routing. J. ACM, 49(2):236-259, 2002.
26. L. E. Schrage. A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16:678-690, 1968.
27. L. E. Schrage and L. W. Miller. The queue M/G/1 with the shortest remaining processing time discipline. Operations Research, 14:670-684, 1966.
28. J. G. Wardrop. Some theoretical aspects of road traffic research. Proc of Institute of Civil Engineers, 1:325-378, 1952.
29. A. Wierman. Fairness and classifications. Perf. Eval. Rev., 34(4):4-12, 2007.
30. A. Wierman. Scheduling for today's computer systems: Bridging theory and practice. PhD thesis, Carnegie Mellon University, 2007.
31. A. Wierman, M. Harchol-Balter, and T. Osogami. Nearly insensitive bounds on SMART scheduling. In Proc. of ACM Sigmetrics, 2005.
32. A. Wierman and M. Nuyens. Scheduling despite inexact job-size information. In Proc. of ACM Sigmetrics, 2008.
33. R. J. Williams. Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Systems Theory Appl., 30(1-2):27-88, 1998.
34. R. Wu and D. G. Down. On the relative value of local scheduling versus routing in parallel server systems. In Proc. of Conf. on Paralell and Dist. Sys., 2007.
35. R. Wu and D. G. Down. Round robin scheduling of heterogeneous parallel servers in heavy traffic. In European J. of Oper. Res., toappear.
36. T. Wu and D. Starobinski. On the price of anarchy in unbounded delay networks. In Proc. of Game Theory for Comm. and Networks, 2006.
37. S. Yashkov. Mathematical problems in the theory of shared-processor systems. J. of Soviet Mathematics, 58:101-147, 1992.
38. J. Zhang, J. Dai, and B. Zwart. Diffusion limits of limited processor sharing queues. submitted for publication, 2007.