# Connected Components on a PRAM in Log Diameter Time

## Author(s): Liu, Sixue; Tarjan, Robert E; Zhong, Peilin

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1hr8j
DC FieldValueLanguage
dc.contributor.authorLiu, Sixue-
dc.contributor.authorTarjan, Robert E-
dc.contributor.authorZhong, Peilin-
dc.date.accessioned2021-10-08T19:48:22Z-
dc.date.available2021-10-08T19:48:22Z-
dc.date.issued2020-07en_US
dc.identifier.citationLiu, Sixue Cliff, Robert E. Tarjan, and Peilin Zhong. "Connected Components on a PRAM in Log Diameter Time." In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures (2020): pp. 359-369. doi:10.1145/3350755.3400249en_US
dc.identifier.urihttps://arxiv.org/pdf/2003.00614v1.pdf-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1hr8j-
dc.description.abstractWe present an O(log d + log logm/n n)-time randomized PRAM algorithm for computing the connected components of an n-vertex, m-edge undirected graph with maximum component diameter d. The algorithm runs on an ARBITRARY CRCW (concurrent-read, concurrent-write with arbitrary write resolution) PRAM using O(m) processors. The time bound holds with good probability. Our algorithm is based on the breakthrough results of Andoni et al. [FOCS'18] and Behnezhad et al. [FOCS'19]. Their algorithms run on the more powerful MPC model and rely on sorting and computing prefix sums in O(1) time, tasks that take Ω(log n / log log n) time on a CRCW PRAM with poly(n) processors. Our simpler algorithm uses limited-collision hashing and does not sort or do prefix sums. It matches the time and space bounds of the algorithm of Behnezhad et al., who improved the time bound of Andoni et al. It is widely believed that the larger private memory per processor and unbounded local computation of the MPC model admit algorithms faster than that on a PRAM. Our result suggests that such additional power might not be necessary, at least for fundamental graph problems like connected components and spanning forest.en_US
dc.format.extent359 - 369en_US
dc.language.isoen_USen_US
dc.relation.ispartofProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architecturesen_US
dc.rightsAuthor's manuscripten_US
dc.titleConnected Components on a PRAM in Log Diameter Timeen_US
dc.typeConference Articleen_US
dc.identifier.doi10.1145/3350755.3400249-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat