Cited By
View all- Barenboim LOren G(2022)Distributed backup placementDistributed Computing10.1007/s00446-022-00423-z35:5(455-473)Online publication date: 1-Oct-2022
Efficient Load-Balancing through Distributed Token Dropping
Authors: 
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara UittoAuthors Info & Claims
Sebastian Brandt, Barbara Keller, Joel Rybicki, Jukka Suomela, Jara UittoAuthors Info & ClaimsPages 129 - 139
Abstract
We introduce a new graph problem, the token dropping game, and we show how to solve it efficiently in a distributed setting. We use the token dropping game as a tool to design an efficient distributed algorithm for stable orientations and more generally for locally optimal semi-matchings. The prior work by Czygrinow et al. (DISC 2012) finds a stable orientation in O(Δ^5) rounds in graphs of maximum degree Δ, while we improve it to O(Δ^4) and also prove a lower bound of Ω(Δ). For the more general problem of locally optimal semi-matchings, the prior upper bound is O(S^5) and our new algorithm runs in O(C · S^4) rounds, which is an improvement for C = o(S); here C and S are the maximum degrees of customers and servers, respectively.
References
[1]
Sara Ahmadian, Allen Liu, Binghui Peng, and Morteza Zadimoghaddam. 2021. Distributed Load Balancing: A New Framework and Improved Guarantees. In Proc. 12th Innovations in Theoretical Computer Science Conference (ITCS 2021) (LIPIcs, Vol. 185). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 79:1--79:20. https://doi.org/10.4230/LIPIcs.ITCS.2021.79
[2]
Sepehr Assadi, Aaron Bernstein, and Zachary Langley. 2020. Improved Bounds for Distributed Load Balancing . In 34th International Symposium on Distributed Computing (DISC 2020) (LIPIcs, Vol. 179). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 1:1--1:15. https://doi.org/10.4230/LIPIcs.DISC.2020.1
[3]
Matti Åstrand and Jukka Suomela. 2010. Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. In Proc. 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2010). ACM Press, 294--302. https://doi.org/10.1145/1810479.1810533
[4]
Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaë l Rabie, and Jukka Suomela. 2019. Lower bounds for maximal matchings and maximal independent sets. In Proc. 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2019) . IEEE, 481--497. https://doi.org/10.1109/FOCS.2019.00037
[5]
Sebastian Brandt. 2019. An Automatic Speedup Theorem for Distributed Problems. In Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC 2019). ACM Press, 379--388. https://doi.org/10.1145/3293611.3331611
[6]
Sebastian Brandt, Orr Fischer, Juho Hirvonen, Barbara Keller, Tuomo Lempi"a inen, Joel Rybicki, Jukka Suomela, and Jara Uitto. 2016. A lower bound for the distributed Lovász local lemma. In Proc. 48th ACM Symposium on Theory of Computing (STOC 2016). ACM Press, 479--488. https://doi.org/10.1145/2897518.2897570
[7]
Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie. 2016. An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. In Proc. 57th IEEE Symposium on Foundations of Computer Science (FOCS 2016). IEEE, 615--624. https://doi.org/10.1109/FOCS.2016.72
[8]
Richard Cole and Uzi Vishkin. 1986. Deterministic coin tossing with applications to optimal parallel list ranking . Information and Control, Vol. 70, 1 (1986), 32--53. https://doi.org/10.1016/S0019--9958(86)80023--7
[9]
Andrzej Czygrinow, Michal Hanć kowiak, Edyta Szyma'n ska, and Wojciech Wawrzyniak. 2012. Distributed 2-Approximation Algorithm for the Semi-matching Problem. In Proc. 26th International Conference on Distributed Computing (DISC 2012) . 210--222. https://doi.org/10.1007/978--3--642--33651--5_15
[10]
Laurent Feuilloley, Juho Hirvonen, and Jukka Suomela. 2015. Locally optimal load balancing. In Proc. 29th International Symposium on Distributed Computing (DISC 2015). Springer. https://doi.org/10.1007/978--3--662--48653--5_36
[11]
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, and Jara Uitto. 2017. Improved distributed degree splitting and edge coloring. In Proc. 31st International Symposium on Distributed Computing (DISC 2017) (LIPIcs, Vol. 91). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 19:1--19:15. https://doi.org/10.4230/LIPIcs.DISC.2017.19
[12]
Mohsen Ghaffari and Hsin-Hao Su. 2017. Distributed Degree Splitting, Edge Coloring, and Orientations. In Proc. 28th ACM-SIAM Symposium on Discrete Algorithms (SODA 2017). Society for Industrial and Applied Mathematics, 2505--2523. https://doi.org/10.1137/1.9781611974782.166
[13]
Andrew V. Goldberg, Serge A. Plotkin, and Gregory E. Shannon. 1988. Parallel Symmetry-Breaking in Sparse Graphs. SIAM Journal on Discrete Mathematics, Vol. 1, 4 (1988), 434--446. https://doi.org/10.1137/0401044
[14]
Mika Gö ö s, Juho Hirvonen, and Jukka Suomela. 2017. Linear-in-Δ lower bounds in the LOCAL model. Distributed Computing, Vol. 30, 5 (2017), 325--338. https://doi.org/10.1007/s00446-015-0245--8
[15]
Magnús M Halldórsson, Sven Köhler, Boaz Patt-Shamir, and Dror Rawitz. 2018. Distributed backup placement in networks. Distributed Computing, Vol. 31, 2 (2018), 83--98. https://doi.org/10.1007/s00446-017-0299-x
[16]
Magnús M Halldórsson, Sven Köhler, and Dror Rawitz. 2019. Distributed approximation of k-service assignment. Distributed Computing, Vol. 32, 1 (2019), 27--40. https://doi.org/10.1007/s00446-017-0321--3
[17]
Michal Hanckowiak, Michal Karonski, and Alessandro Panconesi. 1998. On the Distributed Complexity of Computing Maximal Matchings. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998). ACM/SIAM, 219--225.
[18]
Nicholas J.A. Harvey, Richard E. Ladner, László Lovász, and Tami Tamir. 2006. Semi-matchings for bipartite graphs and load balancing. Journal of Algorithms, Vol. 59, 1 (2006), 53--78. https://doi.org/10.1016/j.jalgor.2005.01.003
[19]
Nathan Linial. 1992. Locality in Distributed Graph Algorithms. SIAM J. Comput., Vol. 21, 1 (1992), 193--201. https://doi.org/10.1137/0221015
[20]
Moni Naor. 1991. A lower bound on probabilistic algorithms for distributive ring coloring. SIAM Journal on Discrete Mathematics, Vol. 4, 3 (1991), 409--412. https://doi.org/10.1137/0404036
[21]
Moni Naor and Larry Stockmeyer. 1995. What Can be Computed Locally? SIAM J. Comput., Vol. 24, 6 (1995), 1259--1277. https://doi.org/10.1137/S0097539793254571
[22]
Dennis Olivetti. 2019. Round Eliminator: a tool for automatic speedup simulation. https://github.com/olidennis/round-eliminator
[23]
David Peleg. 2000. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9780898719772
Index Terms
- Efficient Load-Balancing through Distributed Token Dropping
Recommendations
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
A semi-matching on a bipartite graph G = (U ∪ V, E) is a set of edges X ⊆ E such that each vertex in U is incident to exactly one edge in X. The sum of the weights of the vertices from U that are assigned (semi-matched) to some vertex v ∈ V is referred ...
Semi-matchings for bipartite graphs and load balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semi-matching problem; it is a relaxation of the known bipartite matching problem. We present a ...
On load-balanced semi-matchings for weighted bipartite graphs
TAMC'06: Proceedings of the Third international conference on Theory and Applications of Models of ComputationA semi-matching on a bipartite graph G=(U ∪ V, E) is a set of edges X⊆E such that each vertex in U is incident to exactly one edge in X. The sum of the weights of the vertices from U that are assigned (semi-matched) to some vertex v ∈ V is referred to ...
Comments
Information & Contributors
Information
Published In
July 2021
463 pages
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part 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 components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIGARCH: ACM Special Interest Group on Computer Architecture
- EATCS: European Association for Theoretical Computer Science
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 06 July 2021
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures
July 6 - 8, 2021
Virtual Event, USA
Acceptance Rates
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 109Total Downloads
- Downloads (Last 12 months)5
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Dec 2024
Other Metrics
Citations
Cited By
View all- Barenboim LOren G(2022)Distributed backup placementDistributed Computing10.1007/s00446-022-00423-z35:5(455-473)Online publication date: 1-Oct-2022
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