Search NASA⌕ Search

SEARCH · Search NASA

Results for “high performance parallel computing”

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 667 records · Page 37

ArborX: A Performance Portable Geometric Search Library

Searching for geometric objects that are close in space is a fundamental component of many applications. The performance of search algorithms comes to the forefront as the size of a problem increases both in terms of total object count as well as in the total number of search queries performed. Scientific applications requiring modern leadership-class supercomputers also pose an additional requirement of performance portability, i.e., being able to efficiently utilize a variety of hardware architectures. In this article, we introduce a new open-source C++ search library, ArborX, which we have designed for modern supercomputing architectures. Herein, we examine scalable search algorithms with a focus on performance, including a highly efficient parallel bounding volume hierarchy implementation, and propose a flexible interface making it easy to integrate with existing applications. We demonstrate the performance portability of ArborX on multi-core CPUs and GPUs and compare it to the state-of-the-art libraries such as Boost.Geometry.Index and nanoflann.

97 MATHEMATICS AND COMPUTING↗

Electronic Bottleneck Suppression in Next‐Generation Networks with Integrated Photonic Digital‐to‐Analog Converters

Digital‐to‐analog converters (DAC) are indispensable functional units in signal processing instrumentation and wide‐band telecommunication links for both civil and military applications. As photonic systems are capable of high data throughput and low latency, an increasingly found system limitation stems from the required domain crossing such as digital to analog and electronic to optical. A photonic DAC implementation, in contrast, enables a seamless signal conversion with respect to both energy efficiency and short signal delay, often requiring bulky discrete optical components and electric–optic transformation, hence introducing inefficiencies. Herein, a novel coherent parallel photonic DAC concept along with a 4‐bit experimental prototype capable of performing this DAC without optic–electric–optic domain crossing is introduced. This new paradigm guarantees a linear intensity weighting among bits when operating at high sampling rates (50 GHz), featuring an exceptional sampling efficiency (> 100 GS ) and small footprint (≈1 mm 2 ) in an 8‐bit implementation. Importantly, this photonic DAC enables seamless interfaces of next‐generation data processing hardware with high relevance in data centers, task‐specific compute accelerators such as neuromorphic engines, and network edge processing applications.

Meng, Jiawei↗

Decaf: Decoupled Dataflows for In Situ High-Performance Workflows

Decaf is a dataflow system for the parallel communication of coupled tasks in an HPC workflow. The dataflow can perform arbitrary data transformations ranging from simply forwarding data to complex data redistribution. Decaf does this by allowing the user to allocate resources and execute custom code in the dataflow. All communication through the dataflow is efficient parallel message passing over MPI. The runtime for calling tasks is entirely message-driven; Decaf executes a task when all messages for the task have been received. Such a messagedriven runtime allows cyclic task dependencies in the workflow graph, for example, to enact computational steering based on the result of downstream tasks. Decaf includes a simple Python API for describing the workflow graph. This allows Decaf to stand alone as a complete workflow system, but Decaf can also be used as the dataflow layer by one or more other workflow systems to form a heterogeneous task-based computing environment. In one experiment, we couple a molecular dynamics code with a visualization tool using the FlowVR and Damaris workflow systems and Decaf for the dataflow. In another experiment, we test the coupling of a cosmology code with Voronoi tessellation and density estimation codes using MPI for the simulation, the DIY programming model for the two analysis codes, and Decaf for the dataflow. Such workflows consisting of heterogeneous software infrastructures exist because components are developed separately with different programming models and runtimes, and this is the first time that such heterogeneous coupling of diverse components was demonstrated in situ on HPC systems.

97 MATHEMATICS AND COMPUTING↗

High Performance Interactive System Dynamics Visualization

This brochure describes a system dynamics simulation (SD) framework that supports an end-to-end analysis workflow that is optimized for deployment on ESIF facilities(Peregrine and the Insight Center). It includes (I) parallel and distributed simulation of SD models, (ii) real-time 3D visualization of running simulations, and (iii) comprehensive database-oriented persistence of simulation metadata, inputs, and outputs.

97 MATHEMATICS AND COMPUTING↗

High Performance Interactive System Dynamics Visualization

This presentation describes a system dynamics simulation (SD) framework that supports an end-to-end analysis workflow that is optimized for deployment on ESIF facilities(Peregrine and the Insight Center). It includes (I) parallel and distributed simulation of SD models, (ii) real-time 3D visualization of running simulations, and (iii) comprehensive database-oriented persistence of simulation metadata, inputs, and outputs.

