Graph 500 is an established set of large-scale benchmarks for data intensive applications and these high-performance applications cannot be improved without a meaningful benchmark. Graphs are a core…
For the problem of computing the connected components of a graph, this work considers the design of algorithms that are resilient to transient hardware faults, like bit flips. More specifically, it…
We propose a new algorithm to improve the strong scalability of right-looking sparse LU factorization on distributed memory systems. Our 3D algorithm for sparse LU uses a three-dimensional MPI…
Non-negative matrix factorization(Nmf) is an important tool in high-performance large scale data analytics with applications ranging from community detection, recommender system, feature detection…
We present a novel distributed memory algorithm to improve the strong scalability of the solution of a sparse triangular system. This operation appears in the solve phase of direct methods for…