Authors: Scott Rostrup; Shweta Srivastava; Kishore Singhal
Addresses: Synopsys Inc., 700 East Middlefield Rd., Mountain View, CA, USA ' Synopsys Inc., 700 East Middlefield Rd., Mountain View, CA, USA ' Synopsys Inc., 700 East Middlefield Rd., Mountain View, CA, USA
Abstract: The GPU is an efficient accelerator for regular data-parallel workloads, but GPU acceleration is more difficult for graph algorithms and other applications with irregular memory access patterns and large memory footprints. The minimum spanning tree (MST) problem arises in a variety of applications and its solution exemplifies the difficulties of mapping irregular algorithms to the GPU. In this paper, we present a memory-efficient parallel algorithm for finding the minimum spanning tree of very large graphs by introducing a data-parallel implementation of Kruskal's algorithm. We test scalability and performance on random and real-world graphs with up to 25 million vertices and 240 million edges on an Nvidia Tesla T10 GPU with 4GB of memory. Our method can process graphs 4X larger and up to 10X faster than was possible with the recently published implementation of Boruvka's MST algorithm for the GPU. We also demonstrate the performance advantage of the proposed method against the multi-core filter-Kruskal's MST algorithm on a dual quad-core CPU server with Nehalem X5550 processors.
Keywords: minimum spanning tree; MST; graphics processing unit; GPU; graph algorithms; parallel algorithms.
International Journal of Computational Science and Engineering, 2013 Vol.8 No.1, pp.21 - 33
Received: 16 Dec 2011
Accepted: 13 Apr 2012
Published online: 14 Feb 2013 *