97 MATHEMATICS AND COMPUTING↗

Parallel algorithms for finding connected components using linear algebra

Finding connected components is one of the most widely used operations on a graph. Optimal serial algorithms for the problem have been known for half a century, and many competing parallel algorithms have been proposed over the last several decades under various different models of parallel computation. This paper presents a class of parallel connected-component algorithms designed using linear-algebraic primitives. These algorithms are based on a PRAM algorithm by Shiloach and Vishkin and can be designed using standard GraphBLAS operations. Here, we demonstrate two algorithms of this class, one named LACC for Linear Algebraic Connected Components, and the other named FastSV which can be regarded as LACC’s simplification. With the support of the highly-scalable Combinatorial BLAS library, LACC and FastSV outperform the previous state-of-the-art algorithm by a factor of up to 12x for small to medium scale graphs. For large graphs with more than 50B edges, LACC and FastSV scale to 4K nodes (262K cores) of a Cray XC40 supercomputer and outperform previous algorithms by a significant margin. This remarkable performance is accomplished by (1) exploiting sparsity that was not present in the original PRAM algorithm formulation, (2) using high-performance primitives of Combinatorial BLAS, and (3) identifying hot spots and optimizing them away by exploiting algorithmic insights.

97 MATHEMATICS AND COMPUTING↗

Threadsafe Dynamic Neighbor Lists for Monte Carlo Ray Tracing

Monte Carlo (MC) transport codes offer high-fidelity modeling of particle transport physics, but their high computational cost makes them impractical for many applications. For some applications such as multiphysics and depletion that use finely discretized geometries, a large portion of this computational cost is attributable to ray tracing. Neighbor lists are a well-known method for accelerating ray-tracing calculations in a MC code, but despite their prevalence, little work has been published on the details of their implementation. The fine details can have a significant impact on performance, particularly when using shared-memory parallelism. This paper addresses these details of implementation with a discussion of different neighbor list schemes and their impact on software runtime. Performance tests were run by using OpenMC on a pin-cell problem discretized with up to 200 axial regions. The results demonstrate that switching from surface-based to cell-based neighbor lists leads to a 10 faster calculation rate for the most fine discretization. Finally, using a threadsafe shared-memory data structure results in a 20% faster calculation rate versus simple threadprivate neighbor lists. Results here show that a data structure that is contiguous in memory improves performance by only 1% to 2% over noncontiguous linked lists.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Sparse Symmetric Format for Tucker Decomposition

Tensor-based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making them an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTM c ) in general sparse tensors, the $\underline{S}$ parse $\underline{S}$ ymmetric $\underline{T}$ ensor $\underline{T}$ imes $\underline{S}$ ame $\underline{M}$ atrix $\underline{c}$ hain (S 3 TTM c ) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. We present the novel Compressed Sparse Symmetric (CSS) format for sparse symmetric tensors, along with an efficient parallel algorithm for the S 3 TTM c operation. We theoretically establish that S 3 TTM c on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations, and visualize the variation of the performance gap over the parameter space. We demonstrate experimental findings that confirm these results and achieve up to 2.72× speedup on synthetic and real datasets. The scaling of the algorithm on different test architectures is also showcased to highlight the effect of machine characteristics on algorithm performance.

42 ENGINEERING↗

Scalable Cloning on Large-Scale GPU Platforms with Application to Time-Stepped Simulations on Grids

Cloning is a technique to efficiently simulate a tree of multiple what-if scenarios that are unraveled during the course of a base simulation. However, cloned execution is highly challenging to realize on large, distributed memory computing platforms, due to the dynamic nature of the computational load across clones, and due to the complex dependencies spanning the clone tree. In this paper, we present the conceptual simulation framework, algorithmic foundations, and runtime interface of CloneX, a new system we designed for scalable simulation cloning. It efficiently and dynamically creates whole logical copies of a dynamic tree of simulations across a large parallel system without full physical duplication of computation and memory. The performance of a prototype implementation executed on up to 1,024 graphical processing units of a supercomputing system has been evaluated with three benchmarks—heat diffusion, forest fire, and disease propagation models—delivering a speed up of over two orders of magnitude compared to replicated runs. Finally, the results demonstrate a significantly faster and scalable way to execute many what-if scenario ensembles of large simulations via cloning using the CloneX interface.

97 MATHEMATICS AND COMPUTING↗

Expanded Capabilities and Opportunities for Virtual Beamline Code

