Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallelization efficiency”

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.

At least 1,495 records · Page 83

Testbed Environment for Space Situational Awareness: The world’s most accurate simulation of space debris and orbital object tracking

The Testbed Environment for Space Situational Awareness (TESSA) is a modeling and simulation environment designed for efficient exploration of scenarios involving satellites and space debris and their detection by both ground and space-based radars and optical sensors. TESSA is a Parallelized Discrete Event Simulator optimized for deployment on a large cluster of high-performance computers running Linux. TESSA includes capabilities for predicting the future location of a satellite using the satellite’s current location and velocity, determining an object’s orbit from sensor data, finding new orbital objects, predicting close approaches, determining the probability of collisions, modeling radar and optical and dynamic sensors, and modeling the generation of debris. TESSA also includes a scalable visualization environment implemented as a post-processor on workstation-class platforms.

42 ENGINEERING↗

Institute for Sustained Performance, Energy, and Resilience (SuPER)

The University of Tennessee (UTK) and University of Texas at El Paso (UTEP) partnership supported the three main thrusts of the SUPER project---performance, energy, and resilience. The UTK-UTEP effort thus helped advance the main goal of SUPER, which was to ensure that DOE's computational scientists can successfully exploit the emerging generation of high performance computing (HPC) systems. This goal is being met by providing application scientists with strategies and tools to productively maximize performance, conserve energy, and attain resilience. The primary vehicle through which UTK provided performance measurement support to SUPER and the larger HPC community is the Performance Application Programming Interface (PAPI). PAPI is an ongoing project that provides a consistent interface and methodology for collecting hardware performance information from various hardware and software components, including most major CPUs, GPUs and accelerators, interconnects, I/O systems, and power interfaces, as well as virtual cloud environments. The PAPI software is widely used for performance modeling of scientific and engineering applications---for example, the HOMME (High Order Methods Modeling Environment) climate code, and the GAMESS and NWChem computational chemistry codes---on DOE supercomputers. PAPI is widely deployed as middleware for use by higher-level profiling, tracing, and sampling tools (e.g., CrayPat, HPCToolkit, Scalasca, Score-P, TAU, Vampir, PerfExpert), making it the de facto standard for hardware counter analysis. PAPI has established itself as fundamental software infrastructure in every application domain (spanning academia, government, and industry), where improving performance can be mission critical. Ultimately, as more application scientists migrate their applications to HPC platforms, they will benefit from the extended capabilities this grant brought to PAPI to analyze and optimize performance in these environments, whether they use PAPI directly, or via third-party performance tools. Capabilities added to PAPI through this grant include support for new architectures such as the lastest GPU and Xeon Phi accelerators, and advanced power measurement and management features. Another important topic for the UTK team was providing support for a rich ecosystem of different fault management strategies in the context of parallel computing. Our long term efforts have been oriented toward proposing flexible strategies and providing building boxes that application developers can use to build the most efficient fault management technique for their application. These efforts span across the entire software spectrum, from theoretical models of existing strategies to easily assess their performance, to algorithmic modifications to take advantage of specific mathematical properties for data redundancy and to extensions to widely used programming paradigms to empower the application developers to deal with all types of faults. We have also continued our tight collaborations with users to help them adopt these technologies to ensure their application always deliver meaningful scientific data. Large supercomputer systems are becoming more and more power and energy constrained, and future systems and applications running on them will need to be optimized to run under power caps and/or minimize energy consumption. The UTEP team contributed to the SUPER energy thrust by developing power modeling methodologies and investigating power management strategies. Scalability modeling results showed that some applications can scale better with respect to an increasing power budget than with respect to only the number of processors. Power management, in particular shifting power to processors on the critical path of an application execution, can reduce perturbation due to system noise and other sources of runtime variability, which are growing problems on large-scale power-constrained computer systems.

42 ENGINEERING↗

Filter Aerosol Measurements for ARM

