Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “message matching”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

69 records · Page 4

LabVIEW Interface for PCI-SpaceWire Interface Card

This software provides a LabView interface to the NT drivers for the PCISpaceWire card, which is a peripheral component interface (PCI) bus interface that conforms to the IEEE-1355/ SpaceWire standard. As SpaceWire grows in popularity, the ability to use SpaceWire links within LabVIEW will be important to electronic ground support equipment vendors. In addition, there is a need for a high-level LabVIEW interface to the low-level device- driver software supplied with the card. The LabVIEW virtual instrument (VI) provides graphical interfaces to support all (1) SpaceWire link functions, including message handling and routing; (2) monitoring as a passive tap using specialized hardware; and (3) low-level access to satellite mission-control subsystem functions. The software is supplied in a zip file that contains LabVIEW VI files, which provide various functions of the PCI-SpaceWire card, as well as higher-link-level functions. The VIs are suitably named according to the matching function names in the driver manual. A number of test programs also are provided to exercise various functions.

Lux, James↗

Discrete sensitivity derivatives of the Navier-Stokes equations with a parallel Krylov solver

This paper solves an 'incremental' form of the sensitivity equations derived by differentiating the discretized thin-layer Navier Stokes equations with respect to certain design variables of interest. The equations are solved with a parallel, preconditioned Generalized Minimal RESidual (GMRES) solver on a distributed-memory architecture. The 'serial' sensitivity analysis code is parallelized by using the Single Program Multiple Data (SPMD) programming model, domain decomposition techniques, and message-passing tools. Sensitivity derivatives are computed for low and high Reynolds number flows over a NACA 1406 airfoil on a 32-processor Intel Hypercube, and found to be identical to those computed on a single-processor Cray Y-MP. It is estimated that the parallel sensitivity analysis code has to be run on 40-50 processors of the Intel Hypercube in order to match the single-processor processing time of a Cray Y-MP.

Ajmani, Kumud↗

HPC Network Simulation Tuning via Automatic Extraction of Hardware Parameters

Popular HPC network interconnection simulators such as SST/macro provide a variety of configurable parameters to explore the design space of hardware components such as network interface cards (NIC), switches, and links among them. While such knobs provide flexibility to explore design trade-offs for novel hardware, manually configuring simulations for matching configurations of the existing hardware to focus on topology exploration can be cumbersome and error-prone, leading to widely inaccurate simulations. This challenge is compounded when specifications of various (proprietary) technologies are not readily available or intentionally omitted. In this work, we propose a framework to autotune the multiple network models’ simulation configurations within SST/macro using Tree-structured Parzen Estimator-based Bayesian optimization to observe the effect on simulation accuracy across different message regimes. These regimes consist of small to large message sizes and latency to bandwidth-bound messages. We provide a detailed analysis of the simulation error for four representative HPC systems. Our Bayesian optimization based autotuning framework for network models achieves a maximum of 5x improvement in accuracy over best-effort manual configurations based on available hardware specifications.

Simulation, autotuning↗

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗

A 220-$\mu$ W –83-dBm 5.8-GHz Third-Harmonic Passive Mixer-First LP-WUR for IEEE 802.11ba

A 40-nm CMOS IEEE 802.11ba low-power wake-up receiver (LP-WUR) is presented. It receives 802.11ba messages generated by an 802.11 orthogonal frequency-division multiplexing (OFDM) transmitter operating at 5.8 GHz. The power consumption of the RF front-end is minimized by removing active RF gain stages and using a third harmonic passive mixer with a ring-based local oscillator (LO) operating at one-third of the RF frequency. The noise figure is 14 dB, taking advantage of a 1:3 transformer that provides passive voltage gain in front of the high switch loss mixer-first RF front-end, and matching across 5.5-5.8 GHz with <; -12 dB S11. Here, the receiver achieves a sensitivity of -83-dBm and -20-dB adjacent channel signal-tointerference ratio (SIR) while consuming 220 μW at a bit error rate (BER) of 10-3 and data rate of 62.5 kb/s, which shows the best sensitivity-power tradeoff among >3-GHz receivers.

42 ENGINEERING↗

Cross-scale modeling of storm surge, tide, and inundation in Mid-Atlantic Bight and New York City during Hurricane Sandy, 2012

