Piyush K. Sao
Staff Scientist at ORNL
1 Bethel Valley Rd
Oak Ridge, TN 37830
Hello! I’m Piyush Sao, a staff scientist at Oak Ridge National Laboratory (ORNL) in the Computer Science and Mathematics Division. My research focuses on improving scientific computing and machine learning algorithms by leveraging high-performance computing platforms like the Frontier Supercomputer at ORNL.
I develop efficient numerical algorithms, including linear solvers and graph algorithms for traversal, shortest path, and clustering. Some of my algorithms have been implemented in widely-used libraries such as SuperLU_DIST and ArborX. My work addresses fundamental questions that push the boundaries of modern computing:
- How can we create algorithms that efficiently scale on the world’s most powerful supercomputers?
- What is the minimum amount of resources required to accurately and reliably solve complex problems?
By tackling these challenges, I strive to develop communication-avoiding algorithms, improve fault tolerance, and optimize scientific applications for parallel and distributed computing environments.
I completed my undergraduate studies at IIT Madras in India and earned my PhD from Georgia Tech. At Georgia Tech, I was part of HPC Garage, a research group led by Prof. Richard Vuduc.
news
| Jul 21, 2026 | New preprint: A Second-Moment Theory for Floating-Point Reduction Trees. |
|---|---|
| Jul 21, 2026 | New preprint: Contraction-Gauge Preconditioning for Quantized Matrix Multiplication. |
| Mar 13, 2026 | New preprint: Ghosts of Softmax |
| Feb 12, 2026 | New preprint: Fast Evaluation of Truncated Neumann Series by Low-Product Radix Kernels. |
| Jan 18, 2026 | New preprint: What Trace Powers Reveal About Log-Determinants: Closed-Form Estimators, Certificates, and Failure Modes. |
latest posts
selected publications
-
Exaflops biomedical knowledge graph analyticsIn 2022 SC22: International Conference for High Performance Computing, Networking, Storage and Analysis (SC), 2022
-
A Communication-avoiding 3D Sparse Triangular Solve AlgorithmIn International Conference on Supercomputing, Jun 2019