The goal of this study was to determine the best filter media for use in Atmospheric Radiation Measurement (ARM) particle soot absorption photometers (PSAPs) following the manufacturer discontinuation of the current filter media. The study comprised multiple experiments to assess four potential replacement filter medium relative to the Pallflex E-70, which is being discontinued, and is documented in ARM’s ServiceNow system under ENG0003846. The experiments laid out in the document ‘180504 Filter Aerosol Measurements for ARM.docx’ and several subsequent tests suggest that the Pallflex Emfab media is the best candidate for ongoing ARM filter-based absorbance measurements. Other media were ruled out based on particle capture efficiency for small particles. In tests with Nigrosin, Emfab exceeded all other media. Tests were done measuring reported absorbance for all media in PSAPs operated in parallel sampling under several conditions: ambient air, three sizes of black-dyed PSL (polystyrene latex) spheres, and Nigrosin particles. These tests indicate a different factor of reported absorbance for each media relative to the original Pallflex E70 filter. The factor for the Azumi media was consistent with unpublished work by Ogren (National Oceanic and Atmospheric Administration [NOAA]). The tests described here were not exhaustive and were complicated by time-varying differences among the PSAPs used. However, it is concluded that they are sufficient to justify ARM switching to Emfab filter media for future ARM PSAP measurements. The remaining store of E70 will be reserved to quantitatively characterize differences between Emfab and E70 (and Azumi?) in both laboratory and field side-by-side tests as put forth in a succeeding ENG. This future work will empirically identify correction factors applicable to Emfab and quantify the uncertainty in comparing the historical E70 measurements with ongoing Emfab measurements. Comparison of PSAP measurements with an independent absolute ‘reference’ for aerosol absorbance, i.e., photo thermal interferometry or difference measurements of cavity attenuated phase shift extinction (CAPS) minus nephelometry scattering, would be valuable but exceed the scope of ARM Infrastructure. While the characterization of correction factors is required for maintaining and improving accuracy in future absorption measurements, it was beyond the scope of the current study.

aerosol observing system↗

Modeling Long-Term Changes in Climate, Ice Sheets and Sea Level: Using the Paleo Record to Understand Possibilities for the Future

During the project, we completed the development and testing of the infrastructure for coupled CESM-CISM paleo-simulations. Our development and testing efforts have focused on (1) CISM2, a parallel, scalable code with a suite of higher-order ice-flow solvers, (2) conservative, two-way coupling of CISM and CLM, (3) an efficient spinup method for coupled CESM-CISM simulations, and (4) inclusion of processes important for long, millennial-scale simulations (dynamic topography, orbital acceleration, asynchronous coupling to dynamic vegetation) and their evaluation (isotopes).

58 GEOSCIENCES↗

High Throughput Discovery of Thermoelectric Materials (Final Report)

New materials form the heart of advances in energy technologies; however, the actual synthesis and characterization of new materials remains an enormous bottleneck. In this award, the research team focused on developing new approaches overcome this bottleneck. The approach involved depositing at high (supersonic) velocity multiple crystalline materials at a substrate while controlling the resulting film composition. The film could then be annealed to create a homogeneous alloy that was suitable for characterization. High throughput characterization tools were developed in parallel. The research focused on thermoelectric materials, which convert the flow of heat into electrical power. The development of new thermoelectric materials with high power conversion efficiency could displace traditional mechanical heat engines (e.g. turbines).

30 DIRECT ENERGY CONVERSION↗

Experimental Studies of Particle Acceleration and Heating During Magnetic Reconnection

