The effect of local scheduling in load balancing designs Jason R. Marden Ho-Lin Chen Information Science and Technology Information Science and Technology California Institute of Technology California Institute of Technology Pasadena, CA 91125 Pasadena, CA 91125 Adam Wierman Computer Science Department California Institute of Technology Pasadena, CA 91125 1. INTRODUCTION This is a common design constraint in distributed web servers. The resulting arrival rate to Qi is Poisson with rate i and the load at queue i is i := i / i < 1. Further, we de ne the remaining service capacity, a.k.a., gap , at Qi as γi := i i > 0. Thus, each Qi is a stationary M/GI/1 queue. Note that all incoming jobs are routed to one of the servers, i.e., there is no balking. For reasons that we will describe in Section 2.1, we will be considering the heavy-traf c behavior of this system. That is, we will analyze the response time as i i , which also ensures that each Qi is in heavy-traf c, i.e. i 1. Interestingly, we can take a slightly different view of the load balancing model than we have described to this point
/lp/association-for-computing-machinery/the-effect-of-local-scheduling-in-load-balancing-designs-CUcNmFdOzj