Finding strongly connected components in distributed graphs

Authors:
William McLendon III;Bruce Hendrickson;Steven J. Plimpton;Lawrence Rauchwerger
Affiliations:
Sandia National Laboratories, Computational Science Department, Albuquerque, NM 87185, USA;Sandia National Laboratories, Computational Science Department, Albuquerque, NM 87185, USA;Sandia National Laboratories, Computational Science Department, Albuquerque, NM 87185, USA;Department of Computer Science, Texas A&M University, USA
Venue:
Journal of Parallel and Distributed Computing
Year:
2005

Citing 7
Cited 8

An improved parallel algorithm that computes the BFS numbering of a directed graph

Information Processing Letters
Faster optimal parallel prefix sums and list ranking

Information and Computation
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
Improved processor bounds for parallel algorithms for weighted directed graphs

Information Processing Letters
Massively parallel computing using commodity components

Parallel Computing - Parallel computing on clusters of workstations
Parallel algorithms for radiation transport on unstructured grids

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
On Identifying Strongly Connected Components in Parallel

IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing

Finding strongly connected components in parallel using O(log2n) reachability queries

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A parallel preconditioning strategy for efficient transistor-level circuit simulation

Proceedings of the 2009 International Conference on Computer-Aided Design
Parallel algorithms for finding SCCs in implicitly given graphs

FMICS'06/PDMC'06 Proceedings of the 11th international workshop, FMICS 2006 and 5th international workshop, PDMC conference on Formal methods: Applications and technology
Mining large distributed log data in near real time

SLAML '11 Managing Large-scale Systems via the Analysis of System Logs and the Application of Machine Learning Techniques
Reasoning in multi-agent systems with random knowledge distribution

ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
On fast parallel detection of strongly connected components (SCC) in small-world graphs

SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
SCCMulti: an improved parallel strongly connected components algorithm

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
Scalable community detection in massive social networks using MapReduce

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

The traditional, serial, algorithm for finding the strongly connected components in a graph is based on depth first search and has complexity which is linear in the size of the graph. Depth first search is difficult to parallelize, which creates a need for a different parallel algorithm for this problem. We describe the implementation of a recently proposed parallel algorithm that finds strongly connected components in distributed graphs, and discuss how it is used in a radiation transport solver.