Graph mining applications such as PageRank, spectral clustering, diameter estimation, connnected components etc. used repeated
matrix-vector multiplication
It achieves (a) good scale-up on thenumber of available machines (b) linear running time on thenumber of edges, and
(c) more than5 timesfaster performanceover the non-optimized version ofGIM-V