Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scalable computation”

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 487 records · Page 27

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗

Single ion as a shot-noise-limited magnetic-field-gradient probe

It is expected that ion-trap quantum computing can be made scalable through protocols that make use of transport of ion qubits between subregions within the ion trap. In this scenario, any magnetic field inhomogeneity the ion experiences during the transport may lead to dephasing and loss of fidelity. Here we demonstrate how to measure, and compensate for, magnetic field gradients inside a segmented ion trap, by transporting a single ion over variable distances. We attain a relative magnetic field sensitivity of {Delta}B/B{sub 0{approx}}5x10{sup -7} over a test distance of 140 {mu}m, which can be extended to the mm range, still with sub-{mu}m resolution. A fast experimental sequence is presented, facilitating its use as a magnetic-field-gradient calibration routine, and it is demonstrated that the main limitation is the quantum shot noise.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

VA EDH Advanced Software Pipeline Framework Report: Enhancing Automation and Scalability

The VA Environmental Determinants of Health (EDH) Advanced Software Pipeline Framework is designed to enhance the efficiency, scalability, and security of geospatial data processing workflows. This framework integrates modern data orchestration and containerization technologies, including Prefect for workflow automation, Docker for containerization, and PostgreSQL/PostGIS for geospatial data storage and analysis. It ensures standardized, reproducible, and automated data processing, supporting VA objectives related to substance use risk assessment and recovery research. The pipeline addresses key scalability and performance challenges through horizontal and vertical scaling, high-performance computing (HPC) integration, parallel processing, task caching, and dynamic resource allocation. These optimizations improve throughput and reduce latency, allowing the system to efficiently manage large and complex datasets. Additionally, security and compliance measures—such as data encryption (SSL), Role-Based Access Control (RBAC), and adherence to GDPR and HIPAA standards—safeguard sensitive information throughout data transmission and storage. A key implementation of this framework includes the automation of shelter list geolocation workflows, ensuring that up-to-date data is readily available for VA decision-making. Lessons learned from this project include the transition from in-memory processing to incremental storage writes, improving resource management and reliability. Future enhancements aim to expand automation, integrate AI-driven anomaly detection, and incorporate high-performance computing resources. This framework provides a scalable, secure, and adaptable solution for managing geospatial datasets, reinforcing the VA’s ability to support clinical and strategic initiatives through data-driven decision-making.

97 MATHEMATICS AND COMPUTING↗

Numerical simulation of involute-plate research reactor flow behavior using RANS, LES and DNS

This paper investigates the flow behavior of involute-plate research reactors by performing Reynolds-Averaged Navier Stokes simulation (RANS), Large Eddy Simulation (LES) and Direct Numerical Simulation (DNS) of the channel flow between fuel plates. By modeling turbulence with different numerical approaches, this study provides data with three levels of fidelity. For the RANS simulation, three widely used turbulence models, i.e., k-ε, k-ω, Reynolds Stress Turbulence model (RST) are applied by using the commercial CFD code STAR-CCM +. For LES and DNS, the open-source CFD code, Nek5000, is used given its outstanding scalability on High Performance Computer (HPC) and high-order technique. The results from RANS simulations are compared with that from LES and DNS for benchmarking. Both macroscale parameters and turbulence statistics, such as velocity magnitude, lateral velocity and turbulence kinetic energy, are presented and analyzed. The results from RANS simulation achieve good agreement with LES and DNS on velocity and turbulence kinetic energy prediction. The RST turbulence model predicts the most similar flow pattern of lateral velocity as compared to LES and DNS. The Lambda-2 (λ2) criterion with a reasonable threshold is used to demonstrate the instantaneous vortices distribution in the involute channel from both LES and DNS calculation. The DNS simulation captures more detailed turbulence especially near the corner, which explains the discrepancy between LES and DNS results near the corner. The normalized RMS error are defined and calculated to assess the performance of those turbulence models. The RST model captures the anisotropic feature of turbulence, which enable it to outperform other turbulence models for predicting the flow behavior in an involute channel. Although some discrepancies are found between LES and DNS results in the corner, the overall deviations between LES and DNS are found to be small. In conclusion, given that the computational cost of DNS calculation is an order of magnitude higher, using LES data for benchmarking RANS model is a cost-effective approach.

DNS↗

A massively-parallel, unstructured overset method for mesh connectivity

