Cited By
View all- Berenbrink PKling PLiaw CMehrabian A(2017)Tight Load Balancing Via Randomized Local Search2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2017.52(192-201)Online publication date: May-2017
Brief announcement: threshold load balancing in networks
Pages 54 - 56
Abstract
We study probabilistic protocols for concurrent threshold-based load balancing in networks. There are n resources or machines represented by nodes in an undirected graph and m >> n users that try to find an acceptable resource by moving along the edges of the graph. Users accept a resource if the load is below a threshold. Such thresholds have an intuitive meaning, e.g., as deadlines in a machine scheduling scenario, and they allow the design of protocols under strong locality constraints. When migration is partly controlled by resources and partly by users, our protocols obtain rapid convergence to a balanced state, in which all users are satisfied. We show that convergence is achieved in a number of rounds that is only logarithmic in m and polynomial in structural properties of the graph. Even when migration is fully controlled by users, we obtain similar results for convergence to approximately balanced states.
References
[1]
H. Ackermann, S. Fischer, M. Hoefer, M. Schöngens. Distributed algorithms for QoS load balancing. Distrib. Comput., 23(5-6):321--330, 2011.
[2]
P. Berenbrink, T. Friedetzky, L. Goldberg, P. Goldberg, Z. Hu, R. Martin. Distributed delfish load balancing. SIAM J. Comput., 37(4):1163--1181, 2007.
[3]
P. Berenbrink, M. Hoefer, T. Sauerwald. Distributed selfish load balancing on networks. In Proc. SODA, pp. 1487--1497, 2011.
[4]
R. Elsässer, B. Monien, S. Schamberger. Distributing unit size workload packages in heterogeneous networks. J. Graph Alg. Appl., 10(1):51--68, 2006.
[5]
R. Elsässer, T. Sauerwald. Discrete Load Balancing is (Almost) as Easy as Continuous Load Balancing. In Proc. PODC, pp. 346--354, 2010.
[6]
E. Even-Dar, Y. Mansour. Fast convergence of selfish rerouting. In Proc. SODA, pp. 772--781, 2005.
[7]
S. Fischer, P. Mäahöonen, M. Schöngens, B. Vöocking. Load balancing for dynamic spectrum assignment with local information for secondary users. In Proc. DySPAN, 2008.
[8]
Y. Rabani, A. Sinclair, R. Wanka. Local divergence of Markov chains and the analysis of iterative load balancing schemes. In Proc. FOCS, pp. 694--705, 1998.
[9]
B. Vöocking. Selfish load balancing. In N. Nisan et al., eds., Algorithmic Game Theory, chapter 20. Cambridge Univ. Press, 2007.
Index Terms
- Brief announcement: threshold load balancing in networks
Recommendations
Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications
SPAA '10: Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architecturesLoad balancing is an important consideration when running data-parallel programs. While traditional techniques trade off the cost of load imbalance with the overhead of mitigating that imbalance, when speculatively parallelizing amorphous data-parallel ...
Threshold Load Balancing with Weighted Tasks
IPDPS '15: Proceedings of the 2015 IEEE International Parallel and Distributed Processing SymposiumWe study threshold-based load balancing protocols for weighted tasks. We are given an arbitrary graph G with n nodes (resources, bins) and m > n tasks (balls). Initially the tasks are distributed arbitrarily over the n nodes. The resources have a ...
Brief Announcement: Approximation Algorithms for Preemptive Resource Allocation
SPAA '18: Proceedings of the 30th on Symposium on Parallelism in Algorithms and ArchitecturesCloud services require the allocation of scarce resources to multiple user requests (jobs) in a setting that facilitates preemption and migration while respecting resource and timing constraints. This gives rise to the following variants of the ...
Comments
Information & Contributors
Information
Published In
July 2013
422 pages
ISBN:9781450320658
DOI:10.1145/2484239
- General Chair:
- Panagiota Fatourou,
- Program Chair:
- Gadi Taubenfeld
Copyright © 2013 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 22 July 2013
Check for updates
Author Tags
Qualifiers
- Extended-abstract
Conference
PODC '13: ACM Symposium on Principles of Distributed Computing
July 22 - 24, 2013
Québec, Montréal, Canada
Acceptance Rates
PODC '13 Paper Acceptance Rate 37 of 145 submissions, 26%;
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 215Total Downloads
- Downloads (Last 12 months)6
- Downloads (Last 6 weeks)1
Reflects downloads up to 03 Feb 2025
Other Metrics
Citations
Cited By
View all- Berenbrink PKling PLiaw CMehrabian A(2017)Tight Load Balancing Via Randomized Local Search2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS.2017.52(192-201)Online publication date: May-2017
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