Load balancing and the power of preventive probing
Pages 65 - 67
Abstract
Consider a randomized load balancing problem consisting of a large number n of server sites each equipped with K servers. Under the greedy policy, clients randomly probe a site to check whether there is still a server available. If not, d -- 1 other sites are probed and the task is assigned to the site with the fewest number of busy servers. If all the servers are also busy in each of these d -- 1 sites, the task is lost.
This short paper analyzes a set of policies, i.e., (L, d) policies, that will occasionally probe additional sites even when there is still a server available at the site that was probed first. Using mean field methods, we show that these policies, that preventively probe other sites, can achieve the same loss probability while requiring a lower overall probe rate.
References
[1]
D. L. Eager, E. D. Lazowska, and J. Zahorjan. A comparison of receiver-initiated and sender-initiated adaptive load sharing. Perform. Eval., 6(1):53--68, 1986.
[2]
N. Gast and B. Gaujal. A mean field model of work stealing in large-scale systems. SIGMETRICS Perform. Eval. Rev., 38(1):13--24, 2010.
[3]
T. Kurtz. Approximation of population processes. Society for Industrial and Applied Mathematics, 1981.
[4]
M. Mitzenmacher. The power of two choices in randomized load balancing. IEEE Trans. Parallel Distrib. Syst., 12:1094--1104, October 2001.
[5]
M. Mitzenmacher, A. Richa, and R. Sitaraman. The power of two random choices: a survey of techniques and results. Handbook of Randomized Computing, 1, 2001.
Index Terms
- Load balancing and the power of preventive probing
Recommendations
Universality of Power-of-d Load Balancing Schemes
We consider a system of N parallel queues with unit exponential service rates and a single dispatcher where tasks arrive as a Poisson process of rate λ(N). When a task arrives, the dispatcher assigns it to a server with the shortest queue among d(N) ≤ N ...
Performance evaluation of new methods of automatic redirection for load balancing of Apache servers distributed in the Internet
LCN '00: Proceedings of the 25th Annual IEEE Conference on Local Computer NetworksAn overloaded web server will lose incoming requests resulting in a "404 error" appearing at a client browser. Front-end application-level switches can redirect requests to less loaded servers. However, there exist no native methods within common web ...
Comments
Information & Contributors
Information
Published In
Copyright © 2011 Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 15 September 2011
Published in SIGMETRICS Volume 39, Issue 2
Check for updates
Qualifiers
- Short-paper
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 45Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in