Here we present a method that dynamically and efficiently performs connectivity calculations between many O(10 5 ) moving, unstructured overset meshes in parallel. In order to connect overset meshes, elements exterior to the solution domain must be removed from the simulation. In regions with many overlapping meshes, elements must be selectively removed to reduce redundancy while maintaining a solution over the entire domain. Around masked regions interpolation partner pairing is required between meshes to provide boundary conditions. For general unstructured meshes, these steps involve challenging computational geometry calculations which must be efficient and automatic. For many moving meshes each step must be massively parallelized and scalable to large numbers of computational cores. To establish communication patterns a parallelized master/slave algorithm is used which minimizes global communication and storage. To remove elements a parallel ‘Forest Fire’ flood-fill algorithm is used to set a masking variable. For interpolation partner pairing, and other necessary searches, k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update necessary information with time, resulting in substantial cost savings. Details of the different algorithms are presented. Resulting connectivity and timings are shown for complex geometries. Parallel scaling is demonstrated for 100,000 spherical particles within a channel up to 492,000 processors.

97 MATHEMATICS AND COMPUTING↗

PRISMS-PF: A general framework for phase-field modeling with a matrix-free finite element method

Abstract A new phase-field modeling framework with an emphasis on performance, flexibility, and ease of use is presented. Foremost among the strategies employed to fulfill these objectives are the use of a matrix-free finite element method and a modular, application-centric code structure. This approach is implemented in the new open-source PRISMS-PF framework. Its performance is enabled by the combination of a matrix-free variant of the finite element method with adaptive mesh refinement, explicit time integration, and multilevel parallelism. Benchmark testing with a particle growth problem shows PRISMS-PF with adaptive mesh refinement and higher-order elements to be up to 12 times faster than a finite difference code employing a second-order-accurate spatial discretization and first-order-accurate explicit time integration. Furthermore, for a two-dimensional solidification benchmark problem, the performance of PRISMS-PF meets or exceeds that of phase-field frameworks that focus on implicit/semi-implicit time stepping, even though the benchmark problem’s small computational size reduces the scalability advantage of explicit time-integration schemes. PRISMS-PF supports an arbitrary number of coupled governing equations. The code structure simplifies the modification of these governing equations by separating their definition from the implementation of the numerical methods used to solve them. As part of its modular design, the framework includes functionality for nucleation and polycrystalline systems available in any application to further broaden the phenomena that can be used to study. The versatility of this approach is demonstrated with examples from several common types of phase-field simulations, including coarsening subsequent to spinodal decomposition, solidification, precipitation, grain growth, and corrosion.

36 MATERIALS SCIENCE↗

Modeling Cardiac Electrophysiology at the Organ Level in the Peta FLOPS Computing Age

Despite a steep increase in available compute power, in-silico experimentation with highly detailed models of the heart remains to be challenging due to the high computational cost involved. It is hoped that next generation high performance computing (HPC) resources lead to significant reductions in execution times to leverage a new class of in-silico applications. However, performance gains with these new platforms can only be achieved by engaging a much larger number of compute cores, necessitating strongly scalable numerical techniques. So far strong scalability has been demonstrated only for a moderate number of cores, orders of magnitude below the range required to achieve the desired performance boost.In this study, strong scalability of currently used techniques to solve the bidomain equations is investigated. Benchmark results suggest that scalability is limited to 512-4096 cores within the range of relevant problem sizes even when systems are carefully load-balanced and advanced IO strategies are employed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Modeling of advanced accelerator concepts

Computer modeling is essential to research on Advanced Accelerator Concepts (AAC), as well as to their design and operation. This paper summarizes the current status and future needs of AAC systems and reports on several key aspects of (i) high-performance computing (including performance, portability, scalability, advanced algorithms, scalable I/Os and In-Situ analysis), (ii) the benefits of ecosystems with integrated workflows based on standardized input and output and with integrated frameworks developed as a community, and (iii) sustainability and reliability (including code robustness and usability).

47 OTHER INSTRUMENTATION↗

Quantum Computer Scale-up

Quantum computers are creating buzz from Silicon Valley to the halls of Congress. But the hardware has only been prototyped at small scale. Could applying the engineering processes used to scale up semiconductors also accelerate quantum computer development?

97 MATHEMATICS AND COMPUTING↗

Learning Optimal Power Flow Solutions using Linearized Models in Power Distribution Systems

