Notice

This is not the latest version of this item. The latest version can be found at:https://dspace.mit.edu/handle/1721.1/135485.2

Show simple item record

dc.contributor.authorHong, Changwan
dc.contributor.authorDhulipala, Laxman
dc.contributor.authorShun, Julian
dc.date.accessioned2021-10-27T20:23:39Z
dc.date.available2021-10-27T20:23:39Z
dc.date.issued2020
dc.identifier.urihttps://hdl.handle.net/1721.1/135485
dc.description.abstract© 2020 Association for Computing Machinery. Connected components and spanning forest are fundamental graphalgorithms due to their use in many important applications, suchas graph clustering and image segmentation. GPUs are an idealplatform for graph algorithms due to their high peak performanceand memory bandwidth. While there exist several GPU connectivity algorithms in the literature, many design choices have notyet been explored. In this paper, we explore various design choicesin GPU connectivity algorithms, including sampling, linking, andtree compression, for both the static as well as the incrementalsetting. Our various design choices lead to over 300 new GPU implementations of connectivity, many of which outperform state-ofthe-art. We present an experimental evaluation, and show that weachieve an average speedup of 2.47x speedup over existing static algorithms. In the incremental setting, we achieve a throughput of upto 48.23 billion edges per second. Compared to state-of-the-art CPUimplementations on a 72-core machine, we achieve a speedup of8.26 14.51x for static connectivity and 1.85 13.36x for incrementalconnectivity using a Tesla V100 GPU.
dc.language.isoen
dc.publisherACM
dc.relation.isversionof10.1145/3410463.3414657
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.sourcearXiv
dc.titleExploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
dc.typeArticle
dc.relation.journalParallel Architectures and Compilation Techniques - Conference Proceedings, PACT
dc.eprint.versionAuthor's final manuscript
dc.type.urihttp://purl.org/eprint/type/ConferencePaper
eprint.statushttp://purl.org/eprint/status/NonPeerReviewed
dc.date.updated2021-04-08T14:43:18Z
dspace.orderedauthorsHong, C; Dhulipala, L; Shun, J
dspace.date.submission2021-04-08T14:43:19Z
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusAuthority Work and Publication Information Needed


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

VersionItemDateSummary

*Selected version