K. A. Hawick
Parallel graph component labelling with GPUs and CUDA
Hawick, K. A.; Leist, A.; Playne, D. P.
D. P. Playne
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. © 2010 Elsevier B.V. All rights reserved.
|Journal Article Type||Article|
|Publication Date||Dec 1, 2010|
|Peer Reviewed||Peer Reviewed|
|APA6 Citation||Hawick, K. A., Leist, A., & Playne, D. P. (2010). Parallel graph component labelling with GPUs and CUDA. Parallel Computing, 36(12), 655-678. doi:10.1016/j.parco.2010.07.002|
|Keywords||REF 2014 submission!|
You might also like
Computational methods for finding long simple cycles in complex networks
Hypercubic storage layout and transforms in arbitrary dimensions using GPUs and CUDA
Regular lattice and small-world spin model simulations using CUDA and GPUs
Exploiting graphical processing units for data-parallel scientific applications