18 citations · 32 across the 3 of their papers we have counts for
4 papers
Delayed Asynchronous Iterative Graph Algorithms
Mark P. Blanco, Scott McMillan, Tze Meng Low
Iterative graph algorithms often compute intermediate values and update them as computation progresses. Updated output values are used as inputs for computations in current or subs…
Exploration of Fine-Grained Parallelism for Load Balancing Eager K-truss on GPU and CPU
Mark Blanco, Tze Meng Low, Kyungjoo Kim
In this work we present a performance exploration on Eager K-truss, a linear-algebraic formulation of the K-truss graph algorithm. We address performance issues related to load imb…
Towards an Objective Metric for the Performance of Exact Triangle Count
Mark P. Blanco, Scott McMillan, Tze Meng Low
The performance of graph algorithms is often measured in terms of the number of traversed edges per second (TEPS). However, this performance metric is inadequate for a graph operat…
Delta-stepping SSSP: from Vertices and Edges to GraphBLAS Implementations
Upasana Sridhar, Mark Blanco, Rahul Mayuranath +3
GraphBLAS is an interface for implementing graph algorithms. Algorithms implemented using the GraphBLAS interface are cast in terms of linear algebra-like operations. However, many…