Fast minimum spanning tree for large graphs on the GPU

Graphics Processor Units are used for many general purpose processing due to high compute power available on them. Regular, data-parallel algorithms map well to the SIMD architecture of current GPU. Irregular algorithms on discrete structures like graphs are harder to map to them. Efficient data-mapping primitives can play crucial role in mapping such algorithms onto the GPU. In this paper, we present a minimum spanning tree algorithm on Nvidia GPUs under CUDA, as a recursive formulation of Bor

• Type: Journal
• Year: 2009
• Where: EGH
• Authors: Vibhav Vineet, Pawan Harish, Suryakant Patidar, P. J. Narayanan
• Keywords: Algorithm, Computer Graphics, Efficient Data-mapping Primitives, EGH 2009, Tesla S1070 GPU