Energy conversion from magnetic energy to particle energy during magnetic reconnection is studied in the collisionless plasma of the Magnetic Reconnection Experiment (MRX). The plasma is in the two-fluid regime, where the ion motion is decoupled from that of the electron within the so-called ion diffusion region. For ion heating and acceleration, the role of the in-plane (Hall) electric field is emphasized. The in-plane potential responsible for the Hall electric field is established by electrons that are accelerated near the small electron diffusion region. The in-plane electrostatic potential profile shows a well structure along the direction normal to the reconnection current sheet that becomes deeper and wider downstream as its boundary expands along the separatrices where the in-plane electric field is strongest. Since the Hall electric field is 3--4 times larger than the reconnection electric field, unmagnetized ions obtain energy mostly from the in-plane electric field, especially near the separatrices. The Hall electric field ballistically accelerates ions near the separatrices toward the outflow direction. After ions are accelerated, they are heated as they travel into the high pressure downstream region. This downstream ion heating cannot be explained by classical, unmagnetized transport theory, which suggests that the magnetic field should be important due to an effect called re-magnetization. Electrons are also significantly heated during reconnection. The electron temperature sharply increases across the separatrices and peaks just outside of the electron diffusion region. Unlike ions, electrons acquire energy mostly from the reconnection electric field and the energy gain is localized near the X-point. However, the electron bulk flow energy increase remains negligible. These observations support the assertion that efficient electron heating mechanisms exist around the electron diffusion region and that the generated heat is quickly transported along the magnetic field due to the high parallel thermal conductivity of electrons. Classical Ohmic dissipation based on the perpendicular Spitzer resistivity is too small to compensate the heat flux, indicating the presence of anomalous electron heating. Finally, a total energy inventory is calculated based on analysis of the Poynting, enthalpy, flow energy, and heat flux in the measured diffusion layer. More than half of the incoming magnetic energy is converted to particle energy during collisionless reconnection. Unlike in the Sweet-Parker model, the outgoing Poynting flux is not negligible, which is due to considerable Hall fields, i.e., the quadrupole out-of-plane magnetic field and the in-plane electric field. The total ion energy gain during reconnection is larger than that of electrons, since the energy gain occurs over a broader region. The total ion thermal energy gain is larger than the increase of the ion flow energy. Finally, the electron thermal energy gain is comparable to the ion thermal energy gain, while the electron flow energy remains insignificant.

electron heating↗

Personalized Infrastructure: Leveraging Behavioral Strategies for Future Mobility

For decades, the transportation system has been built to position the personal automobile at the pinnacle of mobility options. This prominence is strongly reflected in individual and population behaviors, and supported by coevolved transportation policy, social norms, funding, and physical structures. Such has been the status quo for the living memory of the U.S. population. However, with the advent of emergent, technologically driven mobility options, the transportation system is in an era of rapid and disruptive change. No longer is transportation infrastructure an externality predominantly composed of physical elements; it is also now a personalized interface carried in the pockets of the majority of the population. Perceptions of personal mobility are evolving, in large part because of the proliferation of smartphone technology and the related Internet of Things (IoT), which will become increasingly essential within future transportation systems. With the emergence of personalized mobility infrastructure, many intervention approaches to influence transportation behavior do not adequately acknowledge the complexity of the social/digital environment within which transportation decisions are made. Transportation decisions are influenced by multiple facets, including costs and benefits in time and money, but also by sociocultural elements shaped by social norms and diffusion of ideas. Understanding of factors that lead to transportation behaviors can help to identify incentives and leverage points whereby alternative choices may be most accepted by individuals, and which, if well coordinated, may lead to improved transportation energy outcomes. How can change be initiated to shift away from the transportation status quo? Is it possible to use technologically delivered incentives to produce meaningful changes in transportation behavior? What types of incentives and at what perceived value is necessary to induce changes in behavior? As transportation agencies look toward an ever more complex mobility landscape, and with a quickly growing population, we look for answers to these questions as the core of developing strategies for the future of transportation. Using available data from emergent modes, and experiments conducted as part of an Advanced Research Projects Agency - Energy (ARPA-E) Traveler Response Architecture using Novel Signaling for Network Efficiency in Transportation (TRANSNET) project, we look at how the sharing economy and transportation mobility services have begun to radically alter transportation behavior, while operating in parallel with traditional transportation infrastructure. Emerging modes and practices are affecting car dependence and enabling multimodality. We weigh influences on travel behaviors, identify decision breakpoints where inelastic behavior becomes elastic, incentives, and societal leverage points.

25 ENERGY STORAGE↗

A PIC Bootstrapping Strategy for Exascale CFD-DEM Simulation

