Peter Robinson
ABSTRACT
We show that any one-round algorithm that computes a minimum spanning tree (MST) in the unicast congested clique must use a link bandwidth of Ω(log3 n) bits in the worst case. Consequently, computing an MST under the standard assumption of O(log n)-size messages requires at least 2 rounds. This is the first round complexity lower bound in the unicast congested clique for a problem where the output size is small, i.e., O(n log n) bits. Our lower bound holds as long as every edge of the MST is output by an incident node. To the best of our knowledge, all prior lower bounds for the unicast congested clique either considered problems with large output sizes (e.g., subgraph enumeration) or required every node to learn the entire output.
- Kook Jin Ahn, Sudipto Guha, and Andrew McGregor. 2012. Analyzing graph structure via linear measurements. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms. SIAM, 459--467.Google Scholar
Cross Ref
- Baruch Awerbuch, Oded Goldreich, David Peleg, and Ronen Vainish. 1990. A Trade-Off between Information and Communication in Broadcast Protocols. J. ACM 37, 2 (1990), 238--256. Google ScholarDigital Library
- Andrew Drucker, Fabian Kuhn, and Rotem Oshman. 2014. On the power of the congested clique model. In ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15--18, 2014. 367--376.Google ScholarDigital Library
- Mohsen Ghaffari and Krzysztof Nowicki. 2018. Congested Clique Algorithms for the Minimum Cut Problem. In PODC 2018. 357--366.Google Scholar
- Mohsen Ghaffari and Merav Parter. 2016. MST in log-star rounds of congested clique. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing. 19--28.Google ScholarDigital Library
- James W Hegeman, Gopal Pandurangan, Sriram V Pemmaraju, Vivek B Sardeshmukh, and Michele Scquizzato. 2015. Toward optimal bounds in the congested clique: Graph connectivity and MST. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. 91--100.Google ScholarDigital Library
- Taisuke Izumi and François Le Gall. 2017. Triangle Finding and Listing in CONGEST Networks. In PODC 2017. 381--389.Google Scholar
- Tomasz Jurdzinski and Krzysztof Nowicki. 2017. Brief announcement: on connectivity in the broadcast congested clique. In DISC 2017. Schloss Dagstuhl-Leibniz-Zentrum f. Informatik.Google Scholar
- Tomasz Jurdziński and Krzysztof Nowicki. 2018. MST in O(1) rounds of congested clique. In SODA 2018. SIAM, 2620--2632.Google ScholarCross Ref
- Valerie King, Shay Kutten, and Mikkel Thorup. 2015. Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication. In PODC 2015, Chryssis Georgiou and Paul G. Spirakis (Eds.). ACM, 71--80.Google ScholarDigital Library
- Christoph Lenzen. 2013. Optimal deterministic routing and sorting on the congested clique. In PODC 2013. 42--50.Google ScholarDigital Library
- Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, and David Peleg. 2003. MST construction in O (log log n) communication rounds. In Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures. 94--100.Google ScholarDigital Library
- Pedro Montealegre, Sebastian Perez-Salazar, Ivan Rapaport, and Ioan Todinca. 2020. Graph reconstruction in the congested clique. J. Comput. Syst. Sci. 113 (2020), 1--17. Google ScholarCross Ref
- Krzysztof Nowicki. 2021. A deterministic algorithm for the MST problem in constant rounds of congested clique. In STOC 2021, Samir Khuller and Virginia Vassilevska Williams (Eds.). ACM, 1154--1165.Google ScholarDigital Library
- Shreyas Pai, Gopal Pandurangan, Sriram V. Pemmaraju, and Peter Robinson. 2021. Can We Break Symmetry with o(m) Communication?. In PODC 2021: ACM Symposium on Principles of Distributed Computing. ACM, 247--257.Google ScholarDigital Library
- Shreyas Pai and Sriram V Pemmaraju. 2020. Connectivity Lower Bounds in Broadcast Congested Clique. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science.Google Scholar
- Gopal Pandurangan, Peter Robinson, and Michele Scquizzato. 2021. On the distributed complexity of large-scale graph computations. ACM Transactions on Parallel Computing (TOPC) 8, 2 (2021), 1--28.Google ScholarDigital Library
- Peter Robinson. 2021. Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, January 10 -- 13, 2021. SIAM, 2105--2120.Google ScholarCross Ref
- Huacheng Yu. 2021. Tight Distributed Sketching Lower Bound for Connectivity. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 -- 13, 2021. 1856--1873.Google ScholarCross Ref
Index Terms
- Brief Announcement: What Can We Compute in a Single Round of the Congested Clique?
Recommendations
MST in O(1) rounds of congested clique
SODA '18: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete AlgorithmsWe present a distributed randomized algorithm finding Minimum Spanning Tree (MST) of a given graph in O(1) rounds, with high probability, in the congested clique model.
The input graph in the congested clique model is a graph of n nodes, where each node ...
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST
PODC '15: Proceedings of the 2015 ACM Symposium on Principles of Distributed ComputingWe study two fundamental graph problems, Graph Connectivity (GC) and Minimum Spanning Tree (MST), in the well-studied Congested Clique model, and present several new bounds on the time and message complexities of randomized algorithms for these ...
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 ...
Comments