Efficient parallel algorithms for a class of graph theoretic problems
SIAM Journal on Computing
Graphical evolution: an introduction to the theory of random graphs
Graphical evolution: an introduction to the theory of random graphs
New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
IEEE Transactions on Computers
An introduction to parallel algorithms
An introduction to parallel algorithms
Finding a smallest augmentation to biconnect a graph
SIAM Journal on Computing
Biconnectivity approximations and graph carvings
Journal of the ACM (JACM)
Efficient parallel algorithms for finding biconnected components of some intersection graphs
CSC '91 Proceedings of the 19th annual conference on Computer Science
Computing connected components on parallel computers
Communications of the ACM
Prefix computations on symmetric multiprocessors
Journal of Parallel and Distributed Computing
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Designing Practical Efficient Algorithms for Symmetric Multiprocessors
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
The Euler Tour Technique and Parallel Rooted Spanning Tree
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Locality behavior of parallel and sequential algorithms for irregular graph problems
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Better speedups using simpler parallel programming for graph connectivity and biconnectivity
Proceedings of the 2012 International Workshop on Programming Models and Applications for Multicores and Manycores
Techniques for designing efficient parallel graph algorithms for SMPs and multicore processors
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connectivity, spanning tree, and tree computations. Previous experimental studies of these primitives demonstrate reasonable parallel speedups. However, when these algorithms are used as subroutines to solve higher-level problems, there are two factors that hinder fast parallel implementations. One is parallel overhead, i.e., the large constant factors hidden in the asymptotic bounds; the other is the discrepancy among the data structures used in the primitives that brings non-negligible conversion cost. We present various optimization techniques and a new parallel algorithm that significantly improve the performance of finding biconnected components of a graph on symmetric multiprocessors (SMPs). Finding biconnected components has application in fault-tolerant network design, and is also used in graph planarity testing. Our parallel implementation achieves speedups up to 4 using 12 processors on a Sun E4500 for large, sparse graphs, and the source code is freely-available at our web site http://www.ece.unm.edu/~dbader.