Brief Announcement: Massively Parallel Ruling Set Made Deterministic
Pages 523 - 526
Abstract
We study the deterministic complexity of the 2-Ruling Set problem in the model of Massively Parallel Computation (MPC) with linear and strongly sublinear local memory.
Linear MPC: We present a constant-round deterministic algorithm for the 2-Ruling Set problem that matches the randomized round complexity recently settled by Cambus, Kuhn, Pai, and Uitto [DISC'23], and improves upon the deterministic O(log log n)-round algorithm by Pai and Pemmaraju [PODC'22]. Our main ingredient is a simpler analysis of CKPU's algorithm based solely on bounded independence, which makes its efficient derandomization possible.
Sublinear MPC: We present a deterministic algorithm that computes a 2-Ruling Set in [EQUATION] rounds deterministically. Notably, this is the first deterministic ruling set algorithm with sublogarithmic round complexity, improving on the O(log Δ+log log* n)-round complexity that stems from the deterministic MIS algorithm of Czumaj, Davies, and Parter [TALG'21]. Our result is based on a simple and fast randomness-efficient construction that achieves the same sparsification as that of the randomized [EQUATION]-round LOCAL algorithm by Kothapalli and Pemmaraju [FSTTCS'12].
References
[1]
Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev. 2013. Parallel algorithms for geometric graph problems. Proceedings of the forty-sixth annual ACM symposium on Theory of computing (2013). https://api.semanticscholar.org/CorpusID:316401
[2]
Alkida Balliu, Sebastian Brandt, Juho Hirvonen, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. 2019. Lower Bounds for Maximal Matchings and Maximal Independent Sets. 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) (2019), 481--497. https://api.semanticscholar.org/CorpusID:57721262
[3]
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. 2022. Distributed Delta-coloring plays hide-and-seek. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Rome, Italy) (STOC 2022). Association for Computing Machinery, New York, NY, USA, 464--477.
[4]
Alkida Balliu, Sebastian Brandt, and Dennis Olivetti. 2022. Distributed Lower Bounds for Ruling Sets. SIAM J. Comput. (2022), 70--115.
[5]
Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider. 2016. The Locality of Distributed Symmetry Breaking. J. ACM 63, 3, Article 20 (6 2016), 45 pages.
[6]
Paul Beame, Paraschos Koutris, and Dan Suciu. 2013. Communication steps for parallel query processing. Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems (2013). https://api.semanticscholar.org/CorpusID:11086753
[7]
Andrew Berns, James Hegeman, and Sriram V. Pemmaraju. 2012. Super-Fast Distributed Algorithms for Metric Facility Location. ArXiv abs/1308.2473 (2012). https://api.semanticscholar.org/CorpusID:124685
[8]
Tushar Bisht, Kishore Kothapalli, and Sriram V. Pemmaraju. 2014. Brief announcement: Super-fast t-ruling sets. Proceedings of the 2014 ACM symposium on Principles of distributed computing (2014). https://api.semanticscholar.org/CorpusID:12210091
[9]
Mélanie Cambus, Fabian Kuhn, Shreyas Pai, and Jara Uitto. 2023. Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem. In 37th International Symposium on Distributed Computing (DISC 2023) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 281), Rotem Oshman (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 11:1--11:12.
[10]
Keren Censor-Hillel, Merav Parter, and Gregory Schwartzman. 2020. Derandomizing local distributed algorithms under bandwidth restrictions. Distributed Computing 33, 3 (01 Jun 2020), 349--366.
[11]
Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, and Yufan Zheng. 2019. The Complexity of (Delta+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Toronto ON, Canada) (PODC '19). Association for Computing Machinery, New York, NY, USA, 471--480.
[12]
Sam Coy and Artur Czumaj. 2022. Deterministic Massively Parallel Connectivity. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Rome, Italy) (STOC 2022). Association for Computing Machinery, New York, NY, USA, 162--175.
[13]
Artur Czumaj, Peter Davies, and Merav Parter. 2020. Simple, Deterministic, Constant-Round Coloring in the Congested Clique. In Proceedings of the 39th Symposium on Principles of Distributed Computing (Virtual Event, Italy) (PODC '20). Association for Computing Machinery, New York, NY, USA, 309--318.
[14]
Artur Czumaj, Peter Davies, and Merav Parter. 2021. Component Stability in Low-Space Massively Parallel Computation. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (Virtual Event, Italy) (PODC'21). Association for Computing Machinery, New York, NY, USA, 481--491.
[15]
Artur Czumaj, Peter Davies, and Merav Parter. 2021. Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space. ACM Trans. Algorithms 17, 2, Article 16 (5 2021), 27 pages.
[16]
Artur Czumaj, Peter Davies, and Merav Parter. 2021. Improved Deterministic (Delta+1) Coloring in Low-Space MPC. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing (Virtual Event, Italy) (PODC'21). Association for Computing Machinery, New York, NY, USA, 469--479.
[17]
Manuela Fischer, Jeff Giliberti, and Christoph Grunau. 2022. Improved Deterministic Connectivity in Massively Parallel Computation. In 36th International Symposium on Distributed Computing (DISC 2022) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 246), Christian Scheideler (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 22:1--22:17.
[18]
Manuela Fischer, Jeff Giliberti, and Christoph Grunau. 2023. Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs. In Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures (Orlando, FL, USA) (SPAA '23). Association for Computing Machinery, New York, NY, USA, 89--100.
[19]
Beat Gfeller and Elias Vicari. 2007. A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs. In ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing. https://api.semanticscholar.org/CorpusID:13473182
[20]
Mohsen Ghaffari. 2016. An Improved Distributed Algorithm for Maximal Independent Set. In Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 270--277. arXiv:https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch20
[21]
Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrović, and Ronitt Rubinfeld. 2018. Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing (Egham, United Kingdom) (PODC '18). Association for Computing Machinery, New York, NY, USA, 129--138.
[22]
Mohsen Ghaffari, Fabian Kuhn, and Jara Uitto. 2019. Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS). 1650--1663.
[23]
Mohsen Ghaffari and Jara Uitto. 2019. Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. In Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 1636--1653.
[24]
Michael T. Goodrich, Nodari Sitchinava, and Qin Zhang. 2011. Sorting, Searching, and Simulation in the MapReduce Framework. In Algorithms and Computation, Takao Asano, Shin-ichi Nakano, Yoshio Okamoto, and Osamu Watanabe (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 374--383.
[25]
James Hegeman, Sriram V. Pemmaraju, and Vivek Sardeshmukh. 2014. Near-Constant-Time Distributed Algorithms on a Congested Clique. In International Symposium on Distributed Computing. https://api.semanticscholar.org/CorpusID:277941
[26]
Howard Karloff, Siddharth Suri, and Sergei Vassilvitskii. 2010. A Model of Computation for MapReduce. In Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 938--948.
[27]
Kishore Kothapalli, Shreyas Pai, and Sriram V. Pemmaraju. 2020. Sample-And-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 182), Nitin Saxena and Sunil Simon (Eds.). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 28:1--28:18.
[28]
Kishore Kothapalli and Sriram Pemmaraju. 2011. Distributed Graph Coloring in a Few Rounds. In Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (San Jose, California, USA) (PODC '11). Association for Computing Machinery, New York, NY, USA, 31--40.
[29]
Kishore Kothapalli and Sriram V. Pemmaraju. 2012. Super-Fast 3-Ruling Sets. In Foundations of Software Technology and Theoretical Computer Science. https://api.semanticscholar.org/CorpusID:16038481
[30]
Fabian Kuhn, Thomas Moscibroda, and Roger Wattenhofer. 2016. Local Computation: Lower and Upper Bounds. J. ACM 63, 2 (2016).
[31]
Michael Luby. 1993. Removing randomness in parallel computation without a processor penalty. J. Comput. System Sci. 47, 2 (1993), 250--286.
[32]
Rajeev Motwani, Joseph (Seffi) Naor, and Moni Naor. 1994. The probabilistic method yields deterministic parallel algorithms. J. Comput. System Sci. 49, 3 (1994), 478--516. 30th IEEE Conference on Foundations of Computer Science.
[33]
Krzysztof Nowicki. 2021. A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, New York, NY, USA, 1154--1165.
[34]
Shreyas Pai and Sriram V. Pemmaraju. 2022. Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets. In Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Salerno, Italy) (PODC'22). Association for Computing Machinery, New York, NY, USA, 366--368.
[35]
Johannes Schneider, Michael Elkin, and Roger Wattenhofer. 2013. Symmetry breaking depending on the chromatic number or the neighborhood growth. 509, C (oct 2013), 40--50.
Index Terms
- Brief Announcement: Massively Parallel Ruling Set Made Deterministic
Recommendations
Deterministic Massively Parallel Symmetry Breaking for Sparse Graphs
SPAA '23: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe consider the problem of designing deterministic graph algorithms for the model of Massively Parallel Computation (MPC) that improve with the sparsity of the input graph, as measured by the standard notion of arboricity. For the problems of maximal ...
Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingIn this paper we present a deterministic O(log log n)-round algorithm for the 2-ruling set problem in the Massively Parallel Computation model with Õ(n) memory; this algorithm also runs in O(log log n) rounds in the Congested Clique model. This is ...
Brief Announcement: A Randomness-efficient Massively Parallel Algorithm for Connectivity
PODC'21: Proceedings of the 2021 ACM Symposium on Principles of Distributed ComputingWe give a randomness-efficient Massively Parallel Computation (MPC) algorithm for deciding whether an undirected graph is connected. For Connectivity on n-vertex, m-edge graphs whose components have diameter at most D = 2o(log n/ log log n), our ...
Comments
Information & Contributors
Information
Published In
June 2024
570 pages
ISBN:9798400706684
DOI:10.1145/3662158
- Chair:
- Ran Gelles,
- Proceedings Chair:
- Dennis Olivetti,
- Program Chair:
- Petr Kuznetsov
This work is licensed under a Creative Commons Attribution-NoDerivs International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 June 2024
Check for updates
Author Tags
Qualifiers
- Short-paper
Conference
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 27Total Downloads
- Downloads (Last 12 months)27
- Downloads (Last 6 weeks)14
Reflects downloads up to 12 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in