DistTC: High Performance Distributed Triangle Counting

Published in IEEE High Performance Extreme Computing (HPEC), 2019

Recommended citation: Loc Hoang, Vishwesh Jatala, Xuhao Chen, Udit Agarwal, Roshan Dathathri, Gurbinder Gill, Keshav Pingali, “DistTC: High Performance Distributed Triangle Counting,” Proceedings of the IEEE International Conference on High Performance Extreme Computing (HPEC), September 2019.

(Download publication here) (Download slides here) (Download source code here)


We describe a novel multi-machine multi-GPU implementation of triangle counting which exploits a novel application-agnostic graph partitioning strategy that eliminates almost all inter-host communication during triangle counting. Experimental results show that this distributed triangle counting implementation can handle very large graphs such as clueweb12, which has almost one billion vertices and 37 billion edges, and it is up to 1.6x faster than TriCore, the 2018 Graph Challenge champion.