The exascale computing era comes with the release of MFIX-Exa, a new code for studying gas-particle fluidization using CFD-DEM and PIC models on massively parallel, heterogeneous high-performance computing architectures. However, as compute resources continue to grow in scale and complexity, so too does the impetus to use them efficiently. Here, we propose a novel bootstrapping method to minimize neglected simulation time and cast the approach more broadly among a growing field of multi-fidelity methods.

Porcu, Roberto↗

ACE3P Computations of Wakefield Coupling in the CLIC Two-Beam Accelerator

The Compact Linear Collider (CLIC) provides a path to a multi-TeV accelerator to explore the energy frontier of High Energy Physics. Its novel two-beam accelerator concept envisions rf power transfer to the accelerating structures from a separate high-current decelerator beam line consisting of power extraction and transfer structures (PETS). It is critical to numerically verify the fundamental and higher-order mode properties in and between the two beam lines with high accuracy and confidence. To solve these large-scale problems, SLAC's parallel finite element electromagnetic code suite ACE3P is employed. Using curvilinear conformal meshes and higher-order finite element vector basis functions, unprecedented accuracy and computational efficiency are achieved, enabling high-fidelity modeling of complex detuned structures such as the CLIC TD24 accelerating structure. In this paper, time-domain simulations of wakefield coupling effects in the combined system of PETS and the TD24 structures are presented. The results will help to identify potential issues and provide new insights on the design, leading to further improvements on the novel CLIC two-beam accelerator scheme.

43 PARTICLE ACCELERATORS↗

Runtime Detection of C-Style Errors in UPC Code

Unified Parallel C (UPC) extends the C programming language (ISO C 99) with explicit parallel programming support for the partitioned global address space (PGAS), which provides a global memory space with localized partitions to each thread. Like its ancestor C, UPC is a low-level language that emphasizes code efficiency over safety. The absence of dynamic (and static) safety checks allows programmer oversights and software flaws that can be hard to spot. In this paper, we present an extension of a dynamic analysis tool, ROSE-Code Instrumentation and Runtime Monitor (ROSECIRM), for UPC to help programmers find C-style errors involving the global address space. Built on top of the ROSE source-to-source compiler infrastructure, the tool instruments source files with code that monitors operations and keeps track of changes to the system state. The resulting code is linked to a runtime monitor that observes the program execution and finds software defects. We describe the extensions to ROSE-CIRM that were necessary to support UPC. We discuss complications that arise from parallel code and our solutions. We test ROSE-CIRM against a runtime error detection test suite, and present performance results obtained from running error-free codes. ROSE-CIRM is released as part of the ROSE compiler under a BSD-style open source license.

97 MATHEMATICS AND COMPUTING↗

SPACE: 3D parallel solvers for Vlasov-Maxwell and Vlasov-Poisson equations for relativistic plasmas with atomic transformations

A parallel, relativistic, three-dimensional particle-in-cell code SPACE has been developed for the simulation of electromagnetic fields, relativistic particle beams, and plasmas. In addition to the standard second-order Particle-in-Cell (PIC) algorithm, SPACE includes efficient novel algorithms to resolve atomic physics processes such as multi-level ionization of plasma atoms, recombination, and electron attachment to dopants in dense neutral gases. SPACE also contains a highly adaptive particle-based method, called Adaptive Particle-in-Cloud (AP-Cloud), for solving the Vlasov-Poisson problems. It eliminates the traditional Cartesian mesh of PIC and replaces it with an adaptive octree data structure. The code's algorithms, structure, capabilities, parallelization strategy, and performance have been discussed. Additionally, typical examples of SPACE applications to accelerator science and engineering problems are described.

43 PARTICLE ACCELERATORS↗

Robustness of Deep Learning Classification to Adversarial Input on GPUs: Asynchronous Parallel Accumulation Is a Source of Vulnerability

