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,801 records · Page 100

PFLOTRAN: Reactive Flow & Transport Code for Use on Laptops to Leadership-Class Supercomputers

PFLOTRAN, a next-generation reactive flow and transport code for modeling subsurface processes, has been designed from the ground up to run efficiently on machines ranging from leadership-class supercomputers to laptops. Based on an object-oriented design, the code is easily extensible to incorporate additional processes. It can interface seamlessly with Fortran 9X, C and C++ codes. Domain decomposition parallelism is employed, with the PETSc parallel framework used to manage parallel solvers, data structures and communication. Features of the code include a modular input file, implementation of high-performance I/O using parallel HDF5, ability to perform multiple realization simulations with multiple processors per realization in a seamless manner, and multiple modes for multiphase flow and multicomponent geochemical transport. Chemical reactions currently implemented in the code include homogeneous aqueous complexing reactions and heterogeneous mineral precipitation/dissolution, ion exchange, surface complexation and a multirate kinetic sorption model. PFLOTRAN has demonstrated petascale performance using 2{sup 17} processor cores with over 2 billion degrees of freedom. Accomplishments achieved to date include applications to the Hanford 300 Area and modeling CO{sub 2} sequestration in deep geologic formations.

58 GEOSCIENCES↗

Detection of Coherent Structures in Extreme-Scale Simulations

The analysis of coherent structures is a common problem in many scientific domains ranging from astrophysics to combustion, fusion, and materials science. The data from three-dimensional simulations are analyzed to detect the structures, extract statistics on them, and track them over time to gain insights into the phenomenon being modeled. This analysis is typically done off-line, using data that have been written out by the simulations. However, the move towards extreme scale architectures, with multi-core processors and graphical processing units, will affect how such analysis is done as it is unlikely that the systems will support the I/O bandwidth required for off-line analysis. Moving the analysis in-situ is a solution only if we know a priori what analysis will be done, as well as the algorithms used and their parameter settings. Even then, we need to ensure that this will not substantially increase the memory requirements or the data movement as the former will be limited and the latter will be expensive. In the Exa-DM project, a collaboration between Lawrence Livermore National Laboratory and University of Minnesota, we are exploring ways in which we can address the conflicting demands of coherent structure analysis of simulation data and the architecture of modern parallel systems, while enabling scientific discovery at the exascale. In this paper, we describe our work in two areas: the in situ implementation of an existing algorithm for coherent structure analysis and the use of graph-based techniques to efficiently compress the data.

79 ASTRONOMY AND ASTROPHYSICS↗

Cooling system having reduced mass pin fins for components in a gas turbine engine

A cooling system having one or more pin fins with reduced mass for a gas turbine engine is disclosed. The cooling system may include one or more first surfaces defining at least a portion of the cooling system. The pin fin may extend from the surface defining the cooling system and may have a noncircular cross-section taken generally parallel to the surface and at least part of an outer surface of the cross-section forms at least a quartercircle. A downstream side of the pin fin may have a cavity to reduce mass, thereby creating a more efficient turbine airfoil.

42 ENGINEERING↗

Mads.jl

