Optimizing Breadth-First Search at Scale Using Hardware-Accelerated Space Consistency

Graph traversal is a critical building block in many algorithms. Traversing a large graph using breadth-first search, although conceptually simple, is time-consuming in distributed-memory environments due to the amount of exchanged data. In this work, we present both an efficient algorithmic approac...

Full description

Bibliographic Details

Published in:	Proceedings - International Conference on High Performance Computing pp. 23 - 33
Main Author:	Ibrahim, Khaled
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2019
Subjects:	Bandwidth Benchmark testing Breadth-first Search Computational modeling Distributed Memory Programming Models Hardware Hardware Accelerated Collective Programming Runtime Voting
ISSN:	2640-0316
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!