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

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings - International Conference on High Performance Computing s. 23 - 33
Hlavný autor:	Ibrahim, Khaled
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.12.2019
Predmet:	Bandwidth Benchmark testing Breadth-first Search Computational modeling Distributed Memory Programming Models Hardware Hardware Accelerated Collective Programming Runtime Voting
ISSN:	2640-0316
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!