Fast and memory-efficient minimum spanning tree on the GPU Online publication date: Fri, 27-Dec-2013
by Scott Rostrup; Shweta Srivastava; Kishore Singhal
International Journal of Computational Science and Engineering (IJCSE), Vol. 8, No. 1, 2013
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.
Online publication date: Fri, 27-Dec-2013
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com