Piyush K Sao Research Scientist Contact 865.341.0265 | SAOPK@ORNL.GOV All Publications Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters A communication-avoiding 3D sparse triangular solver PANDORA: A Parallel Dendrogram Construction Algorithm for Single Linkage Clustering on GPU... Accelerated Constrained Sparse Tensor Factorization on Massively Parallel Architectures Unified Communication Optimization Strategies for Sparse Triangular Solver on CPU and GPU Clusters Optimizing Communication in 2D Grid-Based MPI Applications at Exascale Brief Announcement: Communication Optimal Sparse LU Factorization for Planar Matrices Newly Released Capabilities in the Distributed-Memory SuperLU Sparse Direct Solver A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs Resilience Design Patterns: A Structured Approach to Resilience at Extreme Scale (Version 2.0) Exaflops Biomedical Knowledge Graph Analytics Sparse Binary Matrix-Vector Multiplication on Neuromorphic Computers Scalable Knowledge Graph Analytics at 136 Petaflop/s Traversing large graphs on GPUs with unified memory Multifrontal Non-negative Matrix Factorization A supernodal all-pairs shortest path algorithm Self-stabilizing Connected Components A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems Key Links ORCID Organizations Computing and Computational Sciences Directorate Computer Science and Mathematics Division Mathematics in Computation Section Discrete Algorithms Group
