Name
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 regular mesh graphs as well as arbitrary structured and topical graphs such as small-world and scale-free structures. We show how different algorithmic variations can be used to best effect depending upon the cluster structure of the graph being labelled and consider how features of the GPU architectures and host CPUs can be combined to best effect into a cluster component labelling algorithm for use in high performance simulations. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.parco.2010.07.002 | Parallel Computing |
Keywords | DocType | Volume |
data-parallel algorithmic variation,component label,cuda,cluster component,data-parallel,gpu architecture,best effect,general graph,topical graph,mesh,graph,cluster structure,cuda gpu programming language,graph component labelling,parallel graph component,gpu,regular mesh graph,gpu programming,scale free | Journal | 36 |
Issue | ISSN | Citations |
12 | Parallel Computing | 43 |
PageRank | References | Authors |
2.23 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. A. Hawick | 1 | 293 | 66.26 |
| A. Leist | 2 | 43 | 2.23 |
| D. P. Playne | 3 | 75 | 6.13 |