In the 25 years since LLNL broke ground on the National Ignition Facility (NIF) - a cornerstone of the National Nuclear Security Administration’s Stockpile Stewardship Program - the NIF and Photon Science (NIF&PS) Directorate has steadily pushed the boundaries of laser physics, nonlinear optics, and photonics in service of inertial confinement fusion experiments, and advanced photon sources development. Beyond the 192 beamlines of the primary laser facility with its world-record energy and fusion yields, NIF&PS capabilities have expanded to include chirped-pulse amplification, kilojoule petawatt-class short-pulse systems to generate hard x-ray radiographic probes, high-average power lasers as secondary sources for generation or wake field particle acceleration along directed energy applications, and other scientific pursuits. The Computing Directorate partners with NIF&PS on numerous projects and technologies from diagnostic measurements and high performance control systems to data analysis, information technology infrastructure, and scientific simulation code development. “This strong collaboration enables cutting-edge science, particularly with regard to physics-based modeling and simulation,” says physicist Jean-Michel Di Nicola. One crucial capability for NIF&PS is the Virtual Beamline (VBL) laser simulation code. It can model all the major laser physics and technology involved in the design optimization, commissioning, and operations of advanced laser architectures from tabletop to NIF-scale. VBL provides researchers with high-fidelity models and high-resolution calculations of laser performance predictions—including for the entire NIF laser system, the Advanced Radiographic Capability, parts of the High Repetition-Rate Advanced Petawatt Laser System laser delivered to the Czech Republic, and the Optical Science Laser. After more than two decades of experimentally verified physics and computing enhancements, this unique workhorse code is wrapping up another major milestone: migration from Java to C++ with a flurry of user interface and optimization features, as well as laser physics and high-resolution enhancements thanks to parallel execution on Livermore Computing platforms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

BSTC: A Novel Binarized-Soft-Tensor-Core Design for Accelerating Bit-Based Approximated Neural Nets

Binarized neural network (or BNN) promises tremendous performance improvement over traditional DNNs through simplified bit-level computation and significantly reduced memory access/storage cost. In addition, it has other advantages of low-cost, low-energy and high-robustness, showing great utilization potential in resources-constrained, volatile and latency-critical applications, which are critical for future HPC execution. However, the promised significant performance gain of BNN inference has never been fully demonstrated on general-purpose processors, particularly on GPUs, due to: (i) the challenge to extract and leverage sufficient fine-grained bit-level-parallelism to saturate GPU cores when batch is small; (ii) the fundamental design conflict between bit-based BNN algorithm and underlying word-based architecture; (iii) architecture \& performance unfriendly BNN network design. To address (i) and (ii), we propose binarized-soft-tensor-core as a software-hardware codesign approach to construct bit-manipulation capability for modern GPUs to effectively harvest the emerging bit-level-parallelism. To tackle (iii), we propose intra- and inter-layer fusion techniques so that the entire BNN inference can be packed into a single GPU kernel, to avoid high-cost frequent launching. Experiments demonstrate that our design can achieve over 1000x speedup for raw inference latency and 10x for inference throughput over the state-of-the-art full-precision simulated BNN inference for AlexNet on ImageNet.

Li, Ang↗

Electrofracturing of Shale at Elevated Pressure

Electrofracturing deeply buried shale formations could be used to increase reservoir permeability and improve reservoir production without requiring large volumes of freshwater. This paper describes a novel experimental system and initial test results to electrofracture shale under high confining pressures. Core-scale laboratory testing was performed on twelve rock samples recovered from a shale gas reservoir. Each sample was subjected to confining pressures of 20.7 MPa (3000 psi) or 58.6 MPa (8000 psi), representative of overburden pressures at depth. Samples were then subjected to application of high voltage until specimen fracture. The experiments produced deformed samples with multiple fracture types, both parallel and oblique to bedding planes. Electrofracturing increased permeabilities by up to nine orders of magnitude for extended time periods. Rock fracture and throughgoing fractures were demonstrated. Computed tomography images revealed the creation of fractures and tube/tunnel flow channels, which resisted closure under hydrostatic pressures up to 58.6 MPa. The breakdown energy and permeability changes in the sample were independent of applied confining pressure. The cumulative energy input required for fracture depended on applied confining pressure and sample length. The energy required to fracture samples up to 9 cm in length is generally more than 0.5 kJ/cm, but no greater than 1 kJ/cm. Our results show that electrofracture of shales under confining pressure is possible and could be a possible water-free mechanism for reservoir stimulation.

