Engineering a Distributed-Memory Triangle Counting Algorithm

Counting triangles in a graph and incident to each vertex is a fundamental and frequently considered task of graph analysis. We consider how to efficiently do this for huge graphs using massively parallel distributed-memory machines. Unsurprisingly, the main issue is to reduce communication between...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings - IEEE International Parallel and Distributed Processing Symposium s. 702 - 712
Hlavní autori:	Sanders, Peter, Uhl, Tim Niklas
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.05.2023
Predmet:	clustering coefficient Distributed processing distributed-memory algorithm graph analysis Memory management MPI Program processors Routing Task analysis triangle counting
ISSN:	1530-2075
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!