Title:
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
| dc.contributor.author | Bader, David A. | |
| dc.contributor.author | Madduri, Kamesh | |
| dc.date.accessioned | 2007-05-21T21:43:52Z | |
| dc.date.available | 2007-05-21T21:43:52Z | |
| dc.date.issued | 2006-02-26 | |
| dc.description.abstract | Graph abstractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence in recent years for applications involving large-scale networks. In this paper, we present fast parallel implementations of three fundamental graph theory problems, Breadth-First Search, st-connectivity and shortest paths for unweighted graphs, on multithreaded architectures such as the Cray MTA-2. The architectural features of the MTA-2 aid the design of simple, scalable and high-performance graph algorithms. We test our implementations on large scale-free and sparse random graph instances, and report impressive results, both for algorithm execution time and parallel performance. For instance, Breadth-First Search on a scale-free graph of 200 million vertices and 1 billion edges takes less than 5 seconds on a 40-processor MTA-2 system with an absolute speedup of close to 30. This is a significant result in parallel computing, as prior implementations of parallel graph algorithms report very limited or no speedup on irregular and sparse graphs, when compared to the best sequential implementation. | en |
| dc.identifier.uri | http://hdl.handle.net/1853/14426 | |
| dc.language.iso | en_US | en |
| dc.publisher | Georgia Institute of Technology | en |
| dc.relation.ispartofseries | CSE Technical Reports; GT-CSE-06-12 | en |
| dc.subject | Breadth-first | en |
| dc.subject | Graph abstractions | en |
| dc.subject | Multithreaded algorithms | en |
| dc.subject | Parallel algorithms | en |
| dc.title | Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2 | en |
| dc.type | Text | |
| dc.type.genre | Technical Report | |
| dspace.entity.type | Publication | |
| local.contributor.corporatename | College of Computing | |
| local.contributor.corporatename | School of Computational Science and Engineering | |
| local.relation.ispartofseries | College of Computing Technical Report Series | |
| local.relation.ispartofseries | School of Computational Science and Engineering Technical Report Series | |
| relation.isOrgUnitOfPublication | c8892b3c-8db6-4b7b-a33a-1b67f7db2021 | |
| relation.isOrgUnitOfPublication | 01ab2ef1-c6da-49c9-be98-fbd1d840d2b1 | |
| relation.isSeriesOfPublication | 35c9e8fc-dd67-4201-b1d5-016381ef65b8 | |
| relation.isSeriesOfPublication | 5a01f926-96af-453d-a75b-abc3e0f0abb3 |