04 OIL SHALES AND TAR SANDS↗

An Integrated High-performance Computing and Digital Real-time Simulation Testbed to Benchmark Closed-loop Load Shedding Algorithms in Power Systems

An integrated testbed using digital real-time simulator (DRTS) and a high-performance computing (HPC) cluster is presented here to compare speed and performance of computational schemes to mitigate time-critical issues in electric power systems. The first approach in this testbed validation is taken by running a set of closed-loop load shedding algorithms to compare and contrast two paradigms of arresting cascading failure propagation. Two algorithms involve solving DC and AC power flow model-based optimization problems to compute load shedding at different buses, while a model-based stochastic search using parallel computing provides a viable alternative. The algorithms are implemented in the DRTS-HPC testbed for the IEEE 14-bus benchmark transmission system. As a proof of the concept, simulation results are presented for implementation of closed-loop load-shedding algorithms for cascading failures in the DRTS-HPC testbed

24 POWER TRANSMISSION AND DISTRIBUTION↗

GASNet-EX Specification Collection (Rev. 2024.5.0)

GASNet-EX is a portable, open-source, high-performance communication library designed to efficiently support the networking requirements of PGAS runtime systems and other alternative models in emerging exascale systems. It provides network-independent, high-performance communication primitives including Remote Memory Access (RMA) and Active Messages (AM). GASNet-EX is an evolution of the popular GASNet communication system, building upon over 20 years of lessons learned, and the primary goals are high performance, interface portability, and expressiveness. The library has been used to implement parallel programming models and libraries such as UPC, UPC++, Fortran coarrays, Legion, Chapel, and many others. This anthology collects together the four separate volumes that currently comprise the GASNet-EX specification, as of the 2024.5.0 release of GASNet-EX.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Collaborative Research: Advancing Arctic Climate Projection Capability at Seasonal to Decadal Scales (Final Technical Report)

