Parallel Implementation of Algorithms for Finding Connected Components in Graphs (1997)
| Citations: | 22 - 1 self |
BibTeX
@MISC{Hsu97parallelimplementation,
author = {Tsan-Sheng Hsu and Vijaya Ramachandran and Nathaniel Dean},
title = {Parallel Implementation of Algorithms for Finding Connected Components in Graphs },
year = {1997}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we describe our implementation of several parallel graph algorithms for finding connected components. Our implementation, with virtual processing, is on a 16,384-processor MasPar MP-1 using the language MPL. We present extensive test data on our code. In our previous projects [21, 22, 23], we reported the implementation of an extensible parallel graph algorithms library. We developed general implementation and fine-tuning techniques without expending too much effort on optimizing each individual routine. We also handled the issue of implementing virtual processing. In this paper, we describe several algorithms and fine-tuning techniques that we developed for the problem of finding connected components in parallel; many of the fine-tuning techniques are of general interest, and should be applicable to code for other problems. We present data on the execution time and memory usage of our various implementations.
