LIPIcs.DISC.2023.37.pdf
- Filesize: 0.67 MB
- 7 pages
Document
Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations
Authors
-
Part of:
Volume:
37th International Symposium on Distributed Computing (DISC 2023)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Distributed Computing (DISC) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-10-05
File
Document Identifiers
Acknowledgements
The authors thank Sriram Pemmaraju and Meena Mahajan for their helpful discussions. We thank anonymous reviewers for their valuable comments and pointers to some critical references.
Cite As Get BibTex
Michael Chen, A. Pavan, and N. V. Vinodchandran. Brief Announcement: Relations Between Space-Bounded and Adaptive Massively Parallel Computations. In 37th International Symposium on Distributed Computing (DISC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 281, pp. 37:1-37:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.DISC.2023.37
Abstract
In this work, we study the class of problems solvable by (deterministic) Adaptive Massively Parallel Computations in constant rounds from a computational complexity theory perspective. A language L is in the class AMPC⁰ if, for every ε > 0, there is a deterministic AMPC algorithm running in constant rounds with a polynomial number of processors, where the local memory of each machine s = O(N^ε). We prove that the space-bounded complexity class ReachUL is a proper subclass of AMPC⁰. The complexity class ReachUL lies between the well-known space-bounded complexity classes Deterministic Logspace (DLOG) and Nondeterministic Logspace (NLOG). In contrast, we establish that it is unlikely that PSPACE admits AMPC algorithms, even with polynomially many rounds. We also establish that showing PSPACE is a subclass of nonuniform-AMPC with polynomially many rounds leads to a significant separation result in complexity theory, namely PSPACE is a proper subclass of EXP^{Σ₂^{𝖯}}.
Subject Classification
ACM Subject Classification
- Computing methodologies → Massively parallel algorithms
- Theory of computation → Complexity classes
Keywords
- Massively Parallel Computation
- AMPC
- Complexity Classes
- LogSpace
- NL
- PSPACE
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- E. Allender and K.-J. Lange. RUSPACE(log n) ⊆ DSPACE(log²n/log log n). Theory of Computing Systems, 31(5):539-550, October 1998. URL: https://doi.org/10.1007/s002240000102.
-
Alexandr Andoni, Zhao Song, Clifford Stein, Zhengyu Wang, and Peilin Zhong. Parallel graph connectivity in log diameter rounds. In 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018.
-
Alexandr Andoni, Clifford Stein, and Peilin Zhong. Log Diameter Rounds Algorithms for 2-Vertex and 2-Edge Connectivity. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1-14:16, 2019.
- Sepehr Assadi, Xiaorui Sun, and Omri Weinstein. Massively parallel algorithms for finding well-connected components in sparse graphs. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC '19, 2019. URL: https://doi.org/10.1145/3293611.3331596.
- Paul Beame, Paraschos Koutris, and Dan Suciu. Communication steps for parallel query processing. J. ACM, 64(6), October 2017. URL: https://doi.org/10.1145/3125644.
- Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, and Vahab Mirrokni. Near-optimal massively parallel graph connectivity. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 1615-1636, 2019. URL: https://doi.org/10.1109/FOCS.2019.00095.
- Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Lacki, Vahab Mirrokni, and Warren Schudy. Massively parallel computation via remote memory access. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '19, pages 59-68, New York, NY, USA, 2019. Association for Computing Machinery. URL: https://doi.org/10.1145/3323165.3323208.
-
Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, and Peter Rossmanith. Unambiguity and fewness for logarithmic space. In L. Budach, editor, Fundamentals of Computation Theory, pages 168-179, Berlin, Heidelberg, 1991. Springer Berlin Heidelberg.
- Moses Charikar, Weiyun Ma, and Li-Yang Tan. Unconditional lower bounds for adaptive massively parallel computation. In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '20, pages 141-151, New York, NY, USA, 2020. Association for Computing Machinery. URL: https://doi.org/10.1145/3350755.3400230.
-
Benjamin Fish, Jeremy Kun, Ádám D. Lelkes, Lev Reyzin, and György Turán. On the computational complexity of mapreduce. In Yoram Moses, editor, Distributed Computing, pages 1-15, Berlin, Heidelberg, 2015. Springer Berlin Heidelberg.
- Brady Garvin, Derrick Stolee, Raghunath Tewari, and N. V. Vinodchandran. Reachfewl = reachul. computational complexity, 23(1):85-98, March 2014. URL: https://doi.org/10.1007/s00037-012-0050-8.
- MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh, and Hsin-Hao Su. Adaptive Massively Parallel Constant-Round Tree Contraction. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), Leibniz International Proceedings in Informatics (LIPIcs), pages 83:1-83:23, 2022. URL: https://doi.org/10.4230/LIPIcs.ITCS.2022.83.
-
Klaus-Jörn Lange. An unambiguous class possessing a complete set. In Rüdiger Reischuk and Michel Morvan, editors, STACS 97, pages 339-350, Berlin, Heidelberg, 1997. Springer Berlin Heidelberg.
-
Peter Bro Miltersen, N. V. Vinodchandran, and Osamu Watanabe. Super-polynomial versus half-exponential circuit size in the exponential hierarchy. In Takao Asano, Hiroshi Imai, D. T. Lee, Shin-Ichi Nakano, and Takeshi Tokuyama, editors, Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Proceedings, Lecture Notes in Computer Science, 1999.
- Danupon Nanongkai and Michele Scquizzato. Equivalence classes and conditional hardness in massively parallel computations. Distributed Computing, 35(2):165-183, April 2022. URL: https://doi.org/10.1007/s00446-021-00418-2.
- Tim Roughgarden, Sergei Vassilvitskii, and Joshua R. Wang. Shuffles and circuits (on lower bounds for modern parallel computation). J. ACM, 65(6), November 2018. URL: https://doi.org/10.1145/3232536.