SCCMulti

Daniel Tomkins, Timmie Smith, Nancy M. Amato, Lawrence Rauchwerger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Tarjan's famous linear time, sequential algorithm for finding the strongly connected components (SCCs) of a graph relies on depth first search, which is inherently sequential. Deterministic parallel algorithms solve this problem in logarithmic time using matrix multiplication techniques, but matrix multiplication requires a large amount of total work. Randomized algorithms based on reachability - the ability to get from one vertex to another along a directed path - greatly improve the work bound in the average case. However, these algorithms do not always perform well; for instance, Divide-and-Conquer Strong Components (DCSC), a scalable, divide-and-conquer algorithm, has good expected theoretical limits, but can perform very poorly on graphs for which the maximum reachability of any vertex is small. A related algorithm, MultiPivot, gives very high probability guarantees on the total amount of work for all graphs, but this improvement introduces an overhead that increases the average running time. This work introduces SCCMulti, a multi-pivot improvement of DCSC that offers the same consistency as MultiPivot without the time overhead. We provide experimental results demonstrating SCCMulti's scalability; these results also show that SCCMulti is more consistent than DCSC and is always faster than MultiPivot.
Original languageEnglish (US)
Title of host publicationProceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming - PPoPP '14
PublisherAssociation for Computing Machinery (ACM)
Pages393-394
Number of pages2
ISBN (Print)9781450326568
DOIs
StatePublished - 2014
Externally publishedYes

Fingerprint Dive into the research topics of 'SCCMulti'. Together they form a unique fingerprint.

Cite this