Sam White
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Sam White has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Laxmikant V. Kale
University of Illinois at Urbana-Champaign
4 shared publications Laxmikant V. Kale
University of Illinois at Urbana-Champaign
2 shared publications- Matthias Diener
University of Illinois at Urbana-Champaign
2 shared publications - Atsushi Hori
National Institute of Informatics
1 shared publication - Balazs Gerofi
Intel Corporation, Hillsboro, Oregon, USA
1 shared publication - David F. Richards
Lawrence Livermore National Laboratory
1 shared publication
Latest Publications
- Open Access
- 1 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (1) , 1-34
A Survey on the Shared Address Space with Privatized Static Variables (SAS-PSV) Execution Model for the Many-Core Era
Parallel applications often use MPI processes and OpenMP threads. Those parallel execution models, multi-process and multi-thread, were invented to increase efficiency on uniprocessor systems. In the multi-process approach, each process’s isolated address space may make communication expensive; in the multi-thread design, shared variables may cause access conflicts and stall executions. Processes or threads interact and exchange information more often as CPU cores increase, and traditional execution models may create bottlenecks. The paradigm shift from uniprocessor to many-core systems necessitates the development of new parallel execution models to address challenges posed by the two parallel models. When processes share an address space, what happens? If threads don’t share static variables? Sharing an address space and privatizing static variables reduces information exchange and shared static variable exclusion costs. This survey investigates SAS-PSV (SAS-PSV) , a new execution architecture that allows shared address space and static variable privatization. This notion is implemented by MPC, SMARTMAP, PVAS, PiP, and AMPI. Each has a different approach and execution. This article analyzes these implementations’ concepts, details, and hidden defects. We also present SAS-PSV applications and issues that need to be solved.
- 1 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 58 (1) , 1-34
Open AccessA Survey on the Shared Address Space with Privatized Static Variables (SAS-PSV) Execution Model for the Many-Core Era
Parallel applications often use MPI processes and OpenMP threads. Those parallel execution models, multi-process and multi-thread, were invented to increase efficiency on uniprocessor systems. In the multi-process approach, each process’s isolated address space may make communication expensive; in the multi-thread design, shared variables may cause access conflicts and stall executions. Processes or threads interact and exchange information more often as CPU cores increase, and traditional execution models may create bottlenecks. The paradigm shift from uniprocessor to many-core systems necessitates the development of new parallel execution models to address challenges posed by the two parallel models. When processes share an address space, what happens? If threads don’t share static variables? Sharing an address space and privatizing static variables reduces information exchange and shared static variable exclusion costs. This survey investigates SAS-PSV (SAS-PSV) , a new execution architecture that allows shared address space and static variable privatization. This notion is implemented by MPC, SMARTMAP, PVAS, PiP, and AMPI. Each has a different approach and execution. This article analyzes these implementations’ concepts, details, and hidden defects. We also present SAS-PSV applications and issues that need to be solved.
- 4 August 2022
- Published by Elsevier in Parallel Computing
- Vol. 113
Accelerating communication for parallel programming models on GPU systems
- 4 August 2022
- Published by Elsevier in Parallel Computing
- Vol. 113
Accelerating communication for parallel programming models on GPU systems
- 9 June 2022
- Published by Springer Nature
- p. 496-505
Enabling Support for Zero Copy Semantics in an Asynchronous Task-Based Programming Model
- 9 June 2022
- Published by Springer Nature
- p. 496-505
Enabling Support for Zero Copy Semantics in an Asynchronous Task-Based Programming Model
- 24 April 2019
- Published by Springer Nature
- p. 219-230
Visualizing, Measuring, and Tuning Adaptive MPI Parameters
- 24 April 2019
- Published by Springer Nature
- p. 219-230
Visualizing, Measuring, and Tuning Adaptive MPI Parameters
- 12 March 2018
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 32 (3)
Optimizing point‐to‐point communication between adaptive MPI endpoints in shared memory
Summary: Adaptive MPI is an implementation of the MPI standard that supports the virtualization of ranks as user‐level threads, rather than OS processes. In this work, we optimize the communication performance of AMPI based on the locality of the endpoints communicating within a cluster of SMP nodes. We differentiate between point‐to‐point messages with both endpoints co‐located on the same execution unit and point‐to‐point messages with both endpoints residing in the same process but not on the same execution unit. We demonstrate how the messaging semantics of Charm++ enable and hinder AMPI's implementation in different ways, and we motivate extensions to Charm++ to address the limitations. Using the OSU micro‐benchmark suite, we show that our locality‐aware design offers lower latency, higher bandwidth, and reduced memory footprint for applications.
- 12 March 2018
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 32 (3)
Optimizing point‐to‐point communication between adaptive MPI endpoints in shared memory
Summary: Adaptive MPI is an implementation of the MPI standard that supports the virtualization of ranks as user‐level threads, rather than OS processes. In this work, we optimize the communication performance of AMPI based on the locality of the endpoints communicating within a cluster of SMP nodes. We differentiate between point‐to‐point messages with both endpoints co‐located on the same execution unit and point‐to‐point messages with both endpoints residing in the same process but not on the same execution unit. We demonstrate how the messaging semantics of Charm++ enable and hinder AMPI's implementation in different ways, and we motivate extensions to Charm++ to address the limitations. Using the OSU micro‐benchmark suite, we show that our locality‐aware design offers lower latency, higher bandwidth, and reduced memory footprint for applications.
- Open Access
- 12 November 2017
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Integrating OpenMP into the Charm++ Programming Model
The recent trend of rapid increase in the number of cores per chip has resulted in vast amounts of on-node parallelism. These high core counts result in hardware variability that introduces imbalance. Applications are also becoming more complex themselves, resulting in dynamic load imbalance. Load imbalance of any kind can result in loss of performance and decrease in system utilization. In this paper, we propose a new integrated runtime system that adds OpenMP shared-memory parallelism to the Charm++ distributed programming model to improve load balancing on distributed systems. Our proposal utilizes an infrequent periodic assignment of work to cores based on load measurement, in combination with tasks created via OpenMP's parallel loop construct from each core to handle load imbalance. We demonstrate the benefits of using this integrated runtime system on the LLNL ASC proxy application Lassen, achieving speedups of 50% over runs without any load balancing and 10% over existing distributed-memory-only balancing schemes in Charm++.
- 12 November 2017
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessIntegrating OpenMP into the Charm++ Programming Model
The recent trend of rapid increase in the number of cores per chip has resulted in vast amounts of on-node parallelism. These high core counts result in hardware variability that introduces imbalance. Applications are also becoming more complex themselves, resulting in dynamic load imbalance. Load imbalance of any kind can result in loss of performance and decrease in system utilization. In this paper, we propose a new integrated runtime system that adds OpenMP shared-memory parallelism to the Charm++ distributed programming model to improve load balancing on distributed systems. Our proposal utilizes an infrequent periodic assignment of work to cores based on load measurement, in combination with tasks created via OpenMP's parallel loop construct from each core to handle load imbalance. We demonstrate the benefits of using this integrated runtime system on the LLNL ASC proxy application Lassen, achieving speedups of 50% over runs without any load balancing and 10% over existing distributed-memory-only balancing schemes in Charm++.