Driven by high-resolution NAM (North America Mesoscale) and ECMWF (European Centre for Medium-Range Weather Forecasts) atmospheric fields, a 3-D unstructured grid SCHISM (Semi-implicit Cross-scale Hydroscience Integrated System Model) was applied to simulate total water level in the Mid-Atlantic Bight during Hurricane Sandy in 2012. The simulated storm surge, tide, significant wave height, and wave peak period results compared favorably with NOAA observations along US East Coast, Long Island Sound, and New York Harbor. The maximum total water level at The Battery in the New York Harbor was accurately simulated with an absolute error of less than 0.08 m (out of 2.9 m peak surge) and a timing difference less than 10 min, which includes the effects on the order of 0.1–0.3 m (5–10%) from the coastal setup induced by the surface waves. The scenario comparisons of (1) “NAM” versus “ECMWF”, (2) “2-D” versus “3-D”, and (3) “with” versus “without” wind wave model were examined. The 3-D barotropic model forced by ECMWF including the effects of wind waves performs the best, attributed to wave-induced radiation stress and reduction of bottom stress when the 3-D version is used. Simultaneously, the ELCIRC-Sub model, using a 5-m topography/bathymetry sub-grid and a regular 200-m resolution finite volume computational model grid, was developed to simulate the street-level inundation in New York City. The momentum and mass fluxes calculated by the coarser base grid model were effectively coupled with the sub-grid so that running a full-blown high-resolution base model is not required. The ELCIRC-Sub model uses MPI (Message Passing Interface) parallel computing to enlarge the coverage of the land surface and an efficient non-linear solver to improve the accuracy of the wetting-and-drying processes. The temporal comparisons of modeled water level with NOAA's tidal stations and USGS' rapid-deployed gauges showed overall performance with an average error of 0.1 m. Particularly, ELCIRC-Sub captured the profile of the highest peak surge (3.9 m), which rose 2 m within 3 hour at Kings Point, NY. The spatial comparisons of the modeled peak water level at 80 surveyed locations showed an average error less than 0.13 m. The modeled maximum inundation extent also matched well with an 80% hit rate against FEMA's Hurricane Sandy maximum flooding extent.

54 ENVIRONMENTAL SCIENCES↗

A parallel adaptive mesh refinement algorithm

Over recent years, Adaptive Mesh Refinement (AMR) algorithms which dynamically match the local resolution of the computational grid to the numerical solution being sought have emerged as powerful tools for solving problems that contain disparate length and time scales. In particular, several workers have demonstrated the effectiveness of employing an adaptive, block-structured hierarchical grid system for simulations of complex shock wave phenomena. Unfortunately, from the parallel algorithm developer's viewpoint, this class of scheme is quite involved; these schemes cannot be distilled down to a small kernel upon which various parallelizing strategies may be tested. However, because of their block-structured nature such schemes are inherently parallel, so all is not lost. In this paper we describe the method by which Quirk's AMR algorithm has been parallelized. This method is built upon just a few simple message passing routines and so it may be implemented across a broad class of MIMD machines. Moreover, the method of parallelization is such that the original serial code is left virtually intact, and so we are left with just a single product to support. The importance of this fact should not be underestimated given the size and complexity of the original algorithm.

Quirk, James J.↗

Efficiency Improvements to the Displacement Based Multilevel Structural Optimization Algorithm

Multilevel Structural Optimization (MSO) continues to be an area of research interest in engineering optimization. In the present project, the weight optimization of beams and trusses using Displacement based Multilevel Structural Optimization (DMSO), a member of the MSO set of methodologies, is investigated. In the DMSO approach, the optimization task is subdivided into a single system and multiple subsystems level optimizations. The system level optimization minimizes the load unbalance resulting from the use of displacement functions to approximate the structural displacements. The function coefficients are then the design variables. Alternately, the system level optimization can be solved using the displacements themselves as design variables, as was shown in previous research. Both approaches ensure that the calculated loads match the applied loads. In the subsystems level, the weight of the structure is minimized using the element dimensions as design variables. The approach is expected to be very efficient for large structures, since parallel computing can be utilized in the different levels of the problem. In this paper, the method is applied to a one-dimensional beam and a large three-dimensional truss. The beam was tested to study possible simplifications to the system level optimization. In previous research, polynomials were used to approximate the global nodal displacements. The number of coefficients of the polynomials equally matched the number of degrees of freedom of the problem. Here it was desired to see if it is possible to only match a subset of the degrees of freedom in the system level. This would lead to a simplification of the system level, with a resulting increase in overall efficiency. However, the methods tested for this type of system level simplification did not yield positive results. The large truss was utilized to test further improvements in the efficiency of DMSO. In previous work, parallel processing was applied to the subsystems level, where the derivative verification feature of the optimizer NPSOL had been utilized in the optimizations. This resulted in large runtimes. In this paper, the optimizations were repeated without using the derivative verification, and the results are compared to those from the previous work. Also, the optimizations were run on both, a network of SUN workstations using the MPICH implementation of the Message Passing Interface (MPI) and on the faster Beowulf cluster at ICASE, NASA Langley Research Center, using the LAM implementation of UP]. The results on both systems were consistent and showed that it is not necessary to verify the derivatives and that this gives a large increase in efficiency of the DMSO algorithm.

