Optimizing High Performance Markov Clustering for Pre-Exascale Architectures

24 Feb 2020 Selvitopi Oguz Hussain Md Taufique Azad Ariful Buluç Aydın

HipMCL is a high-performance distributed memory implementation of the popular Markov Cluster Algorithm (MCL) and can cluster large-scale networks within hours using a few thousand CPU-equipped nodes. It relies on sparse matrix computations and heavily makes use of the sparse matrix-sparse matrix multiplication kernel (SpGEMM)... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING