Author of the publication

A Communication-Avoiding 3D LU Factorization Algorithm for Sparse Matrices.

, , and . IPDPS, page 908-919. IEEE Computer Society, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Sparse Binary Matrix-Vector Multiplication on Neuromorphic Computers., , , , , and . IPDPS Workshops, page 308-311. IEEE, (2021)Scalable and resilient sparse linear solvers.. Georgia Institute of Technology, Atlanta, GA, USA, (2018)base-search.net (ftgeorgiatech:oai:smartech.gatech.edu:1853/60233).Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters., , , , , and . HPDC, page 121-131. ACM, (2021)A Distributed CPU-GPU Sparse Direct Solver., , and . Euro-Par, volume 8632 of Lecture Notes in Computer Science, page 487-498. Springer, (2014)A distributed kernel summation framework for general-dimension machine learning., , , and . Stat. Anal. Data Min., 7 (1): 1-13 (2014)A communication-avoiding 3D algorithm for sparse LU factorization on heterogeneous systems., , and . J. Parallel Distributed Comput., (2019)Optimizing Communication in 2D Grid-Based MPI Applications at Exascale., , , , , and . EuroMPI, page 9:1-9:11. ACM, (2023)A supernodal all-pairs shortest path algorithm., , , and . PPoPP, page 250-261. ACM, (2020)Exaflops Biomedical Knowledge Graph Analytics., , , , , , , , , and 4 other author(s). SC, page 6:1-6:11. IEEE, (2022)Brief Announcement: Communication Optimal Sparse LU Factorization for Planar Matrices., and . SPAA, page 427-430. ACM, (2023)