A comparative study of parallel algorithms for the girth problem

Authors:
Michael J. Dinneen;Masoud Khosravani;Kuai Wei
Affiliations:
University of Auckland, Auckland, New Zealand;University of Auckland, Auckland, New Zealand;University of Auckland, Auckland, New Zealand
Venue:
AusPDC '12 Proceedings of the Tenth Australasian Symposium on Parallel and Distributed Computing - Volume 127
Year:
2012

Citing 12
Cited 0

Parallel graph algorithms

ACM Computing Surveys (CSUR)
Parallel depth first search. Part I. implementation

International Journal of Parallel Programming
Programming parallel algorithms

Communications of the ACM
Efficient parallel algorithms for some graph problems

Communications of the ACM
All-pairs shortest-paths for large graphs on the GPU

Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Efficient approximation algorithms for shortest cycles in undirected graphs

Information Processing Letters
Accelerating large graph algorithms on the GPU using CUDA

HiPC'07 Proceedings of the 14th international conference on High performance computing
A faster algorithm for computing the girth of planar and bounded genus graphs

ACM Transactions on Algorithms (TALG)
Parallel graph component labelling with GPUs and CUDA

Parallel Computing
On the girth of voltage graph lifts

European Journal of Combinatorics
Regular and irregular progressive edge-growth tanner graphs

IEEE Transactions on Information Theory
Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than 12

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce efficient parallel algorithms for finding the girth in a graph or digraph, where girth is the length of a shortest cycle. We empirically compare our algorithms by using two common APIs for parallel programming in C++, which are OpenMP for multiple CPUs and CUDA for multi-core GPUs. We conclude that both hardware platforms and programming models have their benefits.