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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium S. 702 - 712
Hauptverfasser:	Sanders, Peter, Uhl, Tim Niklas
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.05.2023
Schlagworte:	clustering coefficient Distributed processing distributed-memory algorithm graph analysis Memory management MPI Program processors Routing Task analysis triangle counting
ISSN:	1530-2075
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!