Plunkett, C. L.↗

RMACXX: An Efficient High-Level C++ Interface over MPI-3 RMA

Parallel scientific applications can benefit from de- coupling communication and synchronization. One-sided pro- gramming abstractions, which separate communication from syn- chronization, have in fact served as a motivation for partitioned global address space (PGAS) models. However, the use of PGAS models in application codes in a manner that fully exploits the benefit of these programming models requires significant development effort. Meanwhile, a vast majority of scientific codes already use the Message Passing Interface (MPI) and need convenient features to support application-specific one-sided communication scenarios. MPI Remote Memory Access (RMA) can be employed for this purpose. MPI is a low-level API, however, and developing applications with MPI RMA requires programmers to be well versed in its nuances. We present RMACXX, a compact set of C++ bindings to MPI-3 RMA, to ease the use of MPI RMA. Unlike other PGAS models, which may have interoperability issues with MPI, RMACXX is written on top of MPI and uses the same runtime as MPI. The basic functionality of RMACXX adds only a relatively small number of extra instructions (about 20) to the critical communication path. Moreover, RMACXX provides an intuitive API for building a wide variety of scientific applications while enjoying performance matching handwritten MPI-3 RMA codes.

MPI-3 RMA, one-sided communication, PGAS, C++, exp↗

Multi-Operator Multi-UAV (MOMU) Control: Exploring the Influence of Sensor Tools and Playbook Task Delegation

New concepts of operations for Unmanned Aerial Vehicles (UAVs) will require a change from the current 2:1 operator to vehicle crew configuration. One particular control paradigm, largely driven by logistics, manpower, and training burdens, as well as the desire to force multiply, involves a single operator simultaneously managing multiple UAVs. This mode of operations has shown to significantly increase cognitive workload and decrease situation awareness, as operators are required to simultaneously attend to multiple sources of information. One potential way to mitigate potential drawbacks of multi-vehicle control by a single operator is to migrate to a multi-operator multi-UAV (MOMU) crew configuration, whereby M operators control N (> M) vehicles. This type of crew configuration can be organized in several ways to dynamically manage cognitive workload, match operator qualifications and skills to mission requirements, increase utilization of available assets, and thereby achieve maximum force multiplication. The present experiment examined task performance in a simulated MOMU environment and evaluated the potential benefits of sensor management aids ("Tools") as well as integrated sensor and flight automation ("Plays") compared to a fully manual condition ("Manual"). Tools support the operator by facilitating rapid understanding and management of sensor information, while the Plays support the operator by offloading/automating subtasks. Six pairs of participants were recruited for this study and tasked with sharing a pool of UAVs in order to conduct reconnaissance, surveillance, and target acquisition (RSTA) missions in adjacent Areas of Operation (AOs). Participants were given four tasks to accomplish, in order of priority: 1) prosecute High Value Targets (HVTs); 2) identify / track targets (military vehicles); 3) identify / mark civilian vehicles; and 4) respond to chat messages. Performance on the mission tasks was measured in terms of accuracy and reaction time. A composite mission score was also calculated using a payoff matrix that weighted each task according to priority. The results indicate that Playbook demonstrated better performance overall with higher accuracy rates and the highest composite score compared to Tools and Manual. The implications of these results to supporting future MOMU concepts of operations is discussed.

Playbook↗

IYL Blog: Astronomers travel in time and space with light