Solving nonlinear optimal power flow (OPF) problem is computationally expensive, and poses scalability challenges for power distribution networks. An alternative to solving the original nonlinear OPF is the linear approximated OPF models. Although, these linear approximated OPF models are fast, the resulting solutions may result in significant optimality gap. Lately, the application of machine learning (ML) methods in successfully solving the nonlinear OPF has been reported. These methods learn and estimate the nonlinear control policies using a purely data-driven approach. In this paper, we propose an approach to complements the ML based approach to solving OPF using solutions from known linearized OPF model. Specifically, we use supervised learning to map the solutions of linear OPF to nonlinear control variables. Unlike, the traditional ML based methods for OPF that approximate the full distribution feeder model using function approximation, our approach uses a two-node approximation of radial networks. The proposed approach is validated using IEEE 123 bus test system for OPF solutions obtained using the nonlinear OPF models.

optimal power flow, power distribution systems, su↗

A Tri-Port Current-Source Soft-Switching Medium-Voltage String Inverter for Large-Scale Solar-Plus-Storage Farms

This article presents a tri-port current-source soft-switching medium-voltage string inverter (TMVSI) to reduce the Levelized cost of energy (LCOE) of large-scale solar-plus-storage (SPS) farms. Throughout this work, the topology, operating principle, circuit simulation, control, and hardware design of the TMVSI are introduced. In addition, three key challenges compromising the performance of the TMVSI are addressed in this article. First, a new feed-forward compensation for model predictive control of the TMVSI is proposed to compensate for sampling and computational delay and high dc-link ripple with low computational cost and high scalability. Second, the use of laminated permanent magnets is proposed to reduce the losses of the MV medium-frequency transformer (MFT) in the TMVSI while increasing its saturation current. Finally, an improved U-shape winding pattern is proposed to decrease the leakage inductance of the MV MFT and reduce the voltage stress across semiconductor switches without adding cost or complexity. Here, the effectiveness of the TMVSI is validated by experiments at up to 20kW/500V in different test cases with custom-built prototypes. The contributions of this work make the TMVSI a viable solution to SPS farms and unleash its potential for LCOE reduction.

14 SOLAR ENERGY↗

DReAM: Demand Response Architecture for Multi-level District Heating and Cooling Networks

In this paper, we exploit the inherent hierarchy of heat exchangers in District Heating and Cooling (DHC) networks and propose DReAM, a novel Demand Response (DR) architecture for Multi-level DHC networks. DReAM serves to economize system operation while still respecting comfort requirements of individual consumers. Contrary to many present day DR schemes that work on a consumer level granularity, DReAM works at a level of hierarchy above buildings, i.e. substations that supply heat to a group of buildings. This improves the overall DR scalability and reduce the computational complexity. In the first step of the proposed approach, mathematical models of individual substations and their downstream networks are abstracted into appropriately constructed low-complexity structural forms. In the second step, this abstracted information is employed by the utility to perform DR optimization that determines the optimal heat inflow to individual substations rather than buildings, in order to achieve the targeted objectives across the network. We validate the proposed DReAM framework through experimental results under different scenarios on a test network.

Bhattacharya, Saptarshi↗

A GPU-Accelerated Population Generation, Sorting, and Mutation Kernel for an Optimization-Based Causal Inference Model

We develop a GPU-accelerated machine learning generative adversarial network model that can be used with observational data for the purpose of constructing causal inferences. The theoretical basis of our machine learning model is novel and is conceptualized to be operable and scalable for high performance computing platforms. Our GPU-accelerated code enables large-scale parallelization of the computation within a common and accessible computing environment. This will expand the reach of our model and empower research in new substantive domains while maintaining the underlying theoretical properties.

Cho, Wendy K. Tam↗

High-performance finite elements with MFEM

The MFEM (Modular Finite Element Methods) library is a high-performance C++ library for finite element discretizations. MFEM supports numerous types of finite element methods and is the discretization engine powering many computational physics and engineering applications across a number of domains. Furthermore, this paper describes some of the recent research and development in MFEM, focusing on performance portability across leadership-class supercomputing facilities, including exascale supercomputers, as well as new capabilities and functionality, enabling a wider range of applications. Much of this work was undertaken as part of the Department of Energy’s Exascale Computing Project (ECP) in collaboration with the Center for Efficient Exascale Discretizations (CEED).