The ability of machine learning (ML) classification models to resist small, targeted input perturbations—known as adversarial attacks—is a key measure of their safety and reliability. We show that floating-point non associativity (FPNA) coupled with asynchronous parallel programming on GPUs is sufficient to result in misclassification, without any perturbation to the input. Additionally, we show that this misclassification is particularly significant for inputs close to the decision boundary and that standard adversarial robustness results may be overestimated up to 4.6 when not considering machine-level details. We first study a linear classifier, before focusing on standard Graph Neural Network (GNN) architectures and datasets used in robustness assessments. We develop a novel black-box attack using Bayesian optimization to discover external workloads that can change the instruction scheduling which bias the output of reductions on GPUs and reliably lead to misclassification. Motivated by these results, we present a new learnable permutation (LP) gradient-based approach to learning floating-point operation orderings that lead to misclassifications. The LP approach provides a worst-case estimate in a computationally efficient manner, avoiding the need to run identical experiments tens of thousands of times over a potentially large set of possible GPU states or architectures. Finally, using instrumentation-based testing, we investigate parallel reduction ordering across different GPU architectures under external background workloads, when utilizing multi-GPU virtualization, and when applying power capping. Our results demonstrate that parallel reduction ordering varies significantly across architectures under the first two conditions, substantially increasing the search space required to fully test the effects of this parallel scheduler-based vulnerability. These results and the methods developed here can help to include machine-level considerations into adversarial robustness assessments, which can make a difference in safety and mission critical applications.

