Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
On Identifying Strongly Connected Components in Parallel
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
BDD-Based Debugging Of Design Using Language Containment and Fair CTL
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Finding strongly connected components in distributed graphs
Journal of Parallel and Distributed Computing
Group formation in large social networks: membership, growth, and evolution
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Structure and evolution of online social networks
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Improved Distributed Algorithms for SCC Decomposition
Electronic Notes in Theoretical Computer Science (ENTCS)
Growth of the flickr social network
Proceedings of the first workshop on Online social networks
What is Twitter, a social network or a news media?
Proceedings of the 19th international conference on World wide web
DBpedia: a nucleus for a web of open data
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Automatic discovery of subgoals in reinforcement learning using strongly connected components
ICONIP'08 Proceedings of the 15th international conference on Advances in neuro-information processing - Volume Part I
Computing Strongly Connected Components in Parallel on CUDA
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
Zhishi.me: weaving chinese linking open data
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part II
Efficient Parallel Graph Exploration on Multi-Core CPU and GPU
PACT '11 Proceedings of the 2011 International Conference on Parallel Architectures and Compilation Techniques
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Defining and evaluating network communities based on ground-truth
Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics
Direction-optimizing breadth-first search
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Large-scale energy-efficient graph traversal: a path to efficient data-intensive supercomputing
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
| Hi-index | 0.00 |
Detecting strongly connected components (SCCs) in a directed graph is a fundamental graph analysis algorithm that is used in many science and engineering domains. Traditional approaches in parallel SCC detection, however, show limited performance and poor scaling behavior when applied to large real-world graph instances. In this paper, we investigate the shortcomings of the conventional approach and propose a series of extensions that consider the fundamental properties of real-world graphs, e.g. the small-world property. Our scalable implementation offers excellent performance on diverse, small-world graphs resulting in a 5.01x to 29.41x parallel speedup over the optimal sequential algorithm with 16 cores and 32 hardware threads.