As an astronomer, I use light to travel through the universe, and to look back in time to when the universe was young. So do you! All of us see things as they were when the light was emitted, not as they are now. The farthest thing you can easily see without a telescope is the Andromeda Nebula, which is a galaxy like the Milky Way, about 2.5 million light years away. You see it as it was 2.5 million years ago, and we really don't know what it looks like today; the disk will have rotated a bit, new stars will have been born, there could have been all kinds of exploding stars, and the black hole in the middle could be lighting up. People may be skeptical of the Big Bang theory, even though we have a TV show named for it, but we (I should say Penzias and Wilson) measured its heat radiation 51 years ago at Bell Telephone Labs in New Jersey. Their discovery marks the beginning of the era of cosmology as a measurement science rather than speculation. Penzias and Wilson received the Nobel Prize in 1978 for their finding, which had been predicted in 1948 by Alpher and Herman. By the way, heat radiation is just another form of light - we call it radiation because we can't see it, but it's exactly the same phenomenon of electromagnetic waves, and the only difference is the wavelength. In the old days of analog television, if you tuned your TV in between channels, about 1% of the snow that you could see came from the Big Bang. So when we look at the heat radiation of the early universe, we really are gazing right at what seems to us a cosmic fireball, which surrounds us completely. It's a bit of an illusion; if you can imagine what astronomers in other galaxies would see, they would also feel surrounded by the fireball, and they would also think they were in the middle. So from a mathematical version of imagination, we conclude that there is no observable center and no edge of our universe, and that the heat of the fireball fills the entire universe uniformly. Astronomers are also using light to find out whether we are alone in the universe. The Kepler observatory showed that thousands of stars blink a little when their orbiting planets pass between us and them, and other observatories use light to measure the wobble of stars as their planets pull on them. Eventually, we will find out whether planets like Earth have atmospheres like Earth's too - with water, carbon dioxide, oxygen, methane, and other gases that would be evidence of photosynthetic life. I think in a few decades we will have evidence that some planets do have life, and it will be done using light for remote chemical analysis. Also, astronomers at the SETI project are using light (long wavelength light we can pick up with radio telescopes) to look for signals from intelligent civilizations. That's a harder project because we don't know what to look for. But if we wanted to send signals all the way across the Milky Way, we could do it with laser beams, and if somebody over there knew what to look for, he or she could decode the message. On with the search! Dr. John C. Mather is a Senior Astrophysicist and is the Senior Project Scientist for the James Webb Space Telescope at NASA's Goddard Space Flight Center in Greenbelt, MD. His research centers on infrared astronomy and cosmology. With the Cosmic Background Explorer (COBE) team, he showed that the cosmic microwave background radiation has a blackbody spectrum within 50 parts per million, confirming the expanding universe model (aka the Big Bang Theory) to extraordinary accuracy, and initiating the study of cosmology as a precision science. The COBE team also made the first map of the hot and cold spots in the background radiation. The COBE maps have been confirmed and improved by two succeeding space missions, the Wilkinson Microwave Anisotropy Probe (WMAP, built by GSFC with Princeton University), and the Planck mission built by ESA. Based on these maps, astronomers have now developed a "standard model" of cosmology and have built detailed numerical simulations that begin to match Hubble observations, and require the existence of both "dark matter" and "dark energy", neither of which has been detected or deduced in laboratory experiments. Dr. Mather is the recipient of numerous awards, including the Nobel Prize in Physics (2006) with George Smoot, for the COBE work, and the NASA Distinguished Service Medal (2007). He is a member of many professional societies including the National Academy of Sciences and the American Academy of Arts and Sciences. Dr. Mather is now working with teams and committees to develop plans for a future great telescope capable of observing signs of life on planets orbiting other stars.

telescopes↗

Algorithms for parallel flow solvers on message passing architectures

The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those immediately adjacent to them, then the first processor in the pipeline will receive a computational load that is less than that of subsequent processors, magnifying the pipeline slowdown effect. Extra compensation is needed for grid boundary effects, even if all grid blocks are equally sized.

Vanderwijngaart, Rob F.↗

Modeling of Radiative Transfer in Protostellar Disks

This program implements a spectral line, radiative transfer tool for interpreting Spitzer Space Telescope observations by matching them with models of protostellar disks for improved understanding of planet and star formation. The Spitzer Space Telescope detects gas phase molecules in the infrared spectra of protostellar disks, with spectral lines carrying information on the chemical composition of the material from which planets form. Input to the software includes chemical models developed at JPL. The products are synthetic images and spectra for comparison with Spitzer measurements. Radiative transfer in a protostellar disk is primarily affected by absorption and emission processes in the dust and in molecular gases such as H2, CO, and HCO. The magnitude of the optical absorption and emission is determined by the population of the electronic, vibrational, and rotational energy levels. The population of the molecular level is in turn determined by the intensity of the radiation field. Therefore, the intensity of the radiation field and the population of the molecular levels are inter-dependent quantities. To meet the computational challenges of solving for the coupled radiation field and electronic level populations in disks having wide ranges of optical depths and spatial scales, the tool runs in parallel on the JPL Dell Cluster supercomputer with C++ and Fortran compiler with a Message Passing Interface. Because this software has been developed on a distributed computing platform, the modeling of systems previously beyond the reach of available computational resources is possible.

VonAllmen, Paul↗

Cooperative Data Sharing: Simple Support for Clusters of SMP Nodes

