MDMatthew G. F. Dosanjh

Matthew G. F. Dosanjh

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Matthew G. F. Dosanjh has a total of 34 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Kokkos Comm: Performance Portable Communication for Distributed Kokkos Applications

    by C. Nicole Avans, Gabriel Dos Santos, Cédric Chevalier, Hugo Taboada, Marc Pérache, Matthew G. F. Dosanjh, Stephen L. Olivier, Carl Pearson, Evan D. Suggs, Vivek Kale, et al.


  • Open Access

    RAMC: Remote Access Memory Channels over HPE Slingshot

    by Whit Schonbein, Matthew Dosanjh, Scott Levy

  • Open Access

    Co-Design and Evaluation of a CPU-Free MPI GPU Communication Abstraction and Implementation

    by Patrick G. Bridges, Derek Schafer, Jack Lange, James B. White, Anthony Skjellum, Evan Suggs, Thomas Hines, Purushotham Bangalore, Matthew G. F. Dosanjh, Whit Schonbein

    Removing the CPU from the communication fast path is essential to efficient GPU-based ML and HPC application performance. However, existing GPU communication APIs either continue to rely on the CPU for communication or rely on APIs that place significant synchronization burdens on programmers. In this paper we describe the design, implementation, and evaluation of an MPI-based GPU communication API enabling easy-to-use, high-performance, CPU-free communication. This API builds on previously proposed MPI extensions and leverages HPE Slingshot 11 network card capabilities. We demonstrate the utility and performance of the API by showing how the API naturally enables CPU-free gather/scatter halo exchange communication primitives in the Cabana/Kokkos performance portability framework, and through a performance comparison with Cray MPICH on the Frontier and Tuolumne supercomputers. Results from this evaluation show up to a 50% reduction in medium message latency in simple GPU ping-pong exchanges and a 28% speedup improvement when strong scaling a halo-exchange benchmark to 8,192 GPUs of the Frontier supercomputer.

  • Open Access

    Scaling All-to-All Operations Across Emerging Many-Core Supercomputers

    by Shannon Gayle Kinkead, Jackson Wesley, Whit Schonbein, David DeBonis, Matthew Dosanjh, Amanda Bienz


  • Adapting HPC Systems for Integrated Research Infrastructure

    by Albuquerque Sandia National Laboratories (Snl-Nm), Matthew Dosanjh, Advanced Simulation And Computing, Usdoe National Nuclear Security Administration (Nnsa)

  • Measuring Thread Timing to Assess the Feasibility of Early‐Bird Message Delivery Across Systems and Scales

    by W. Pepper Marts, Matthew G. F. Dosanjh, Whit Schonbein, Scott Levy, Patrick G. Bridges

    Early‐bird communication is a communication/computation overlap technique that leverages fine‐grained communication to improve application run‐time. Communication is divided such that each individual thread can initiate transmission of its portion of the data upon completion rather than waiting for a dedicated communication phase. The benefit of early‐bird communication depends on the completion timing of the individual threads: On the one hand, if all threads are complete at nearly the same time, the overheads of sending multiple messages will accumulate, leading to performance that is worse than if a single message had been sent. On the other hand, if thread completions are spread out in time, those that complete earlier can send data while others continue working, leading to performance that is better than if a single message had been sent. The challenge is that the completion times are currently unknown and can vary based on application, problem size, system software, and underlying hardware. In this paper, we address this lacuna by measuring and evaluating the potential overlap afforded by early‐bird communication for a selection of proxy applications. These measurements help us understand whether a given application could benefit from early‐bird communication. We present our technique for gathering this data and evaluate data collected from three proxy applications: MiniFE, MiniMD, and MiniQMC. Each application is run on three systems with distinct CPU architectures and strong scales across three run sizes. To characterize the behavior of these workloads, we study the trends of thread timings at both a macro level, across all threads across all runs of an application, and a micro level, that is, within a single process of a single run. We observe that our tested applications exhibit significantly different thread arrival distributions. The machine used had a significant impact, with the window of potential overlap varying by as much as an order of magnitude.

  • Open Access

    A Statistical Analysis of HPC Network Tuning

    by Donald A. Kruse, Whit Schonbein, Matthew G. F. Dosanjh

    Distributed scientific applications run on a complex stack of software and network technologies. Each layer has configuration options for tuning performance. These can range from protocol thresholds to algorithmic changes for collectives. Micro-benchmarks are a common methodology to evaluate the communication stack and are relatively easy to tune. However they aren’t representative of application behavior. Proxy applications, however, offer a simplified, but realistic, representation of the main computational and communicative methods in scientific programs. Since these proxy applications contain realistic message passing patterns, the correlation between micro-benchmarks and proxy application performance is not obvious. In this paper we present a study of statistically analysing the impacts of tuning. Our results show how tuned micro-benchmark performance correlates with tuned proxy application performance.


  • Open Access

    Modeling and Benchmarking the Potential Benefit of Early-Bird Transmission in Fine-Grained Communication

    by Whit Schonbein, Scott Levy, Matthew G. F. Dosanjh, W. Pepper Marts, Elizabeth Reid, Ryan E. Grant

    Traditional point-to-point communication sends data only after the entirety of the data is available. This includes situations where multiple actors (e.g., threads) contribute to the send buffer. As a result, cases where the completion times of these actors are widely distributed may be lost opportunities for optimization because data ready to be sent is waiting to be transmitted. Fine-grained communication exposes these opportunities by allowing buffers to be divided into element s that can then be sent independently (see e.g., Partitioned Communication in Message Passing Interface v4.0). While some research has been directed at exploring the utility of such ‘early-bird’ transmission, the overall search space for finding the best performing actor completion timings and element counts is large. In this work, we present an abstract model of fine-grained communication based on the LogGP model and a complementary benchmark. We use the model to explore actor completion timing scenarios and identify trends in communication behavior based on factors such as overall message size and delay between actor completions. We evaluate the benchmarks on three systems utilizing distinct network technologies and show that: (i) smaller numbers of element s are able to exploit most of the benefit of early-bird communication, (ii) performance benefit will depend non-trivially on application behavior, and (iii) benefits are highly network-dependent.


  • Open Access

    Measuring Thread Timing to Assess the Feasibility of Early-bird Message Delivery

    by William Pepper Marts, Matthew G. F. Dosanjh, Whit Schonbein, Scott Levy, Patrick G. Bridges


  • Open Access

    Understanding the Sandia Message Rate Benchmark

    by Usdoe National Nuclear Security Administration (Nnsa), Matthew Dosanjh, Albuquerque Sandia National Laboratories (Snl-Nm)

    This report documents recent extensions to Sandia Message Rate that enable the benchmark to evaluate both host-memory and accelerator-resident communication. Modern HPC applications increasingly keep data resident in GPU memory, making host-only MPI measurements insufficient for understanding application communication behavior. GPU-aware MPI allows MPI calls to accept accelerator pointers.