97 MATHEMATICS AND COMPUTING↗

Tunable and efficient ultraviolet generation with periodically poled lithium niobate

On-chip ultraviolet (UV) sources are of great interest for building compact and scalable atomic clocks, quantum computers, and spectrometers. However, few material platforms are suitable for integrated UV light generation and manipulation. Of these materials, thin-film lithium niobate offers unique advantages such as sub-micron modal confinement, strong nonlinearity, and quasi-phase matching. Despite these characteristics, its utilization in the UV has remained elusive because of the substantial sensitivity of standard quasi-phase matching to fabrication imperfections, the photorefractive effect, and relatively large losses in this range. Here, we present efficient (197 ± 5%/W/cm 2 ) second harmonic generation of UV-A light in a periodically poled lithium niobate nanophotonic waveguide. We achieve on-chip UV powers of ~30 µW and linear wavelength tunability using temperature. These results are enabled with large cross section waveguides, which leads to first-order UV quasi-phase-matching with relatively long poling periods (>1.5 µm). By varying the poling period, we have achieved the shortest reported wavelength (355 nm) generated through frequency doubling in thin-film lithium niobate. Furthermore, our results open up new avenues for UV on-chip sources and chip-scale photonics through compact frequency-doubling of common near-IR laser diodes.

42 ENGINEERING↗

Development and Validation of a Two-Phase Thermal-Hydraulic CFD Code NEK-2P

A project is underway to develop, verify and validate an advanced two-phase flow modeling capability for the highly-scalable, high-performance Computational Fluid Dynamics (CFD) code NEK5000. The goal of this work is to verify and validate the two-phase version of the NEK5000 code, named NEK-2P, to simulate the two-phase flow and heat transfer phenomena that occur in a Boiling Water Reactor (BWR) fuel bundle under various operating conditions. The NEK-2P two-phase flow models follow the approach used for the Extended Boiling Framework (EBF) previously developed at Argonne but include more fundamental physical models of boiling phenomena and advanced numerical algorithms for improved computational accuracy, robustness, and computational speed. The development of the NEK-2P two-phase solver and the implementation of the Extended Boiling Framework two-phase models were initially supported by Argonne National Laboratory (Argonne) through a Laboratory Directed Research and Development (LDRD) project during FY2014-2016. The development and validation of the two-phase models through analyses of selected two-phase boiling flow experiments was supported by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program in FY2017-2020. This report focuses on verification and validation of the water-steam boiling model NEK-2P Two-Phase, CFD code. The NEK-2P was validated with Nuclear Power Engineering Corporation (NUPEC) Pressurized Water Reactor (PWR) Sub-channel and Bundle Test (PSBT) void distribution benchmark. Three different simulations were performed and analyzed for various operating conditions such as wall-heat flux and sub-cooled inlet temperatures. Reasonably good agreement with measured data was obtained in predicting the measured void distributions. Simulations were performed for Virginia Tech. (VT) 3x3 rod bundle geometry with and without spacers. The preliminary results were presented for Simplified Spacer Grid (SSG). In addition, the implementation of interface reconstruction model was tested with one of the Becker benchmark Critical Heat Flux (CHF) experiments.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Data Center Market Report

The data center market is poised to explode in the coming decade due to undeniable drivers such as continued adoption of generative AI, increased data storage needs, and enterprise integration of AI in numerous industries [1] [2] [3]. Scalable power and increased computational capacity are at the forefront of considerations for hyperscalers, the major cloud service providers in this space. Lawrence Livermore National Laboratory is uniquely poised to help with informed decision making for data center market leaders during this phase of explosive expansion. National grid modeling expertise and cutting edge innovations in computer cooling systems place LLNL in an enviable position for creating economic impact in the data center industry by leveraging its expertise in these areas which can help the data center market keep up with growing demand.

97 MATHEMATICS AND COMPUTING↗

Deep Learning Methods for Symbolic Calculations in HEP

This project develops machine learning methods to accelerate symbolic calculations in high-energy physics. Using sequence-to-sequence transformer models, we construct frameworks to predict squared amplitudes and related quantities for Standard Model processes, including quantum electrodynamics, quantum chromodynamics, and electroweak interactions. The results demonstrate that deep learning can successfully learn complex symbolic relationships and provide a scalable approach to symbolic computation with potential applications in precision calculations and collider phenomenology.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