Ron Brightwell
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ron Brightwell has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
Rolf Riesen
IBM Dublin, Ireland
2 shared publicationsAmir Shehata
Computer Science and Mathematics, Oak Ridge National Laboratory, Oak Ridge, Tennessee, USA
1 shared publication- Arthur Bernard Maccabe
University of Arizona, Tucson, AZ, 85721, USA
1 shared publication - Atsushi Hori
National Institute of Informatics
1 shared publication - Aurelien Bouteiller
The University of Tennessee
1 shared publication - Balazs Gerofi
Intel Corporation, Hillsboro, Oregon, USA
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.
- 23 July 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 38 (5) , 491-507
Taking the MPI standard and the open MPI library to exascale
The Open MPI for Exascale (OMPI-X) project was one of two in the Exascale Computing Project (ECP) focused on advancing the MPI ecosystem. The OMPI-X team worked with other MPI Forum members to champion several important features for inclusion in the MPI 4.0, 4.1, and upcoming 5.0 MPI standard versions, in support of the needs of exascale applications and systems. The team also worked with the larger Open MPI community to bring implementations of these new features and other enhancements into Open MPI, one of the leading open-source implementations of the MPI interface. This paper describes the motivation for the work of the OMPI-X project in the context of exascale computing needs, the nature of the resulting new capabilities in the MPI standard, and how they were implemented in the Open MPI library. Features include improved support for “MPI + X” programming models through partitioned communications and support for user-level threading, sessions, fault tolerance through the user-level fault mitigation (ULFM) and Reinit models, and other features. We also discuss enhancements to Open MPI providing improved performance and scalability for existing features, such as collective operations, one-sided operations, support for the Slingshot-11 interconnect of the initial exascale systems, and how the OMPI-X team worked to improve quality assurance for the Open MPI library, particularly on platforms of interest to the Department of Energy community.
- 23 July 2024
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 38 (5) , 491-507
Taking the MPI standard and the open MPI library to exascale
The Open MPI for Exascale (OMPI-X) project was one of two in the Exascale Computing Project (ECP) focused on advancing the MPI ecosystem. The OMPI-X team worked with other MPI Forum members to champion several important features for inclusion in the MPI 4.0, 4.1, and upcoming 5.0 MPI standard versions, in support of the needs of exascale applications and systems. The team also worked with the larger Open MPI community to bring implementations of these new features and other enhancements into Open MPI, one of the leading open-source implementations of the MPI interface. This paper describes the motivation for the work of the OMPI-X project in the context of exascale computing needs, the nature of the resulting new capabilities in the MPI standard, and how they were implemented in the Open MPI library. Features include improved support for “MPI + X” programming models through partitioned communications and support for user-level threading, sessions, fault tolerance through the user-level fault mitigation (ULFM) and Reinit models, and other features. We also discuss enhancements to Open MPI providing improved performance and scalability for existing features, such as collective operations, one-sided operations, support for the Slingshot-11 interconnect of the initial exascale systems, and how the OMPI-X team worked to improve quality assurance for the Open MPI library, particularly on platforms of interest to the Department of Energy community.
- Open Access
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6 (15525244) , 342-350
Re-evaluating Network Onload vs. Offload for the Many-Core Era
This paper explores the trade-offs between on-loaded versus offloaded network stack processing for systems with varying CPU frequencies. This study explores the differences of onload and offload using experiments run at different DVFS settings to change the frequency, while measuring performance and power. This allows for a quantitative comparison of the the performance and power and trade-offs between onload and offload cards, with a wide range of CPU performances. The results show that there is often a significant performance increase in using offloaded cards especially at lower CPU frequencies, with only a small increase in power usage. This study also uses MPI profiling to analyze why some applications see a larger benefit than others. This paper's contributions are an analytical, quantitative analysis of the trade-offs between onload and offload. While there has been debate to this question, this is the first, to the authors' knowledge, analytical evaluation of the performance difference. The range of frequencies analyzed give insight on how this MPI might perform on different architectures, such as the low frequency, many-core CPUs. Finally, the power measurements allow for the study to provide further depth in the analysis.
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 6 (15525244) , 342-350
Open AccessRe-evaluating Network Onload vs. Offload for the Many-Core Era
This paper explores the trade-offs between on-loaded versus offloaded network stack processing for systems with varying CPU frequencies. This study explores the differences of onload and offload using experiments run at different DVFS settings to change the frequency, while measuring performance and power. This allows for a quantitative comparison of the the performance and power and trade-offs between onload and offload cards, with a wide range of CPU performances. The results show that there is often a significant performance increase in using offloaded cards especially at lower CPU frequencies, with only a small increase in power usage. This study also uses MPI profiling to analyze why some applications see a larger benefit than others. This paper's contributions are an analytical, quantitative analysis of the trade-offs between onload and offload. While there has been debate to this question, this is the first, to the authors' knowledge, analytical evaluation of the performance difference. The range of frequencies analyzed give insight on how this MPI might perform on different architectures, such as the low frequency, many-core CPUs. Finally, the power measurements allow for the study to provide further depth in the analysis.
- Open Access
- 1 July 2012
- Published by Office of Scientific and Technical Information (OSTI)
Detection and Correction of Silent Data Corruption for Large-Scale High-Performance Computing
Faults have become the norm rather than the exception for high-end computing on clusters with 10s/100s of thousands of cores. Exacerbating this situation, some of these faults remain undetected, manifesting themselves as silent errors that corrupt memory while applications continue to operate and report incorrect results. This paper studies the potential for redundancy to both detect and correct soft errors in MPI message-passing applications. Our study investigates the challenges inherent to detecting soft errors within MPI application while providing transparent MPI redundancy. By assuming a model wherein corruption in application data manifests itself by producing differing MPI message data between replicas, we study the best suited protocols for detecting and correcting MPI data that is the result of corruption. To experimentally validate our proposed detection and correction protocols, we introduce RedMPI, an MPI library which resides in the MPI profiling layer. RedMPI is capable of both online detection and correction of soft errors that occur in MPI applications without requiring any modifications to the application source by utilizing either double or triple redundancy. Our results indicate that our most efficient consistency protocol can successfully protect applications experiencing even high rates of silent data corruption with runtime overheads between 0% and 30% as compared to unprotected applications without redundancy. Using our fault injector within RedMPI, we observe that even a single soft error can have profound effects on running applications, causing a cascading pattern of corruption in most cases causes that spreads to all other processes. RedMPI's protection has been shown to successfully mitigate the effects of soft errors while allowing applications to complete with correct results even in the face of errors
- 1 July 2012
- Published by Office of Scientific and Technical Information (OSTI)
Open AccessDetection and Correction of Silent Data Corruption for Large-Scale High-Performance Computing
Faults have become the norm rather than the exception for high-end computing on clusters with 10s/100s of thousands of cores. Exacerbating this situation, some of these faults remain undetected, manifesting themselves as silent errors that corrupt memory while applications continue to operate and report incorrect results. This paper studies the potential for redundancy to both detect and correct soft errors in MPI message-passing applications. Our study investigates the challenges inherent to detecting soft errors within MPI application while providing transparent MPI redundancy. By assuming a model wherein corruption in application data manifests itself by producing differing MPI message data between replicas, we study the best suited protocols for detecting and correcting MPI data that is the result of corruption. To experimentally validate our proposed detection and correction protocols, we introduce RedMPI, an MPI library which resides in the MPI profiling layer. RedMPI is capable of both online detection and correction of soft errors that occur in MPI applications without requiring any modifications to the application source by utilizing either double or triple redundancy. Our results indicate that our most efficient consistency protocol can successfully protect applications experiencing even high rates of silent data corruption with runtime overheads between 0% and 30% as compared to unprotected applications without redundancy. Using our fault injector within RedMPI, we observe that even a single soft error can have profound effects on running applications, causing a cascading pattern of corruption in most cases causes that spreads to all other processes. RedMPI's protection has been shown to successfully mitigate the effects of soft errors while allowing applications to complete with correct results even in the face of errors
- Open Access
- 1 August 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 1-6
Challenges for High-Performance Networking for Exascale Computing
Achieving the next three orders of magnitude performance increase to move from petascale to exascale computing will require a significant advancements in several fundamental areas. Recent studies have outlined many of the challenges in hardware and software that will be needed. In this paper, we examine these challenges with respect to high-performance networking. We describe the repercussions of anticipated changes to computing and networking hardware and discuss the impact that alternative parallel programming models will have on the network software stack. We also present some ideas on possible approaches that address some of these challenges.
- 1 August 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10952055,p. 1-6
Open AccessChallenges for High-Performance Networking for Exascale Computing
Achieving the next three orders of magnitude performance increase to move from petascale to exascale computing will require a significant advancements in several fundamental areas. Recent studies have outlined many of the challenges in hardware and software that will be needed. In this paper, we examine these challenges with respect to high-performance networking. We describe the repercussions of anticipated changes to computing and networking hardware and discuss the impact that alternative parallel programming models will have on the network software stack. We also present some ideas on possible approaches that address some of these challenges.
- 1 February 2003
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 17 (1) , 7-19
Design, Implementation, and Performance of MPI on Portals 3.0
This paper describes an implementation of the Message Passing Interface (MPI) on the Portals 3.0 data movement layer. Portals 3.0 provides low-level building blocks that are flexible enough to support higher-level message passing layers, such as MPI, very efficiently. Portals 3.0 is also designed to allow for programmable network interface cards to offload message processing from the host processor, allowing for the ability to overlap computation and MPI communication. We describe the basic building blocks in Portals 3.0, show how they can be put together to implement MPI, and describe the protocols of our MPI implementation. We look at several key operations within the implementation and describe the effects that a Portals 3.0 implementation has on scalability and performance. We also present preliminary performance results from our implementation for Myrinet.
- 1 February 2003
- Published by SAGE Publications in The International Journal of High Performance Computing Applications
- Vol. 17 (1) , 7-19
Design, Implementation, and Performance of MPI on Portals 3.0
This paper describes an implementation of the Message Passing Interface (MPI) on the Portals 3.0 data movement layer. Portals 3.0 provides low-level building blocks that are flexible enough to support higher-level message passing layers, such as MPI, very efficiently. Portals 3.0 is also designed to allow for programmable network interface cards to offload message processing from the host processor, allowing for the ability to overlap computation and MPI communication. We describe the basic building blocks in Portals 3.0, show how they can be put together to implement MPI, and describe the protocols of our MPI implementation. We look at several key operations within the implementation and describe the effects that a Portals 3.0 implementation has on scalability and performance. We also present preliminary performance results from our implementation for Myrinet.
- 1 January 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2-9
Application-bypass broadcast in MPICH over GM
Processes of a parallel program can become unsynchronized, or skewed, during the course of running an application. Processes can become skewed as a result of unbalanced or asymmetric rode, or through the use of heterogeneous systems, where nodes in the system have different performance characteristics, as well as random, unpredictable effects such as the processes not being started at exactly the same time, or processors receiving interrupts during computation. Geographically distributed systems may have more severe skew because of variable communication times. Such skew can have a significant impact on the performance of collective communication operations which impose an implicit synchronization. The broadcast operation in MPICH is one such operation. An application-bypass broadcast operation is one which does not depend on the application running at a process to make progress. Such an operation would not be as sensitive to process skew. This paper describes the design and implementation of an application-bypass broadcast operation. We evaluated the implementation and find a factor of improvement of up to 16 for application-bypass broadcast compared to non-application-bypass broadcast when processes are skewed. Furthermore we see that as the system size increases, the effects of skew on non-application-bypass broadcast also increase. The application-bypass broadcast is much less sensitive to process skew which makes it more scalable than the non-application-bypass broadcast operation.
- 1 January 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2-9
Application-bypass broadcast in MPICH over GM
Processes of a parallel program can become unsynchronized, or skewed, during the course of running an application. Processes can become skewed as a result of unbalanced or asymmetric rode, or through the use of heterogeneous systems, where nodes in the system have different performance characteristics, as well as random, unpredictable effects such as the processes not being started at exactly the same time, or processors receiving interrupts during computation. Geographically distributed systems may have more severe skew because of variable communication times. Such skew can have a significant impact on the performance of collective communication operations which impose an implicit synchronization. The broadcast operation in MPICH is one such operation. An application-bypass broadcast operation is one which does not depend on the application running at a process to make progress. Such an operation would not be as sensitive to process skew. This paper describes the design and implementation of an application-bypass broadcast operation. We evaluated the implementation and find a factor of improvement of up to 16 for application-bypass broadcast compared to non-application-bypass broadcast when processes are skewed. Furthermore we see that as the system size increases, the effects of skew on non-application-bypass broadcast also increase. The application-bypass broadcast is much less sensitive to process skew which makes it more scalable than the non-application-bypass broadcast operation.