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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings - International Conference on High Performance Computing S. 23 - 33
1. Verfasser:	Ibrahim, Khaled
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.12.2019
Schlagworte:	Bandwidth Benchmark testing Breadth-first Search Computational modeling Distributed Memory Programming Models Hardware Hardware Accelerated Collective Programming Runtime Voting
ISSN:	2640-0316
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!