Chen, Ho-Lin and Marden, Jason R. and Wierman, Adam (2009) On the impact of heterogeneity and back-end scheduling in load balancing designs. In: INFOCOM 2009, IEEE. IEEE , pp. 2267-2275. ISBN 978-1-4244-3512-8 http://resolver.caltech.edu/CaltechAUTHORS:20100510-110115895
- Published Version
Restricted to Repository administrators only
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20100510-110115895
Load balancing is a common approach for task assignment in distributed architectures. In this paper, we show that the degree of inefficiency in load balancing designs is highly dependent on the scheduling discipline used at each of the backend servers. Traditionally, the back-end scheduler can be modeled as Processor Sharing (PS), in which case the degree of inefficiency grows linearly with the number of servers. However, if the back-end scheduler is changed to Shortest Remaining Processing Time (SRPT), the degree of inefficiency can be independent of the number of servers, instead depending only on the heterogeneity of the speeds of the servers. Further, switching the back-end scheduler to SRPT can provide significant improvements in the overall mean response time of the system as long as the heterogeneity of the server speeds is small.
|Item Type:||Book Section|
|Additional Information:||© 2009 IEEE. This work was supported by NSF CCF 0830511, Microsoft Research, and the Lee Center for Advanced Networking.|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||Tony Diaz|
|Deposited On:||16 May 2010 03:38|
|Last Modified:||26 Dec 2012 12:01|
Repository Staff Only: item control page