2010
DOI: 10.1016/j.parco.2010.07.002
|View full text |Cite
|
Sign up to set email alerts
|

Parallel graph component labelling with GPUs and CUDA

Abstract: Graph component labelling, which is a subset of the general graph colouring problem, is a computationally expensive operation that is of importance in many applications and simulations. A number of data-parallel algorithmic variations to the component labelling problem are possible and we explore their use with general purpose graphical processing units (GPGPUs) and with the CUDA GPU programming language. We discuss implementation issues and performance results on GPUs using CUDA. We present results for regula… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
106
0
5

Year Published

2010
2010
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 146 publications
(111 citation statements)
references
References 35 publications
0
106
0
5
Order By: Relevance
“…Two cells are said to be part of the same cluster if they are first neighbors. The Directional Propagation Labelling algorithm (DPL) for GPUs [22] was employed to determine if there was a percolating cluster connecting the lower and upper borders of the cube. It was necessary to implement this algorithm for GPUs because the systems were very large ((800×800×800) cells for L = 64) and the procedure becomes very time demanding.…”
Section: Powders and Grains 2017mentioning
confidence: 99%
“…Two cells are said to be part of the same cluster if they are first neighbors. The Directional Propagation Labelling algorithm (DPL) for GPUs [22] was employed to determine if there was a percolating cluster connecting the lower and upper borders of the cube. It was necessary to implement this algorithm for GPUs because the systems were very large ((800×800×800) cells for L = 64) and the procedure becomes very time demanding.…”
Section: Powders and Grains 2017mentioning
confidence: 99%
“…However, such methods based on this approach use sequential computations. Several methods have been proposed to exploit parallel computing architectures [5,9]. However, these methods were applied to relatively small images.…”
Section: Related Workmentioning
confidence: 99%
“…GPUs have been used for various finite-difference PDE integrator codes with good results [4][5][6][7][8][9]. In Ref.…”
Section: Introductionmentioning
confidence: 99%
“…In Ref. [9], the authors use CUDA to simulate the multi-dimensional complex Ginzburg-Landau equation (a generalization of the NLSE), but speedups versus CPU codes were not reported. All these studies indicate that a GPU treatment of the NLSE would be beneficial.…”
Section: Introductionmentioning
confidence: 99%