Ioannis Anagnostides
Bernhard Haeupler
Goran Zuzic
ABSTRACT
This paper refines the distributed Laplacian solver recently developed by Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS '21) via the Ghaffari-Haeupler framework (SODA '16) of low-congestion shortcuts. Specifically, if ε > 0 is the error of the Laplacian solver, we obtain two main results.
First, in the supported version of the CONGEST model, we establish an almost universally optimal Laplacian solver. Namely, we show that any Laplacian system on an n-node graph with shortcut quality SQ (G) can be solved after no(1)SQ(G) log (1/ε) rounds, almost matching our lower bound of Ω∼ (SQ(G)) rounds of any graph G. Our techniques also imply almost universally optimal Laplacian solvers in the full generality of CONGEST, conditional on the efficient construction of shortcuts. In particular, they unconditionally imply a novel Dno(1) log (1/ε) Laplacian solver for excluded-minor graphs with hop-diameter D.
Moreover, following a recent line of work in distributed algorithms, we consider a hybrid communication model which enhances CONGEST with limited global power in the form of the node-capacitated clique (NCC) model. In this model, we show the existence of a Laplacian solver with round complexity no(1) log(1/ε).
The unifying thread of these results, and our main technical contribution, is the development of nearly-optimal distributed algorithms for a novel congested generalization of the standard part-wise aggregation problem. This primitive accelerates the Laplacian solver of Forster, Goranci, Liu, Peng, Sun, and Ye, and we believe it will find further applications in the future.
Supplemental Material
- Ioannis Anagnostides and Themis Gouleakis. 2021. Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. In 35th International Symposium on Distributed Computing, DISC 2021 (LIPIcs, Vol. 209). Schloss Dagstuhl - Leibniz- Zentrum für Informatik, 5:1--5:19. https://doi.org/10.4230/LIPIcs.DISC.2021.5Google Scholar
- John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Fabian Kuhn, and Jason Li. 2019. Distributed Computation in Node-Capacitated Networks. In The 31st ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2019, Christian Scheideler and Petra Berenbrink (Eds.). ACM, 69--79. https://doi.org/10.1145/3323165.3323195Google ScholarDigital Library
- John Augustine, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, and Philipp Schneider. 2020. Shortest Paths in a Hybrid Network Model. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Shuchi Chawla (Ed.). SIAM, 1280--1299. https://doi.org/10.1137/1.9781611975994.78Google ScholarCross Ref
- Keren Censor-Hillel, Dean Leitersdorf, and Volodymyr Polosukhin. 2021. Distance Computations in the Hybrid Network Model via Oracle Simulations. In 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, March 16--19, 2021 (LIPIcs, Vol. 187). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 21:1--21:19. https://doi.org/10.4230/LIPIcs.STACS.2021.21Google Scholar
- Tao Chen, Xiaofeng Gao, and Guihai Chen. 2016. The features, hardware, and architectures of data center networks: A survey. J. Parallel and Distrib. Comput. 96 (2016), 45--74. https://doi.org/10.1016/j.jpdc.2016.05.009Google ScholarDigital Library
- Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. 2022. Near-Shortest Path Routing in Hybrid Communication Networks. arXiv:2202.08008 [cs.DC]Google Scholar
- Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. 2011. Distributed Verification and Hardness of Distributed Approximation. In Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing (San Jose, California, USA) (STOC '11). Association for Computing Machinery, New York, NY, USA, 363--372. https://doi.org/10.1145/1993636.1993686Google ScholarDigital Library
- Michael Elkin. 2004. Unconditional Lower Bounds on the Time-Approximation Tradeoffs for the Distributed Minimum Spanning Tree Problem. In Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing (Chicago, IL, USA) (STOC '04). Association for Computing Machinery, New York, NY, USA, 331--340. https://doi.org/10.1145/1007352.1007407Google ScholarDigital Library
- Michael Feldmann, Kristian Hinnenthal, and Christian Scheideler. 2020. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs. In 24th International Conference on Principles of Distributed Systems, OPODIS 2020 (LIPIcs, Vol. 184). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 31:1--31:16. https: //doi.org/10.4230/LIPIcs.OPODIS.2020.31Google Scholar
- Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, and Mingquan Ye. 2021. Minor Sparsifiers and the Distributed Laplacian Paradigm. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE, 989--999. https://doi.org/10.1109/FOCS52979.2021.00099Google Scholar
- Mohsen Ghaffari and Bernhard Haeupler. 2016. Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Robert Krauthgamer (Ed.). SIAM, 202--219. https://doi.org/10.1137/1. 9781611974331.ch16Google ScholarCross Ref
- Mohsen Ghaffari, Bernhard Haeupler, and Harald Räcke. 2021. Hop-Constrained Expander Decompositions, Oblivious Routing, and Universally-Optimal Distributed Algorithms. arXiv preprint (2021).Google Scholar
- Thorsten Götte, Kristian Hinnenthal, Christian Scheideler, and JulianWerthmann. 2021. Time-Optimal Construction of Overlay Networks. In PODC '21: ACM Symposium on Principles of Distributed Computing. ACM, 457--468. https://doi. org/10.1145/3465084.3467932Google Scholar
- Bernhard Haeupler, David Wajc, and Goran Zuzic. 2021. Universally-optimal distributed algorithms for known topologies. In STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21--25, 2021, Samir Khuller and Virginia Vassilevska Williams (Eds.). ACM, 1166--1179. https://doi.org/10.1145/3406325.3451081Google ScholarDigital Library
- Udit Narayana Kar and Debarshi Kumar Sanyal. 2018. An overview of deviceto- device communication in cellular networks. ICT Express 4, 4 (2018), 203--208. https://doi.org/10.1016/j.icte.2017.08.002Google ScholarCross Ref
- Fabian Kuhn and Philipp Schneider. 2020. Computing Shortest Paths and Diameter in the Hybrid Network Model. In Proceedings of the 39th Symposium on Principles of Distributed Computing (PODC '20). Association for Computing Machinery, 109--118. https://doi.org/10.1145/3382734.3405719Google ScholarDigital Library
- Fabian Kuhn and Philipp Schneider. 2022. Routing Schemes and Distance Oracles in the Hybrid Model. arXiv:2202.06624 [cs.DC]Google Scholar
- D. Peleg and V. Rubinovich. 1999. A near-tight lower bound on the time complexity of distributed MST construction. In 40th Annual Symposium on Foundations of Computer Science. 253--261. https://doi.org/10.1109/SFFCS.1999.814597Google Scholar
- Daniel A. Spielman and Shang-Hua Teng. 2014. Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems. SIAM J. Matrix Anal. Appl. 35, 3 (2014), 835--885. https://doi.org/10.1137/ 090771430Google ScholarDigital Library
- GuohuiWang, David G. Andersen, Michael Kaminsky, Konstantina Papagiannaki, T.S. Eugene Ng, Michael Kozuch, and Michael Ryan. 2010. C-Through: Part-Time Optics in Data Centers. In Proceedings of the ACM SIGCOMM 2010 Conference (SIGCOMM '10). Association for Computing Machinery, 327--338. https://doi. org/10.1145/1851182.1851222Google Scholar
Index Terms
- Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver
Recommendations
Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts
AbstractIn this paper, we refine the (almost) existentially optimal distributed Laplacian solver of Forster, Goranci, Liu, Peng, Sun, and Ye (FOCS ‘21) into an (almost) universally optimal distributed Laplacian solver. Specifically, when the topology is ...
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingOver the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially ...
An optimal distributed (Δ+1)-coloring algorithm?
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingVertex coloring is one of the classic symmetry breaking problems studied in distributed computing. In this paper we present a new algorithm for (Δ+1)-list coloring in the randomized LOCAL model running in O(log∗n + Detd(poly logn)) time, where Detd(n′) ...
Comments