The effect of local scheduling in load balancing designs

Performance Evaluation Review

Volumn 36, Issue 2, 2008, Pages 110-112

  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

EID: 77956574645     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1453175.1453200     Document Type: Article

References (19)

1. N. Bansal. On the average sojourn time under M/M/1/SRPT. Oper. Res. Letters, 22(2): 195-200, 2005.
2. N. Bansal and D. Gamarnik. Handling load with less stress. Queueing Systems, 54(1): 45-54, 2006.
3. M. Harchol-Baiter, B. Schroeder, M. Agrawal, and N. Bansal. Size-based scheduling to improve web performance. ACM Transactions on Computer Systems, 21(2), May 2003.
4. M. Haviv and T. Roughgarden. The price of anarchy in an exponential multi-server. Oper. Res. Letters, 35: 421-426, 2007.
5. L. Kleinrock. Queueing Systems, Volume II. Computer Applications. John Wiley & Sons, 1976.
6. E. Koutsoupias and C. Papadimilriou. Worst-case equilibria. In Proc of Symp. on Theor. Aspects of Comp. Sci, pages 404-413, 1999.
7. D. Lu, H. Sheng, and P. Dinda. Size-based scheduling policies with inaccurate scheduling information. In Proc. IEEE of MASCOTS, 2004.
8. N. Nissan, T. Roughgarden, E. Tardos, and V. V. Vazirani. Algorithmic game theory, Cambridge University Press, New York, NY, USA, 2007.
9. A. Pigou. The Economics of Welfare. Macmillan, 1920.
10. M. Rawat and A. Kshemkalyani. SWIFT: Scheduling in web servers for fast response time. In Symp. on Net. Comp. and App., 2003.
11. T. Roughgarden. The price of anarchy is independent of the network topology. J. Comp. Syst. Sci., 67(2): 341-364, 2003.
12. T. Roughgarden and E. Tardos. How bad is selfish routing. J. ACM, 49(2): 236-259, 2002.
13. L. E. Schrage. A proof of the optimality of the shortest remaining processing time discipline. Operations Research, 16: 678-690, 1968.
14. J. G. Wardrop. Some theoretical aspects of road traffic research. Proc of Institute of Civil Engineers, 1: 325-378, 1952.
15. A. Wierman. Scheduling for today's computer systems: Bridging theory and practice. PhD thesis. Carnegie Mellon University, 2007.
16. A. Wierman, M. Harchol-Balter, and T. Osogami. Nearly insensitive bounds on SMART scheduling. In Proc. of ACM Sigmetrics, 2005.
17. A. Wierman and M. Nuyens. Scheduling despite inexact job-size information. In Proc. of ACM Sigmetrics, 2008.
18. T. Wu and D. Starobinski. On the price of anarchy in unbounded delay networks. In Proc. of Game Theory for Comm. and Networks, 2006.
19. S. Yashkov. Mathematical problems in the theory of shared-processor systems. J. of Soviet Mathematics, 58: 101-147, 1992.