Mads.jl (Model analysis and decision support in Julia) is a code that streamlines the process of using data and models for analysis and decision support. It is based on another open-source code developed at LANL and written in C/C++ (MADS; http://mads.lanl.gov; LA-CC-11- 035). Mads.jl can work with external models of arbitrary complexity as well as built-in models of flow and transport in porous media. It enables a number of data- and model-based analyses including model calibration, sensitivity analysis, uncertainty quantification, and decision analysis. The code also can use a series of alternative adaptive computational techniques for Bayesian sampling, Monte Carlo, and Bayesian Information-Gap Decision Theory. The code is implemented in the Julia programming language, and has high-performance (parallel) and memory management capabilities. The code uses a series of third party modules developed by others. The code development will also include contributions to the existing third party modules written in Julia; this contributions will be important for the efficient implementation of the algorithm used by Mads.jl. The code also uses a series of LANL developed modules that are developed by Dan O'Malley; these modules will be also a part of the Mads.jl release. Mads.jl will be released under GPL V3 license. The code will be distributed as a Git repo at gitlab.com and github.com. Mads.jl manual and documentation will be posted at madsjulia.lanl.gov.

Vesselinov, Velimir↗

Integrating Carbon Capture, Utilization, & Sequestration into Chemical Pulp Mills

The U.S. pulp and paper industry presents a unique and largely untapped opportunity for large- scale carbon dioxide removal (CDR). Unlike most industrial sectors, pulp mills rely heavily on biomass, meaning that much of their carbon emissions originate from atmospheric CO₂ that was recently captured by plants. If this biogenic CO₂ can be captured and permanently stored, pulp mills can be transformed from carbon emitters into net carbon removal facilities. This project was motivated by that opportunity and aimed to develop and evaluate integrated, low-cost strategies for capturing, utilizing, and sequestering CO₂ within existing chemical pulping operations. The scope of this work focused on four complementary innovations designed to integrate seamlessly into kraft pulp mill infrastructure: (1) in situ CO₂ capture within the recovery cycle, (2) oxy-fuel retrofitting of the rotary lime kiln to produce a high-purity CO₂ stream, (3) ex situ CO₂ capture and mineralization using pulp mill residues (dregs, grits, and lime mud), and (4) beneficial reuse of these residues as mineral carbonate fertilizers. The project combined process modeling, laboratory experimentation, life cycle assessment (LCA), and field trials to evaluate the technical feasibility, economic viability, and environmental impact of these approaches. The results demonstrate that pulp mills can serve as effective platforms for carbon removal when equipped with integrated carbon capture systems. Process modeling showed that combining sodium spiking with oxy-fuel calcination significantly enhances CO₂ capture efficiency while reducing costs by up to 31% compared to conventional configurations. Experimental work further revealed that calcination behavior in high-CO₂ environments differs substantially from traditional systems, leading to the development of a new kinetic model that predicts reaction rates under these conditions. This model provides essential design guidance for next-generation decarbonized lime kilns. In parallel, the project demonstrated that alkaline mineral residues generated during pulping operations can be repurposed as a sustainable alternative to agricultural lime. Across a wide range of soils in the southeastern United States, these materials performed equivalently to commercial lime in adjusting soil pH while offering lower greenhouse gas emissions and reduced cost. Field and greenhouse studies confirmed that crop and tree growth responses were comparable, supporting their viability as a drop-in replacement. This co-product pathway provides a practical utilization strategy that offsets costs and improves overall system economics. A major contribution of this project is the first comprehensive life cycle assessment of carbon removal in pulp and paper systems across multiple system boundaries. Results show that retrofitted mills can achieve carbon removal efficiencies ranging from 12% to 92%, depending on how the system is defined. This finding highlights a critical issue in carbon accounting: reported performance is highly sensitive to methodological choices. By explicitly quantifying these differences, this work provides valuable guidance for policymakers, carbon registries, and project developers working to standardize carbon removal metrics. From a commercialization perspective, the technologies investigated in this project are well- aligned with existing industrial infrastructure, minimizing the need for entirely new facilities. 3 DE-EE0009413 Industry engagement throughout the project—including collaboration with pulp and paper companies, equipment manufacturers, and carbon removal developers—has accelerated the transition from research to deployment. Notably, a commercial developer is actively pursuing carbon capture projects at pulp mills in the southeastern United States and has cited this research as a contributing foundation. The emergence of voluntary carbon markets and long-term offtake agreements further strengthens the business case for implementation. The broader public benefits of this work are significant. By enabling large-scale carbon removal using existing industrial systems, this approach offers a near-term pathway to reduce atmospheric CO₂ concentrations while supporting domestic manufacturing and rural economies. The reuse of industrial residues as fertilizers reduces reliance on mined materials, lowers costs for farmers, and decreases environmental impacts associated with conventional lime production. In addition, the project has supported workforce development by training graduate students and researchers in carbon capture technologies, helping to build capacity in a critical area of national interest. In conclusion, this project demonstrates that integrated carbon capture, utilization, and sequestration in pulp mills is both technically feasible and economically promising. By combining process innovation, experimental validation, and systems-level analysis, the work advances the understanding of how biomass-based industries can contribute to climate mitigation. The findings provide a strong foundation for commercial deployment and offer a scalable solution for transforming a major U.S. industry into a source of durable carbon removal.

09 BIOMASS FUELS↗

Collaborative Project. 3D Radiative Transfer Parameterization Over Mountains/Snow for High-Resolution Climate Models. Fast physics and Applications

Under the support of the aforementioned DOE Grant, we have made two fundamental contributions to atmospheric and climate sciences: (1) Develop an efficient 3-D radiative transfer parameterization for application to intense and intricate inhomogeneous mountain/snow regions. (2) Innovate a stochastic parameterization for light absorption by internally mixed black carbon and dust particles in snow grains for understanding and physical insight into snow albedo reduction in climate models. With reference to item (1), we divided solar fluxes reaching mountain surfaces into five components: direct and diffuse fluxes, direct- and diffuse-reflected fluxes, and coupled mountain-mountain flux. “Exact” 3D Monte Carlo photon tracing computations can then be performed for these solar flux components to compare with those calculated from the conventional plane-parallel (PP) radiative transfer program readily available in climate models. Subsequently, Parameterizations of the deviations of 3D from PP results for five flux components are carried out by means of the multiple linear regression analysis associated with topographic information, including elevation, solar incident angle, sky view factor, and terrain configuration factor. We derived five regression equations with high statistical correlations for flux deviations and successfully incorporated this efficient parameterization into WRF model, which was used as the testbed in connection with the Fu-Liou-Gu PP radiation scheme that has been included in the WRF physics package. Incorporating this 3D parameterization program, we conducted simulations of WRF and CCSM4 to understand and evaluate the mountain/snow effect on snow albedo reduction during seasonal transition and the interannual variability for snowmelt, cloud cover, and precipitation over the Western United States presented in the final report. With reference to item (2), we developed in our previous research a geometric-optics surface-wave approach (GOS) for the computation of light absorption and scattering by complex and inhomogeneous particles for application to aggregates and snow grains with external and internal mixing structures. We demonstrated that a small black (BC) particle on the order of 1 μm internally mixed with snow grains could effectively reduce visible snow albedo by as much as 5–10%. Following this work and within the context of DOE support, we have made two key accomplishments presented in the attached final report.

54 ENVIRONMENTAL SCIENCES↗

How fast can one resize a distributed file system?

Efficient resource utilization becomes a major concern as large-scale distributed computing infrastructures keep growing in size. Malleability, the possibility for resource managers to dynamically increase or decrease the amount of resources allocated to a job, is a promising way to save energy and costs. However, state-of-the-art parallel and distributed storage systems have not been designed with malleability in mind. The reason is mainly the supposedly high cost of data transfers required by resizing operations. Nevertheless, as network and storage technologies evolve, old assumptions about potential bottlenecks can be revisited. In this study, we evaluate the viability of malleability as a design principle for a distributed storage system. We specifically model the minimal duration of the commission and decommission operations. To show how our models can be used in practice, we evaluate the performance of these operations in HDFS, a relevant state-of-the-art distributed file system. We show that the existing decommission mechanism of HDFS is good when the network is the bottleneck, but can be accelerated by up to a factor 3 when storage is the limiting factor. We also show that the commission in HDFS can be substantially accelerated. With the highlights provided by our model, we suggest improvements to speed both operations in HDFS. We discuss how the proposed models can be generalized for distributed file systems with different assumptions and what perspectives are open for the design of efficient malleable distributed file systems.

97 MATHEMATICS AND COMPUTING↗

FPDeep: Scalable Acceleration of CNN Training on Deeply-Pipelined FPGA Clusters

In this paper, we propose a framework called FPDeep, which uses a hybrid of model and layer paral- lelism to configure distributed reconfigurable clusters to train DNNs. This approach has numerous benefits. First, the design does not suffer from batch size growth. Second, novel workload and weight partitioning leads to balanced loads of both among nodes. And third, the entire system is fine-grained pipeline. This leads to high parallelism and utilization and also minimizes the time features need to be cached while waiting for back-propagation.

Wang, Tianqi↗

A modular synthetic approach for band-gap engineering of armchair graphene nanoribbons

Despite the great promise of armchair graphene nanoribbons (aGNRs) as high-performance semiconductors, practical band-gap engineering of aGNRs remains an unmet challenge. Given that width and edge structures are the two key factors for modulating band-gaps of aGNRs, a reliable synthetic method that allows control of both factors would be highly desirable. We report a simple modular strategy for efficient preparation of N = 6 aGNR, the narrowest member in the N = 3p (p: natural number) aGNR family, and two unsymmetrically edge-functionalized GNRs that contain benzothiadiazole and benzotriazole moieties. The trend of band-gap transitions among these GNRs parallels those in donor-acceptor alternating conjugated polymers. In addition, post-functionalization of the unsymmetrical heterocyclic edge via C-H borylation permits further band-gap tuning. Therefore, this method opens the door for convenient band-gap engineering of aGNRs through modifying the heteroarenes on the edge.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fokker-Planck simulations of fast ion ICRF and electron EC heating in a mirror plasma using CQL3D-m

The CQL3D-m continuum bounce-average Fokker-Planck code is adapted for magnetic mirror plasmas [1] and is now routinely used in no-free-parameter classical integrated modeling of mirror devices [2, 3]. In the present effort, we report on two RF methods of plasma heating in mirror machine. The fast ions (FI) are heated by Fast waves at 2nd-4th harmonic, where FIs originate from neutral beam injection at 45 degrees to the magnetic field. The scenario shows an efficient ion heating near the FI bouncing point. The electrons are heated by X-mode launched from the high magnetic field side towards the resonance. Different from the tokamak applications, CQL3D-m provides an evolving self-consistent ambipolar parallel electric field, which determines the shape of the loss cone and hence an accurate confinement time of both ions and electrons. Also, it includes a description of ion and electron sources and sinks (related to charge exchange and impact ionization) which are updated at every time step. CQL3D-m utilizes a fully nonlinear Coulomb collision operator that is important for the significantly non-Maxwellian ion distributions typically established in mirror plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Accurate quantum dynamics calculations using symmetrized Gaussians on a doubly dense Von Neumann lattice

In a series of earlier articles [B. Poirier, J. Theor. Comput. Chem. 2, 65 (2003); B. Poirier and A. Salam, J. Chem. Phys. 121, 1690 (2004); and ibid. 121, 1704 (2004)], a new method was introduced for performing exact quantum dynamics calculations. The method uses a 'weylet' basis set (orthogonalized Weyl-Heisenberg wavelets) combined with phase space truncation, to defeat the exponential scaling of CPU effort with system dimensionality-the first method ever able to achieve this long-standing goal. Here, we develop another such method, which uses a much more convenient basis of momentum-symmetrized Gaussians. Despite being non-orthogonal, symmetrized Gaussians are collectively local, allowing for effective phase space truncation. A dimension-independent code for computing energy eigenstates of both coupled and uncoupled systems has been created, exploiting massively parallel algorithms. Results are presented for model isotropic uncoupled harmonic oscillators and coupled anharmonic oscillators up to 27 dimensions. These are compared with the previous weylet calculations (uncoupled harmonic oscillators up to 15 dimensions), and found to be essentially just as efficient. Coupled system results are also compared to corresponding exact results obtained using a harmonic oscillator basis, and also to approximate results obtained using first-order perturbation theory up to the maximum dimensionality for which the latter may be feasibly obtained (four dimensions).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stability-preserving Lossy Compression for Large-scale Partial Differential Equations

Checkpoint/Restart (C/R) strategies are vital for fault tolerance in PDE-based scientific simulations, yet traditional checkpointing incurs significant I/O overhead. Lossy compression offers a scalable solution by reducing checkpoint data size, but conventional methods often lack control over physical invariants (e.g., energy), leading to instability such as oscillations or divergence in Partial Differential Equations (PDE) systems. This paper introduces a stability-preserving compression approach tailored for PDE simulations by explicitly controlling kinetic and potential energy perturbations to ensure stable restarts. Extensive experiments conducted across diverse PDE configurations demonstrate that our method maintains numerical stability with minimal error magnification—even across multiple checkpoint-restart cycles—outperforming state-of-the-art lossy compressors. Parallel evaluations on the Frontier supercomputer show up to 8.4× improvement in checkpoint write performance and 6.3× in read performance, while maintaining relative L2 errors ∼ 2e-6 throughout continued simulation. These results provide practical guidance for balancing compression accuracy, stability, and computational efficiency in large-scale PDE applications.

Gong, Qian [ORNL] (ORCID:0000000235704142)↗

An optimized FM-index library for nucleotide and amino acid search

Abstract Background Pattern matching is a key step in a variety of biological sequence analysis pipelines. The FM-index is a compressed data structure for pattern matching, with search run time that is independent of the length of the database text. Implementation of the FM-index is reasonably complicated, so that increased adoption will be aided by the availability of a fast and flexible FM-index library. Results We present AvxWindowedFMindex (AWFM-index), a lightweight, open-source, thread-parallel FM-index library written in C that is optimized for indexing nucleotide and amino acid sequences. AWFM-index introduces a new approach to storing FM-index data in a strided bit-vector format that enables extremely efficient computation of the FM-index occurrence function via AVX2 bitwise instructions, and combines this with optional on-disk storage of the index’s suffix array and a cache-efficient lookup table for partial k-mer searches. The AWFM-index performs exact match count and locate queries faster than SeqAn3’s FM-index implementation across a range of comparable memory footprints. When optimized for speed, AWFM-index is $$\sim $$ ∼ 2–4x faster than SeqAn3 for nucleotide search, and $$\sim $$ ∼ 2–6x faster for amino acid search; it is also $$\sim $$ ∼ 4x faster with similar memory footprint when storing the suffix array in on-disk SSD storage. Conclusions AWFM-index is easy to incorporate into bioinformatics software, offers run-time performance parameterization, and provides clients with FM-index functionality at both a high-level (count or locate all instances of a query string) and low-level (step-wise control of the FM-index backward-search process). The open-source library is available for download at https://github.com/TravisWheelerLab/AvxWindowFmIndex.

59 BASIC BIOLOGICAL SCIENCES↗

Active Time-Domain Reflectometry for Unattended Safeguards Systems FY15 Report

The International Atomic Energy Agency (IAEA) continues to expand its use of unattended measurement systems. An increasing number of systems and an expanding family of instruments create challenges in terms of deployment efficiency and the implementation of data authentication measures. In collaboration with the IAEA, tamper-indicating measures to address data-transmission authentication challenges with unattended safeguards systems are under investigation. Pacific Northwest National Laboratory (PNNL) is studying the viability of active time-domain reflectometry (TDR) along two parallel but interconnected paths: (1) swept-frequency TDR as the highly flexible, laboratory gold standard to which field-deployable options can be compared, and (2) a low-cost commercially available spread-spectrum TDR technology as one option for field implementation. This report describes PNNL’s FY15 progress in the viability study including: an overview of the TDR methods under investigation; description of the testing configurations and mock tampering scenarios; results from a preliminary sensitivity comparison of the two TDR methods; demonstration of a quantitative metric for estimating field performance that acknowledges the need for high detection probability while minimizing false alarms. FY15 progress reported here sets the stage for a rigorous comparison of the candidate TDR methods, over a range of deployment scenarios and perturbing effects typical of IAEA unattended monitoring systems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Multi-level Layout Optimization for Efficient Spatio-temporal Queries on ISABELA-compressed Data

The size and scope of cutting-edge scientific simulations are growing much faster than the I/O subsystems of their runtime environments, not only making I/O the primary bottleneck, but also consuming space that pushes the storage capacities of many computing facilities. These problems are exacerbated by the need to perform data-intensive analytics applications, such as querying the dataset by variable and spatio-temporal constraints, for what current database technologies commonly build query indices of size greater than that of the raw data. To help solve these problems, we present a parallel query-processing engine that can handle both range queries and queries with spatio-temporal constraints, on B-spline compressed data with user-controlled accuracy. Our method adapts to widening gaps between computation and I/O performance by querying on compressed metadata separated into bins by variable values, utilizing Hilbert space-filling curves to optimize for spatial constraints and aggregating data access to improve locality of per-bin stored data, reducing the false positive rate and latency bound I/O operations (such as seek) substantially. We show our method to be efficient with respect to storage, computation, and I/O compared to existing database technologies optimized for query processing on scientific data.

Computer Science↗

Efficient Synthesis of Graph Methods: a Dynamically Scheduled Architecture

RDF databases naturally map to a graph representation and employ languages, such as SPARQL, that implements queries as graph pattern matching routines. Graph methods exhibit an irregular behavior: they present unpredictable, fine-grained data accesses, and are synchronization inten- sive. Graph data structures expose large amounts of dy- namic parallelism, but are difficult to partition without gen- erating load unbalance. In this paper, we present a novel ar- chitecture to improve the synthesis of graph methods. Our design addresses the issues of these algorithms with two com- ponents: a Dynamic Task Scheduler (DTS), which reduces load unbalance and maximize resource utilization, and a Hi- erarchical Memory Interface controller (HMI), which pro- vides support for concurrent memory operations on multi- ported/multi-banked shared memories. We evaluate our ap- proach by generating the accelerators for a set of SPARQL queries from the Lehigh University Benchmark (LUBM). We first analyze the load unbalance of these queries, showing that execution time among tasks can differ even of order of magnitudes. We then synthesize the queries and com- pare the performance of the resulting accelerators against the current state of the art. Experimental results show that our solution provides a speedup over the serial implementa- tion close to the theoretical maximum and a speedup up to 3.45 over a baseline parallel implementation. We conclude our study by exploring the design space to achieve maximum memory channels utilization. The best design used at least three of the four memory channels for more than 90% of the execution time.

architecture↗

Scientific data analysis on data-parallel platforms.

As scientific computing users migrate to petaflop platforms that promise to generate multi-terabyte datasets, there is a growing need in the community to be able to embed sophisticated analysis algorithms in the computing platforms' storage systems. Data Warehouse Appliances (DWAs) are attractive for this work, due to their ability to store and process massive datasets efficiently. While DWAs have been utilized effectively in data-mining and informatics applications, they remain largely unproven in scientific workloads. In this paper we present our experiences in adapting two mesh analysis algorithms to function on five different DWA architectures: two Netezza database appliances, an XtremeData dbX database, a LexisNexis DAS, and multiple Hadoop MapReduce clusters. The main contribution of this work is insight into the differences between these DWAs from a user's perspective. In addition, we present performance measurements for ten DWA systems to help understand the impact of different architectural trade-offs in these systems.

99 GENERAL AND MISCELLANEOUS↗

Efficient GPU implementation for Particle in Cell algorithm

Particle in cell method is widely used method in the plasma physics to study the trajectories of charged particles under electromagnetic fields. The PIC algorithm is computationally intensive and its time requirements are proportional to the number of charged particles involved in the simulation. The focus of the paper is to parallelize the PIC algorithm on Graphics Processing Unit (GPU). We present several performance tradeoffs related to the small shared memory and atomic operations on the GPU to achieve high performance.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Refine your search to explore more results.