Shubhendra Pal Singhal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Shubhendra Pal Singhal has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Aaron Welch
Oak Ridge National Laboratory, Oak Ridge, USA
3 shared publications - Akihiro Hayashi
Georgia Institute of Technology, Atlanta, USA
3 shared publications - Oscar Hernandez
Oak Ridge National Laboratory, Oak Ridge, USA
3 shared publications - Stephen Poole
Los Alamos National Laboratory, Los Alamos, USA
3 shared publications - Vivek Sarkar
Georgia Institute of Technology, Atlanta, USA
3 shared publications - Nathan Wichmann
Hewlett Packard Enterprise, Bloomington, USA
2 shared publications
Latest Publications
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 620-627
Performance Analysis of Conveyors: Memory Dominates?
Small-message aggregation is critical for scaling irregular, communication intensive applications in high-performance computing. In this paper, contrary to conventional wisdom, we present the first systematic study showing that memory contention, not network bandwidth, is the dominant bottleneck in message aggregation runtimes. Using the state-of-the-art conveyors library as our reference implementation, we conducted extensive experiments on HPC systems featuring Slingshot 11 and InfiniBand interconnects, scaling to 16k cores (256 nodes) and processing 10s–100s GB of data. Our measurements reveal that interference between user data and aggregation buffers drives LLC miss rates to 77%, inflating memory costs by 2–3× over the algorithmic baseline. Consequently, we advocate for dedicated near-memory subsystems to improve the scalability and performance of message aggregation runtimes. This paper also demonstrates up to an order of magnitude higher latency for conveyor termination compared to a traditional HPC barrier, and it examines the impact of communication context isolation and the critical challenge of programmability.
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 620-627
Open AccessPerformance Analysis of Conveyors: Memory Dominates?
Small-message aggregation is critical for scaling irregular, communication intensive applications in high-performance computing. In this paper, contrary to conventional wisdom, we present the first systematic study showing that memory contention, not network bandwidth, is the dominant bottleneck in message aggregation runtimes. Using the state-of-the-art conveyors library as our reference implementation, we conducted extensive experiments on HPC systems featuring Slingshot 11 and InfiniBand interconnects, scaling to 16k cores (256 nodes) and processing 10s–100s GB of data. Our measurements reveal that interference between user data and aggregation buffers drives LLC miss rates to 77%, inflating memory costs by 2–3× over the algorithmic baseline. Consequently, we advocate for dedicated near-memory subsystems to improve the scalability and performance of message aggregation runtimes. This paper also demonstrates up to an order of magnitude higher latency for conveyor termination compared to a traditional HPC barrier, and it examines the impact of communication context isolation and the critical challenge of programmability.
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 238-252
Toward a Unified GPU-Aware OpenSHMEM Specification
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 238-252
Open AccessToward a Unified GPU-Aware OpenSHMEM Specification
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 217-228
Heading Towards Energy Savings or Just Performance: Case-Study on Message Aggregation-Based Runtimes
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 217-228
Open AccessHeading Towards Energy Savings or Just Performance: Case-Study on Message Aggregation-Based Runtimes