SEARCH · Engineering Papers

Results for “parallel performance”

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.

SourceResearch connectionFrom yearThrough year

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

At least 919 records · Page 51

All sources NASA NTRS DOE OSTI

DOE OSTI2021

Controlled spalling-based mechanical substrate exfoliation for III-V solar cells: A review

Not Available

Chen, Jie (ORCID:0000000164510032)↗

DOE OSTI2025

Direct I/O for RNTuple Columnar Data

RNTuple is the new columnar data format designed as the successor to ROOT’s TTree format. It allows to make use of modern hardware capabilities and is expected to be used in production by the LHC experiments during the HL-LHC. In this paper, we discuss the usage of Direct I/O to fully exploit modern SSDs, especially in the context of the recent addition of parallel RNTuple writing. We describe the alignment requirements imposed by Direct I/O and approaches to meet them for columnar data formats. Finally, we discuss performance results for both writing and reading, in synthetic benchmarks as well as real-world applications.

Hahnfeld, Jonas [CERN; Goethe U., Frankfurt (main)↗

DOE OSTI2023

An accurate and efficient fragmentation approach via the generalized many-body expansion for density matrices

With relevant chemical space growing larger and larger by the day, the ability to extend computational tractability over that larger space is of paramount importance in virtually all fields of science. The solution we aim to provide here for this issue is in the form of the generalized many-body expansion for building density matrices (GMBE-DM) based on the set-theoretical derivation with overlapping fragments, through which the energy can be obtained by a single Fock build. In combination with the purification scheme and the truncation at the one-body level, the DM-based GMBE(1)-DM-P approach shows both highly accurate absolute and relative energies for medium-to-large size water clusters with about an order of magnitude better than the corresponding energy-based GMBE(1) scheme. Simultaneously, GMBE(1)-DM-P is about an order of magnitude faster than the previously proposed MBE-DM scheme [F. Ballesteros and K. U. Lao, J. Chem. Theory Comput. 18, 179 (2022)] and is even faster than a supersystem calculation without significant parallelization to rescue the fragmentation method. For even more challenging systems including ion–water and ion–pair clusters, GMBE(1)-DM-P also performs about 3 and 30 times better than the energy-based GMBE(1) approach, respectively. In addition, this work provides the first overlapping fragmentation algorithm with a robust and effective binning scheme implemented internally in a popular quantum chemistry software package. Thus, GMBE(1)-DM-P opens a new door to accurately and efficiently describe noncovalent clusters using quantum mechanics.

Chemistry↗

DOE OSTI2024

Custom Accessors: Enabling Scalable Data Ingestion, (Re-)Organization, and Analysis on Distributed Systems

The emerging class of high velocity and high volume data analytic workflows comprise interwoven data ingestion, organization, and processing stages, with ingestion and organization steps often contributing comparable or even higher computational costs than actual processing steps. Since complex workflows consist of a variety of phases that view and use data differently, being able to construct efficient, scalable, distributed data structures (arrays, vectors, sets, maps, and multi-maps) is essential and requires custom methods to extend and shrink containers, analyze and position data, and, maintain globallyconsistent meta-data. In this paper, we propose a novel datastructure access paradigm based on the concept of Accessors. At a high level, accessors are customizable callable objects that can modify the behavior of insert, read, update, and delete operations for distributed containers while preserving atomicity guarantees. Accessors provide a very clean and natural way to implement a variety of programming patterns, e.g., conditional insertion/deletion and cascading computations, which would be otherwise hard (or even impossible) to express in parallel and distributed settings without using locks. We demonstrate the practicality and usefulness of our approach with two representative use cases and study the performance of these applications on a distributed High-Performance Computing system. Our analysis highlights that our proposed abstraction allows for an effective overlapping and concurrent execution of different workflow steps (e.g., data ingestion and analysis), which in a conventional analytics pipeline would execute sequentially, contributing cumulatively to the overall latency.

Castellana, Vito G. [BATTELLE (PACIFIC NW LAB)] (O↗

DOE OSTI2020

Estimating Lossy Compressibility of Scientific Data Using Deep Neural Networks

Simulation based scientific applications generate increasingly large amounts of data on high-performance computing (HPC) systems. To allow data to be stored and analyzed efficiently, data compression is often utilized to reduce the volume and velocity of data. However, a question often raised by domain scientists is the level of compression that can be expected so that they can make more informed decisions, balancing between accuracy and performance. In this letter, we propose a deep neural network based approach for estimating the compressibility of scientific data. To train the neural network, we build both general features as well as compressor-specific features so that the characteristics of both data and lossy compressors are captured in training. Our approach is demonstrated to outperform a prior analytical model as well as a sampling based approach in the case of a biased estimation, i.e., for SZ. However, for the unbiased estimation (i.e., ZFP), the sampling based approach yields the best accuracy, despite the high overhead involved in sampling the target dataset.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

ParaEMT: An Open Source, Parallelizable, and HPC-Compatible EMT Simulator for Large-Scale IBR-Rich Power Grids

Not Available

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2020

A Two-Stage Decomposition Approach for AC Optimal Power Flow

The alternating current optimal power flow (AC-OPF) problem is critical to power system operations and planning, but it is generally hard to solve due to its nonconvex and large-scale nature. Furthermore, this paper proposes a scalable decomposition approach in which the power network is decomposed into a master network and a number of subnetworks, where each network has its own AC-OPF subproblem. This formulates a two-stage optimization problem and requires only a small amount of communication between the master and subnetworks. The key contribution is a smoothing technique that renders the response of a subnetwork differentiable with respect to the input from the master problem, utilizing properties of the barrier problem formulation that naturally arises when subproblems are solved by a primal-dual interior-point algorithm. Consequently, existing efficient nonlinear programming solvers can be used for both the master problem and the subproblems. The advantage of this framework is that speedup can be obtained by processing the subnetworks in parallel, and it has convergence guarantees under reasonable assumptions. The formulation is readily extended to instances with stochastic subnetwork loads. Numerical results show favorable performance and illustrate the scalability of the algorithm which is able to solve instances with more than 11 million buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2024

PETSc/TAO Users Manual V.3.21

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations (PDEs) and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for implementing large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and optimizers that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started ). The library is organized hierarchically, enabling users to employ the abstraction level most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

PETSc/TAO Users Manual Revision 3.22

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

PETSc/TAO Users Manual Revision 3.23

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

PETSc/TAO Users Manual Revision 3.24

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

PETSc/TAO Users Manual Revision 3.25

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

DOE OSTI2021

Systems and methods for rapid processing and storage of data

Systems and methods of building massively parallel computing systems using low power computing complexes in accordance with embodiments of the invention are disclosed. A massively parallel computing system in accordance with one embodiment of the invention includes at least one Solid State Blade configured to communicate via a high performance network fabric. In addition, each Solid State Blade includes a processor configured to communicate with a plurality of low power computing complexes interconnected by a router, and each low power computing complex includes at least one general processing core, an accelerator, an I/O interface, and cache memory and is configured to communicate with non-volatile solid state memory.

Stalzer, Mark A.↗

DOE OSTI2025

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations

In this article, we focus on the communication costs of three symmetric matrix computations: (i) multiplying a matrix with its transpose, known as a symmetric rank-k update (SYRK) (ii) adding the result of the multiplication of a matrix with the transpose of another matrix and the transpose of that result, known as a symmetric rank-2k update (SYR2K) (iii) performing matrix multiplication with a symmetric input matrix (SYMM). All three computations appear in the Level 3 Basic Linear Algebra Subroutines (BLAS) and have wide use in applications involving symmetric matrices. We establish communication lower bounds for these kernels using sequential and distributed-memory parallel computational models, and we show that our bounds are tight by presenting communication-optimal algorithms for each setting. Our lower bound proofs rely on applying a geometric inequality for symmetric computations and analytically solving constrained nonlinear optimization problems. As a result, the symmetric matrix and its corresponding computations are accessed and performed according to a triangular block partitioning scheme in the optimal algorithms.

Al Daas, Hussam [Rutherford Appleton Laboratory, D↗

DOE OSTI2020

Beam test performance of prototype silicon detectors for the Outer Tracker for the Phase-2 Upgrade of CMS

A new CMS tracker detector will be installed for operation at the High Luminosity LHC (HL-LHC). This detector comprises modules with two closely spaced parallel sensor plates and front-end ASICs capable of transmitting tracking information to the CMS Level-1 (L1) trigger at the 40 MHz beam crossing rate. The inclusion of tracking information in the L1 trigger decision will be essential for selecting events of interest efficiently at the HL-LHC. The CMS Binary Chip (CBC)has been designed to read out and correlate hits from pairs of tracker sensors, forming so called track stubs. For the first time, a prototype irradiated module and a full-sized module, both equipped with the version 2 of the CBC, have been operated in test beam facilities. The efficiency of the stub finding logic of the modules for various angles of incidence has been studied. The ability of the modules to reject tracks with transverse momentum less than 2 GeV has been demonstrated. For modules built with irradiated sensors, no significant drop in the stub finding performance has been observed. Results from the beam tests are described in this paper.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2021

Integrating Advanced Modeling and Accelerated Testing for a Modernized Fuel Qualification Paradigm

With the increasing interest in sodium fast reactor technology, as seen by applications to the U.S. Nuclear Regulatory Commission for the OKLO Aurora plant, fuel testing for the TerraPower Traveling Wave Reactor, and the impending construction and startup of the versatile test reactor (VTR), a modernized, accelerated approach to fuel qualification is needed. To guide this effort, a Phenomena Identification Ranking Table–styled analysis was performed for a U-Pu-Zr sodium-free annular fuel system. This analysis evaluated a series of fuel design properties and parameters against their contributions to key fuel performance phenomena. The resulting priority parameters were then reviewed against existing modeling and experimental capabilities to support investigation of the highest-priority parameters. A pathway for qualification was then established using highthroughput, high-volume experiments from MiniFuel and FAST in parallel with advanced physics-based model development. This effort outlines how the first stages of qualification can be reduced from the typical 20+-year development cycle to 5 to 7 years by deploying accelerated irradiation testing platforms. As with any accelerated test, these methods are prototypic in some aspects and less so in others; however, by coupling with advanced fuel performance modeling and simulation capabilities, the larger space of irradiation parameters and material response provided offers advantages for the validation of physics-based models supporting the deployment of novel fuel designs. As a test case, this paper utilizes a proposed Mark II fuel system for the upcoming VTR. Thus, an accelerated qualification method can be tested for the development of MARK II driver fuel so that by the time of VTR startup, lead test assemblies for a Mark II fuel can be initiated.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2020

Towards improved speed and accuracy of laser powder bed fusion simulations via representation of multiple time scales

Here, we report the result of investigations into alternative representations of the temporal evolution of the laser powder bed fusion (LPBF) process. In order to provide the reader with sufficient context for the following discussion, the modeling challenge and its underlying cause, as well as current attempts to provide a satisfactory solution, will be discussed. Next, the author will describe two numerical methods (multirate time integration and parallel-in-time) to better represent the temporal scales of the problem. Finally, the results of applying these methods to a two-dimensional version of the heat transfer portion of the LPBF problem will be presented, reporting on both convergence and performance behavior, which indicate the possibility of significant speedup of solution calculations (40–100 times), along with well-characterized effects on solution accuracy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

Randomized Preconditioned Solvers for Strong Constraint 4D-Var Data Assimilation

The Strong Constraint 4D Variational (SC-4DVAR) data assimilation method is widely used in climate and weather applications. SC-4DVAR involves solving a minimization problem to compute the maximum a posteriori estimate, which we tackle using the Gauss-Newton method. The computation of the descent direction is expensive since it involves the solution of a large-scale and potentially ill-conditioned linear system, solved using the preconditioned conjugate gradient (PCG) method. Here, to address this cost, we efficiently construct scalable preconditioners using three different randomization techniques, which all rely on a certain low-rank structure involving the Gauss-Newton Hessian. The proposed techniques come with theoretical guarantees on the condition number, and at the same time, are amenable to parallelization. We also develop an adaptive approach to estimate the sketch size and choose between the reuse or recomputation of the preconditioner. We demonstrate the performance and effectiveness of our methodology on two representative model problems—the Burgers and barotropic vorticity equation—showing a drastic reduction in both the number of PCG iterations and the number of Gauss-Newton Hessian products after including the preconditioner construction cost.

Gauss-Newton↗