Shanmugavelu, Sanjif [Maxeler Technologies, a Groq↗

TuckerMPI: A Parallel C++/MPI Software Package for Large-scale Data Compression via the Tucker Tensor Decomposition

With this study, our goal is compression of massive-scale grid-structured data, such as the multi-terabyte output of a high-fidelity computational simulation. For such data sets, we have developed a new software package called TuckerMPI, a parallel C++/MPI software package for compressing distributed data. The approach is based on treating the data as a tensor, i.e., a multidimensional array, and computing its truncated Tucker decomposition, a higher-order analogue to the truncated singular value decomposition of a matrix. The result is a low-rank approximation of the original tensor-structured data. Compression efficiency is achieved by detecting latent global structure within the data, which we contrast to most compression methods that are focused on local structure. In this work, we describe TuckerMPI, our implementation of the truncated Tucker decomposition, including details of the data distribution and in-memory layouts, the parallel and serial implementations of the key kernels, and analysis of the storage, communication, and computational costs. We test the software on 4.5 and 6.7 terabyte data sets distributed across 100 s of nodes (1,000 s of MPI processes), achieving compression ratios between 100 and 200,000×, which equates to 99--99.999% compression (depending on the desired accuracy) in substantially less time than it would take to even read the same dataset from a parallel file system. Moreover, we show that our method also allows for reconstruction of partial or down-sampled data on a single node, without a parallel computer so long as the reconstructed portion is small enough to fit on a single machine, e.g., in the instance of reconstructing/visualizing a single down-sampled time step or computing summary statistics. The code is available at https://gitlab.com/tensors/TuckerMPI.

97 MATHEMATICS AND COMPUTING↗

Immersed Boundary Method Halo Exchange in a Hemodynamics Application

In recent years, highly parallelized simulations of blood flow resolving individual blood cells have been demonstrated. Simulating such dense suspensions of deformable particles in flow often involves a partitioned fluid-structure interaction (FSI) algorithm, with separate solvers for Eulerian fluid and Lagrangian cell grids, plus a solver - e.g., immersed boundary method - for their interaction. Managing data motion in parallel FSI implementations is increasingly important, particularly for inhomogeneous systems like vascular geometries. In this study, we evaluate the influence of Eulerian and Lagrangian halo exchanges on efficiency and scalability of a partitioned FSI algorithm for blood flow. We describe an MPI+OpenMP implementation of the immersed boundary method coupled with lattice Boltzmann and finite element methods. We consider how communication and recomputation costs influence the optimization of halo exchanges with respect to three factors: immersed boundary interaction distance, cell suspension density, and relative fluid/cell solver costs.

Gounley, John↗

General field evaluation in high-order meshes on GPUs

Robust and scalable function evaluation at any arbitrary point in the finite/spectral element mesh is required for querying the partial differential equation solution at points of interest, comparison of solution between different meshes, and Lagrangian particle tracking. This is a challenging problem, particularly for high-order unstructured meshes partitioned in parallel with MPI, as it requires identifying the element that overlaps a given point and computing the corresponding reference space coordinates. Here, we present a robust and efficient technique for general field evaluation in large-scale high-order meshes with quadrilaterals and hexahedra. In the proposed method, a combination of globally partitioned and processor-local maps are used to first determine a list of candidate MPI ranks, and then locally candidate elements that could contain a given point. Next, element-wise bounding boxes further reduce the list of candidate elements. Finally, Newton’s method with trust region is used to determine the overlapping element and corresponding reference space coordinates. Since GPU-based architectures have become popular for accelerating computational analyses using meshes with tensor-product elements, specialized kernels have been developed to utilize the proposed methodology on GPUs. The method is also extended to enable general field evaluation on surface meshes. The paper concludes by demonstrating the use of the proposed method in various applications ranging from mesh-to-mesh transfer during r-adaptivity to Lagrangian particle tracking.

97 MATHEMATICS AND COMPUTING↗

HiPACE++: A portable, 3D quasi-static particle-in-cell code

Modeling plasma accelerators is a computationally challenging task and the quasi-static particle-in-cell algorithm is a method of choice in a wide range of situations. In this work, we present the first performance-portable, quasi-static, three-dimensional particle-in-cell code HiPACE++. By decomposing all the computation of a 3D domain in successive 2D transverse operations and choosing appropriate memory management, HiPACE++ demonstrates orders-of-magnitude speedups on modern scientific GPUs over CPU-only implementations. The 2D transverse operations are performed on a single GPU, avoiding time-consuming communications. The longitudinal parallelization is done through temporal domain decomposition, enabling near-optimal strong scaling from 1 to 512 GPUs. HiPACE++ is a modular, open-source code enabling efficient modeling of plasma accelerators from laptops to state-of-the-art supercomputers.

97 MATHEMATICS AND COMPUTING↗

Parallel adaptation of general three-dimensional hybrid meshes

A new parallel dynamic mesh adaptation and load balancing algorithm for general hybrid grids has been developed. The meshes considered in this work are composed of four kinds of elements; tetrahedra, prisms, hexahedra and pyramids, which poses a challenge to parallel mesh adaptation. Additional complexity imposed by the presence of multiple types of elements affects especially data migration, updates of local data structures and interpartition data structures. Efficient partition of hybrid meshes has been accomplished by transforming them to suitable graphs and using serial graph partitioning algorithms. Communication among processors is based on the faces of the interpartition boundary and the termination detection algorithm of Dijkstra is employed to ensure proper flagging of edges for refinement. An inexpensive dynamic load balancing strategy is introduced to redistribute work load among processors after adaptation. In particular, only the initial coarse mesh, with proper weighting, is balanced which yields savings in computation time and relatively simple implementation of mesh quality preservation rules, while facilitating coarsening of refined elements. Special algorithms are employed for (i) data migration and dynamic updates of the local data structures, (ii) determination of the resulting interpartition boundary and (iii) identification of the communication pattern of processors. Several representative applications are included to evaluate the method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Space–time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems

A classical reduced order model for dynamical problems involves spatial reduction of the problem size. However, temporal reduction accompanied by the spatial reduction can further reduce the problem size without losing much accuracy, which results in a considerably more speed-up than the spatial reduction only. Recently, a novel space–time reduced order model for dynamical problems has been developed [17], where the space–time reduced order model shows an order of a hundred speed-up with a relative error of 10 –4 for small academic problems. However, in order for the method to be applicable to a large-scale problem, an efficient space–time reduced basis construction algorithm needs to be developed. Here we present the incremental space–time reduced basis construction algorithm. The incremental algorithm is fully parallel and scalable. Additionally, the block structure in the space–time reduced basis is exploited, which enables the avoidance of constructing the reduced space–time basis. These novel techniques are applied to a large-scale particle transport simulation with million and billion degrees of freedom. The numerical example shows that the algorithm is scalable and practical. Also, it achieves a tremendous speed-up, maintaining a good accuracy. Finally, error bounds for space-only and space–time reduced order models are derived.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