Libraries like PVM and MPI send typed messages to allow for heterogeneous cluster computing. Lower-level libraries, such as GAM, provide more efficient access to communication by removing the need to copy messages between the interface and user space in some cases. still lower-level interfaces, such as UNET, get right down to the hardware level to provide maximum performance. However, these are all still interfaces for passing messages from one process to another, and have limited utility in a shared-memory environment, due primarily to the fact that message passing is just another term for copying. This drawback is made more pertinent by today's hybrid architectures (e.g. clusters of SMPs), where it is difficult to know beforehand whether two communicating processes will share memory. As a result, even portable language tools (like HPF compilers) must either map all interprocess communication, into message passing with the accompanying performance degradation in shared memory environments, or they must check each communication at run-time and implement the shared-memory case separately for efficiency. Cooperative Data Sharing (CDS) is a single user-level API which abstracts all communication between processes into the sharing and access coordination of memory regions, in a model which might be described as "distributed shared messages" or "large-grain distributed shared memory". As a result, the user programs to a simple latency-tolerant abstract communication specification which can be mapped efficiently to either a shared-memory or message-passing based run-time system, depending upon the available architecture. Unlike some distributed shared memory interfaces, the user still has complete control over the assignment of data to processors, the forwarding of data to its next likely destination, and the queuing of data until it is needed, so even the relatively high latency present in clusters can be accomodated. CDS does not require special use of an MMU, which can add overhead to some DSM systems, and does not require an SPMD programming model. unlike some message-passing interfaces, CDS allows the user to implement efficient demand-driven applications where processes must "fight" over data, and does not perform copying if processes share memory and do not attempt concurrent writes. CDS also supports heterogeneous computing, dynamic process creation, handlers, and a very simple thread-arbitration mechanism. Additional support for array subsections is currently being considered. The CDS1 API, which forms the kernel of CDS, is built primarily upon only 2 communication primitives, one process initiation primitive, and some data translation (and marshalling) routines, memory allocation routines, and priority control routines. The entire current collection of 28 routines provides enough functionality to implement most (or all) of MPI 1 and 2, which has a much larger interface consisting of hundreds of routines. still, the API is small enough to consider integrating into standard os interfaces for handling inter-process communication in a network-independent way. This approach would also help to solve many of the problems plaguing other higher-level standards such as MPI and PVM which must, in some cases, "play OS" to adequately address progress and process control issues. The CDS2 API, a higher level of interface roughly equivalent in functionality to MPI and to be built entirely upon CDS1, is still being designed. It is intended to add support for the equivalent of communicators, reduction and other collective operations, process topologies, additional support for process creation, and some automatic memory management. CDS2 will not exactly match MPI, because the copy-free semantics of communication from CDS1 will be supported. CDS2 application programs will be free to carefully also use CDS1. CDS1 has been implemented on networks of workstations running unmodified Unix-based operating systems, using UDP/IP and vendor-supplied high- performance locks. Although its inter-node performance is currently unimpressive due to rudimentary implementation technique, it even now outperforms highly-optimized MPI implementation on intra-node communication due to its support for non-copy communication. The similarity of the CDS1 architecture to that of other projects such as UNET and TRAP suggests that the inter-node performance can be increased significantly to surpass MPI or PVM, and it may be possible to migrate some of its functionality to communication controllers.

DiNucci, David C.↗

On the Suitability of MPI as a PGAS Runtime

Partitioned Global Address Space (PGAS) models are emerging as a popular alternative to MPI models for designing scalable applications. At the same time, MPI remains a ubiquitous communication subsystem due to its standardization, high performance, and availability on leading platforms. In this paper, we explore the suitability of using MPI as a scalable PGAS communication subsystem. We focus on the Remote Memory Access (RMA) communication in PGAS models which typically includes {\em get, put,} and {\em atomic memory operations}. We perform an in-depth exploration of design alternatives based on MPI. These alternatives include using a semantically-matching interface such as MPI-RMA, as well as not-so-intuitive interfaces such as MPI two-sided with a combination of multi-threading and dynamic process management. With an in-depth exploration of these alternatives and their shortcomings, we propose a novel design which is facilitated by the data-centric view in PGAS models. This design leverages a combination of highly tuned MPI two-sided semantics and an automatic, user-transparent split of MPI communicators to provide asynchronous progress. We implement the asynchronous progress ranks approach and other approaches within the Communication Runtime for Exascale which is a communication subsystem for Global Arrays. Our performance evaluation spans pure communication benchmarks, graph community detection and sparse matrix-vector multiplication kernels, and a computational chemistry application. The utility of our proposed PR-based approach is demonstrated by a 2.17x speed-up on 1008 processors over the other MPI-based designs.

Computational modeling↗