The Regional Arctic System Model (RASM) at process resolving configurations has been used to (i) advance understanding of physical processes and feedbacks involved in Arctic amplification and (ii) understand and potentially reduce uncertainty in prediction of arctic climate change at seasonal to decadal scales. RASM consists the atmosphere (Weather and Research Forecasting model, WRF), ocean (Parallel Ocean Program, POP), sea ice (CICE), land hydrology (Variable Infiltration Capacity model, VIC), river routing scheme (RVIC), marine biogeochemistry components and the coupling framework (CPL7). Its domain is pan-Arctic, with the atmosphere and land components configured on a 50-km or 25-km grid and four configurations of the ocean and sea ice components: 1/12°(~9.3km) or 1/48°(~2.4km) and 45 or 60 vertical layers. These RASM configurations have been motivated by the emerging exascale capability for high performance computing to improve model fidelity. The dynamical downscaling of reanalysis allows comparison of RASM results with observations in place and time to: (i) advance system level understanding of physical processes and coupling involved in an event, (ii) optimize model parameter space, (iii) diagnose and reduce model biases and (iv) produce realistic and consistent across all the components initial conditions for predictions and predictability studies, which are all unique capabilities not available in global Earth System Models (ESMs). An evaluation of RASM 1.0 (Cassano et al. 2017) revealed that it had a cold bias over the oceans and a warm bias over land areas due largely to cloud and radiation biases in the model, with too little cloud cover simulated over land and too much cloud cover simulated over sub-polar oceans. This study has motivated an upgrade to WRF version 3.7.1 in RASM and allowed for the inclusion of the radiative impact of convective clouds. A variety of atmospheric physics parameterizations were evaluated against observations (e.g. data from the Arctic Clouds in Summer Experiment (ACSE); Sedlar et al. 2020) to identify an optimal suite of WRF physics options in RASM. The RASM with the optimized WRF physics were used to study the impact of strong mesoscale winds over the ocean around the southern tip of Greenland (DuVivier and Cassano 2016) and their impact on oceanic convection (DuVivier et al. 2017a). Data from the PolarWinds field campaign were used to evaluate WRF boundary layer physics and resolution impacts on the simulation of a Greenland barrier wind event (DuVivier et al. 2017b). The RVIC streamflow routing model has been implemented in RASM to realistically represent high-resolution streamflow processes (Hamman et al. 2017) and to couple the land buoyancy fluxes to the ocean. The RASM-RVIC high-resolution data set of all coastal freshwater fluxes for the Arctic drainage basin and surrounding areas for 1979-2014 was published as a separate product (https://doi.org/10.5281/zenodo.293037). The fidelity of atmospheric momentum transfer to and the response of polar marine Ekman layer in RASM and Community Earth System Model (CESM) was investigated by Roberts et al. (2015). The increased frequency of oceanic flux exchange in CESM, following the RASM guidance, caused a considerable increase in the median inertial ice speed across the Southern Ocean and parts of the Arctic. A comprehensive evaluation of the RASM1.0 atmosphere-ocean-sea ice-land interface was completed by Brunke et al. (2018). RASM was also demonstrated for its capability to simulate extreme events in agreement with observations in space and time (Lee et al. submitted). In particular, the development of three open water events, known as polynyas, have been simulated north of Greenland in February of 2011, 2017 and 2018, in agreement with satellite observations for the past four decades. The optimized RASM sea ice results have been favorably evaluated against satellite observations and a subset of eleven CMIP6 models (Watts et al. submitted). In a complementary project, Jin et al. (2018) have shown that RASM with higher-resolution and new sea-ice processes contributed to lower model errors in sea-ice conditions, concentrations of nutrients and ice algae, in comparison to results from the coarse-resolution (1°) CESM. In two other complementary studies, RASM results were used (i) to explain areas of concentrated use by bowhead whales, the seasonal progression in the use, and the physical environment within those areas (Citta et al. 2015) and (ii) for a synthesis of fall bowhead whales distribution and migration in the Bering-Chukchi-Beaufort (BCB) Sea to investigate whale movements and feeding to the local ocean hydrography and currents (Citta et al. 2018). However, the multi-decadal output from the CESM Large Ensemble yielded unrealistic forcing. Instead, the shorter NCEP CFSv2 9-month forecasts were successfully tested and afforded an increased ensemble size (~30) to demonstrate gains of dynamical downscaling at sub-seasonal to intra-annual time scales. The improved model physics and coupling among RASM model components have yielded more realistic representation of the sea ice cover and consistent across all model components initial conditions. Consequently, RASM demonstrates significant gains compared to simulation of sea ice in the NCEP reanalysis. In addition, RASM 6-month ensemble forecasts yield very realistic sea ice distribution, which demonstrates both significant gains of dynamical downscaling and the continued impact of the initial conditions on forecasts out to 6 months (https://nps.edu/web/rasm/predictions). A follow up study using RASM for dynamical downscaling of the more realistic CESM initialized Decadal Prediction Large Ensemble output is currently ongoing as part of the DOE RGMA HiLAT-RASM project.

54 ENVIRONMENTAL SCIENCES↗

Nuclide Depletion Capabilities in the Shift Monte Carlo Code

A new depletion capability has been developed in the Exnihilo radiation transport code suite. This capability enables massively parallel domain-decomposed coupling between the Shift continuous-energy Monte Carlo solver and the nuclide depletion solvers in ORIGEN to perform high-performance Monte Carlo depletion calculations. This paper describes this new depletion capability and discusses its various features, including a multi-level parallel decomposition, high-order transport-depletion coupling, and energy-integrated power renormalization. Several test problems are presented to validate the new capability against other Monte Carlo depletion codes, and the parallel performance of the new capability is analyzed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Efficient discontinuous finite difference meshes for 3-D Laplace–Fourier domain seismic wavefield modelling in acoustic media with embedded boundaries

Simulation of acoustic wave propagation in the Laplace–Fourier (LF) domain, with a spatially uniform mesh, can be computationally demanding especially in areas with large velocity contrasts. To improve efficiency and convergence, we use 3-D second- and fourth-order velocity-pressure finite difference (FD) discontinuous meshes (DM). Our DM algorithm can use any spatial discretization ratio between meshes. We evaluate direct and iterative parallel solvers for computational speed, memory requirements and convergence. Finally, benchmarks in realistic 3-D models and topographies show more efficient and stable results for DM with direct solvers than uniform mesh results with iterative solvers.

58 GEOSCIENCES↗

GASNet Specification, v1.8.1

GASNet is a language-independent, low-level networking layer that provides network-independent, high-performance communication primitives tailored for implementing parallel global address space SPMD languages and libraries such as UPC, UPC++, Co-Array Fortran, Legion, Chapel, and many others. The interface is primarily intended as a compilation target and for use by runtime library writers (as opposed to end users), and the primary goals are high performance, interface portability, and expressiveness. GASNet stands for "Global-Address Space Networking".

97 MATHEMATICS AND COMPUTING↗