Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,387 records · Page 77
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Impact of High Performance Computing on the Detailed Simulation of Subsurface Flow and Contaminant Transport Using eSTOMP - 16341

The ability to model subsurface processes at the field-scale is essential to site closure and remedial action decisions. Field-scale models often require high-performance computing to meet the computational demands associated with complex systems, model calibration, and uncertainty quantification. eSTOMP, a parallel version of STOMP, is an analytical tool that meets the need for investigating coupled processes in the subsurface involving regional multi-fluid flow and biogeochemistry. The scalability of eSTOMP makes it ideal for simulating contaminant and geochemical reactive transport when long run times result from execution of a serial code. To demonstrate the impact of high-performance computation on subsurface analyses, the application of eSTOMP is presented for two sites. The first site involves uranium surface complexation within a highly dynamic, variably saturated flow field. The use of this model in conjunction with continued field monitoring is expected to provide a rigorous basis for developing operational strategies for field remediation and for defining defensible remediation endpoints. The second site involves the long-term dissolution of low-level radioactive glass emplaced within a near-surface repository. The waste form release rate is evaluated by modeling the basic physical and chemical processes that are known to control the waste form dissolution behavior, including pH and composition of the fluid contacting the glass. Simulations demonstrate that glass dissolution rates vary both in time and as a function of position within the disposal system, and that a 'leach rate' or radionuclide release rate parameter can only be estimated after identifying these impacts in a dynamic system. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2018

An overlapping domain decomposition method for large-scale problems

Discretization of dynamical models defined through partial differential equations leads to large-scale systems. Time-depending condition involves an iterative integration of such kind of systems. In this paper, a novel technique based on overlapped domain decomposition, without preconditioner and scalable, is presented. Due to the domain decomposition, subproblems are solved in parallel without communications, cutting off the computation time and optimizing the computational cost. This direct method describes an optimized parallel strategy to solve the initial problem, providing the exact solution, up to rounding errors. Moreover, it takes into account both physical nature of the problem and deriving numerical properties of the system. It is highly recommended in case of band matrices and a long time interval because of an increasing gain in terms of performance and computational cost with the number of integrations. A deep analysis of the computational cost concludes the paper.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A hybrid surrogate modeling framework for the Digital Twin of a Fluoride-salt-cooled High-temperature Reactor (FHR)

While nuclear energy is a non-greenhouse-gas emitting energy source, expensive operational costs due to the high-level of safety requirements decreases their competitiveness in the sustainable energy market. Advanced reactor concepts paired with Digital Twins aim to increase the commercialization gains of nuclear energy by reducing operational costs, increasing reactor reliability and enhancing power generation. To support Digital Twin tasks such as real-time autonomous control, proactive maintenance monitoring or optimizing power demand operations, a fast and accurate virtual representation of the Nuclear Power Plant (NPP) is required. The computational cost of high-fidelity, physics-based models are unsuitable for real-time analysis or scalability. Here, in this work, a hybrid surrogate modeling framework is developed fora Fluoride-salt-cooled High-temperature Reactor (FHR) that leverages physics-inspired models for key reactor components and uses data-driven methods for rapid system state space prediction. The Xenon reactivity feedback model is integrated to inform the surrogate model about the reactor core and the homologous pump theory model is the basis for representing pump degradation. Using a detailed, two dimensional thermal hydraulics model to generate data on the FHR, we train a network of Vectorized Autoregressive Moving-Average with eXogenous input (VARMAX) models to predict the remaining state values. The result is a surrogate model that provides a detailed reactor state representation of 41 system states and a pump degradation analysis. The framework is applied to Load Follows profiles, yielding high accuracy and a speedup that is more than 4000x faster compared to the higher- fidelity thermal hydraulics model, enabling real-time operational intelligence and applications in long horizon predictions. While the surrogate model framework is demonstrated for the particular case of FHR, the hybrid physical/data-driven modeling approach including the network of surrogates and the underlying modularity has the potential to be applied to other physical asset systems.

Digital Twins↗
DOE OSTI2015

Progress in fast, accurate multi-scale climate simulations

We present a survey of physical and computational techniques that have the potential to contribute to the next generation of high-fidelity, multi-scale climate simulations. Examples of the climate science problems that can be investigated with more depth with these computational improvements include the capture of remote forcings of localized hydrological extreme events, an accurate representation of cloud features over a range of spatial and temporal scales, and parallel, large ensembles of simulations to more effectively explore model sensitivities and uncertainties. Numerical techniques, such as adaptive mesh refinement, implicit time integration, and separate treatment of fast physical time scales are enabling improved accuracy and fidelity in simulation of dynamics and allowing more complete representations of climate features at the global scale. At the same time, partnerships with computer science teams have focused on taking advantage of evolving computer architectures such as many-core processors and GPUs. As a result, approaches which were previously considered prohibitively costly have become both more efficient and scalable. In combination, progress in these three critical areas is poised to transform climate modeling in the coming decades.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2013

Atomistics of vapour–liquid–solid nanowire growth

Vapour–liquid–solid route and its variants are routinely used for scalable synthesis of semiconducting nanowires, yet the fundamental growth processes remain unknown. Here we employ atomic-scale computations based on model potentials to study the stability and growth of gold-catalysed silicon nanowires. Equilibrium studies uncover segregation at the solid-like surface of the catalyst particle, a liquid AuSi droplet, and a silicon-rich droplet–nanowire interface enveloped by heterogeneous truncating facets. Supersaturation of the droplets leads to rapid one-dimensional growth on the truncating facets and much slower nucleation-controlled two-dimensional growth on the main facet. Surface diffusion is suppressed and the excess Si flux occurs through the droplet bulk which, together with the Si-rich interface and contact line, lowers the nucleation barrier on the main facet. The ensuing step flow is modified by Au diffusion away from the step edges. Our study highlights key interfacial characteristics for morphological and compositional control of semiconducting nanowire arrays.

36 MATERIALS SCIENCE↗
DOE OSTI2015

How Much Higher Can HTCondor Fly?

The HTCondor high throughput computing system is heavily used in the high energy physics (HEP) community as the batch system for several Worldwide LHC Computing Grid (WLCG) resources. Moreover, it is the backbone of GlidelnWMS, the pilot system used by the computing organization of the Compact Muon Solenoid (CMS) experiment. To prepare for LHC Run 2, we probed the scalability limits of new versions and configurations of HTCondor with a goal of reaching 200,000 simultaneous running jobs in a single internationally distributed dynamic pool.In this paper, we first describe how we created an opportunistic distributed testbed capable of exercising runs with 200,000 simultaneous jobs without impacting production. This testbed methodology is appropriate not only for scale testing HTCondor, but potentially for many other services. In addition to the test conditions and the testbed topology, we include the suggested configuration options used to obtain the scaling results, and describe some of the changes to HTCondor inspired by our testing that enabled sustained operations at scales well beyond previous limits.

Fajardo, E. M.↗
DOE OSTI2021

The DAQ system of the 12,000 channel CMS high granularity calorimeter prototype

The CMS experiment at the CERN LHC will be upgraded to accommodate the 5-fold increase in the instantaneous luminosity expected at the High-Luminosity LHC (HL-LHC). Concomitant with this increase will be an increase in the number of interactions in each bunch crossing and a significant increase in the total ionising dose and fluence. One part of this upgrade is the replacement of the current endcap calorimeters with a high granularity sampling calorimeter equipped with silicon sensors, designed to manage the high collision rates. As part of the development of this calorimeter, a series of beam tests have been conducted with different sampling configurations using prototype segmented silicon detectors. In the most recent of these tests, conducted in late 2018 at the CERN SPS, the performance of a prototype calorimeter equipped with ≈12,000 channels of silicon sensors was studied with beams of high-energy electrons, pions and muons. This paper describes the custom-built scalable data acquisition system that was built with readily available FPGA mezzanines and low-cost Raspberry Pi computers.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Merged-Element Transmon

Transmon qubits are ubiquitous in the pursuit of quantum computing using superconducting circuits. However, they have some drawbacks that still need to be addressed. Most importantly, the scalability of transmons is limited by the large device footprint needed to reduce the participation of the lossy capacitive parts of the circuit. In this work, we investigate and evaluate losses in an alternative device geometry, namely, the merged-element transmon (mergemon). To this end, we replace the large external shunt capacitor of a traditional transmon with the intrinsic capacitance of a Josephson junction and achieve an approximately 100 times reduction in qubit dimensions. We report the implementation of the mergemon using a sputtered Nb–amorphous-Si–Nb trilayer film. In an experiment below 10 mK, the frequency of the readout resonator, capacitively coupled to the mergemon, exhibits a qubit-state-dependent shift in the low-power regime. The device also demonstrates the single-photon and multiphoton transitions that represent a weakly anharmonic system in two-tone spectroscopy. The transition spectra are explained well with master-equation simulations. Here, a participation-ratio analysis identifies the dielectric loss of the amorphous-Si tunnel barrier and its interfaces as the dominant source for qubit relaxation. We expect the mergemon to achieve high coherence for relatively small device dimensions when implemented with a low-loss, epitaxially grown, and lattice-matched trilayer.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2020

Efficient Data Management in Neutron Scattering Data Reduction Workflows at ORNL

Oak Ridge National Laboratory (ORNL) experimental neutron science facilities produce 1.2 TB a day of raw event-based data that is stored using the standard metadata-rich NeXus schema built on top of the HDF5 file format. Performance of several data reduction workflows is largely determined by the amount of time spent on the loading and processing algorithms in Mantid, an open-source data analysis framework used across several neutron sciences facilities around the world. The present work introduces new data management algorithms to address identified input output (I/O) bottlenecks on Mantid. First, we introduce an in-memory binary-tree metadata index that resemble NeXus data access patterns to provide a scalable search and extraction mechanism. Second, data encapsulation in Mantid algorithms is optimally redesigned to reduce the total compute and memory runtime footprint associated with metadata I/O reconstruction tasks. Results from this work show speed ups in wall-clock time on ORNL data reduction workflows, ranging from 11% to 30% depending on the complexity of the targeted instrument-specific data. Nevertheless, we highlight the need for more research to address reduction challenges as experimental data volumes increase.

Godoy, William↗
DOE OSTI2025

SigTime: Learning and Visually Explaining Time Series Signatures

Understanding and distinguishing temporal patterns in time series data is essential for scientific discovery and decision-making. For example, in biomedical research, uncovering meaningful patterns in physiological signals can improve diagnosis, risk assessment, and patient outcomes. However, existing methods for time series pattern discovery face major challenges, including high computational complexity, limited interpretability, and difficulty in capturing meaningful temporal structures. Here, to address these gaps, we introduce a novel learning framework that jointly trains two Transformer models using complementary time series representations: shapelet-based representations to capture localized temporal structures and traditional feature engineering to encode statistical properties. The learned shapelets serve as interpretable signatures that differentiate time series across classification labels. Additionally, we develop a visual analytics system—SigTime—with coordinated views to facilitate exploration of time series signatures from multiple perspectives, aiding in useful insights generation. We quantitatively evaluate our learning framework on eight publicly available datasets and one proprietary clinical dataset. Additionally, we demonstrate the effectiveness of our system through two usage scenarios along with the domain experts: one involving public ECG data and the other focused on preterm labor analysis.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Integrating and Characterizing HPC Task Runtime Systems for hybrid AI-HPC workloads

Scientific workflows increasingly involve both HPC and machine-learning tasks, combining MPI-based simulations, training, and inference in a single execution. Launchers such as Slurm’s srun constrain concurrency and throughput, making them unsuitable for dynamic and heterogeneous workloads. We present a performance study of RADICAL-Pilot (RP) integrated with Flux and Dragon, two complementary runtime systems that enable hierarchical resource management and high-throughput function execution. Using synthetic and production-scale workloads on Frontier, we characterize the task execution properties of RP across runtime configurations. RP+Flux sustains up to 930 tasks/s, and RP+Flux+Dragon exceeds 1,500 tasks/s with over 99.6% utilization. In contrast, srun peaks at 152 tasks/s and degrades with scale, with utilization below 50%. For IMPECCABLE.v2 drug discovery campaign, RP+Flux reduces makespan by 30–60% relative to srun/Slurm and increases throughput more than four times on up to 1,024. These results demonstrate hybrid runtime integration in RP as a scalable approach for hybrid AI-HPC workloads.

HPC-AI↗
DOE OSTI2012

Effective Software Design and Development for the New Graph Architecture HPC Machines

Software applications need to change and adapt as modern architectures evolve. Nowadays advancement in chip design translates to increased parallelism. Exploiting such parallelism is a major challenge in modern software engineering. Multicore processors are about to introduce a significant change in the way we design and use fundamental data structures. In this work we describe the design and programming principles of a software library of highly concurrent scalable and nonblocking data containers. In this project we have created algorithms and data structures for handling fundamental computations in massively multithreaded contexts, and we have incorporated these into a usable library with familiar look and feel. In this work we demonstrate the first design and implementation of a wait-free hash table. Our multiprocessor data structure design allows a large number of threads to concurrently insert, remove, and retrieve information. Non-blocking designs alleviate the problems traditionally associated with the use of mutual exclusion, such as bottlenecks and thread-safety. Lock-freedom provides the ability to share data without some of the drawbacks associated with locks, however, these designs remain susceptible to starvation. Furthermore, wait-freedom provides all of the benefits of lock-free synchronization with the added assurance that every thread makes progress in a finite number of steps. This implies deadlock-freedom, livelock-freedom, starvation-freedom, freedom from priority inversion, and thread-safety. The challenges of providing the desirable progress and correctness guarantees of wait-free objects makes their design and implementation difficult. There are few wait-free data structures described in the literature. Using only standard atomic operations provided by the hardware, our design is portable; therefore, it is applicable to a variety of data-intensive applications including the domains of embedded systems and supercomputers.Our experimental evaluation shows that our hash table design outperforms the most advanced locking solution, provided by Intel's TBB library, by 22%. When compared to more traditional locking designs we show a performance improvement by a factor of 7.92. When compared to alternative non-blocking designs, our hash table demonstrates solid performance gains in a large majority of cases, typically by a factor of 3.44.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2012

MOCFE-Bone: The 3D-MOC Mini-Application for Exascale Research

MOCFE-Bone is a mini-application that simulates the main procedures in a 3D method of characteristics (MOC) code for numerical solution of the steady state neutron transport equation. 3D MOC was chosen as a specific methodology of interest in exascale computing for nuclear reactor applications because of its heterogeneous geometry capability, high degree of accuracy, and potential for scalability. In developing the mini-app, we focused on emulating the behavior of a production 3D MOC tool without requiring the input overhead associated with such a code. The MOCFE code at Argonne National Laboratory was used to investigate and characterize the behavior of the mini-app; the results of are presented here. Note that the existing MOCFE code resulted from research forays into the potential of 3D-MOC for large scale parallelism and is not a production level tool nor is it optimally implemented. Parts of the mini-app therefore reflect lessons learned and represent how a production-level tool would be written from this point forward rather than simply duplicating MOCFE, which has known scalability issues (i.e. parallelization in energy).

Wolters, E. R.↗
DOE OSTI2013

Kalman-filtered compressive sensing for high resolution estimation of anthropogenic greenhouse gas emissions from sparse measurements.

The estimation of fossil-fuel CO2 emissions (ffCO2) from limited ground-based and satellite measurements of CO2 concentrations will form a key component of the monitoring of treaties aimed at the abatement of greenhouse gas emissions. The limited nature of the measured data leads to a severely-underdetermined estimation problem. If the estimation is performed at fine spatial resolutions, it can also be computationally expensive. In order to enable such estimations, advances are needed in the spatial representation of ffCO2 emissions, scalable inversion algorithms and the identification of observables to measure. To that end, we investigate parsimonious spatial parameterizations of ffCO2 emissions which can be used in atmospheric inversions. We devise and test three random field models, based on wavelets, Gaussian kernels and covariance structures derived from easily-observed proxies of human activity. In doing so, we constructed a novel inversion algorithm, based on compressive sensing and sparse reconstruction, to perform the estimation. We also address scalable ensemble Kalman filters as an inversion mechanism and quantify the impact of Gaussian assumptions inherent in them. We find that the assumption does not impact the estimates of mean ffCO2 source strengths appreciably, but a comparison with Markov chain Monte Carlo estimates show significant differences in the variance of the source strengths. Finally, we study if the very different spatial natures of biogenic and ffCO2 emissions can be used to estimate them, in a disaggregated fashion, solely from CO2 concentration measurements, without extra information from products of incomplete combustion e.g., CO. We find that this is possible during the winter months, though the errors can be as large as 50%.

Ray, Jaideep↗
DOE OSTI2015

Machine Learning for Big Data: A Study to Understand Limits at Scale

This report aims to empirically understand the limits of machine learning when applied to Big Data. We observe that recent innovations in being able to collect, access, organize, integrate, and query massive amounts of data from a wide variety of data sources have brought statistical data mining and machine learning under more scrutiny, evaluation and application for gleaning insights from the data than ever before. Much is expected from algorithms without understanding their limitations at scale while dealing with massive datasets. In that context, we pose and address the following questions How does a machine learning algorithm perform on measures such as accuracy and execution time with increasing sample size and feature dimensionality? Does training with more samples guarantee better accuracy? How many features to compute for a given problem? Do more features guarantee better accuracy? Do efforts to derive and calculate more features and train on larger samples worth the effort? As problems become more complex and traditional binary classification algorithms are replaced with multi-task, multi-class categorization algorithms do parallel learners perform better? What happens to the accuracy of the learning algorithm when trained to categorize multiple classes within the same feature space? Towards finding answers to these questions, we describe the design of an empirical study and present the results. We conclude with the following observations (i) accuracy of the learning algorithm increases with increasing sample size but saturates at a point, beyond which more samples do not contribute to better accuracy/learning, (ii) the richness of the feature space dictates performance - both accuracy and training time, (iii) increased dimensionality often reflected in better performance (higher accuracy in spite of longer training times) but the improvements are not commensurate the efforts for feature computation and training and (iv) accuracy of the learning algorithms drop significantly with multi-class learners training on the same feature matrix and (v) learning algorithms perform well when categories in labeled data are independent (i.e., no relationship or hierarchy exists among categories).

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
NASA NTRS2004

NASA's Integrated Development of Solar Sail Propulsion Project

Solar sails have been studied for a variety of missions and have the potential to provide cost effective, propellantless propulsion that enables longer on-station operation, increased scientific payload mass fraction, and access to previously inaccessible orbits (e. g., non-Keplerian, high solar latitudes, etc.). Research being conducted by the In-Space Propulsion (ISP) Technologies Projects is at the forefront of NASA's efforts to mature propulsion technologies that will enable or enhance a variety of space science missions. Solar sail propulsion systems will be required to meet the challenge of monitoring and predicting space weather by the Office of Space Science's (OSS) Living with a Star (LWS) program. Near-to-mid-term mission needs include monitoring of solar activity and observations at high solar latitudes. Work currently funded by the ISP s Solar Sail Propulsion (SSP) project is based on the quantitative demonstration of scalability of present solar sail subsystem designs and concepts to future mission requirements through ground testing of hardware, computational modeling and analytical simulations. This paper will give an overview of the Solar Sail Propulsion project's major development tasks of fabricating and testing two different subscale (400 square meter sail) solar sail system architectures. It will then be shown how either of these subscale prototypes can evolve into a flight validation system and briefly discuss the mission parameter. The paper will conclude with a discussion on how a flight validation will exercise the quantitative tools needed to demonstrate the scale to the size needed for the Solar Polar Imager and L1-Diamond SEC roadmap missions.

Garbe, Gregory↗
DOE OSTI2011

GPU-based Scalable Volumetric Reconstruction for Multi-view Stereo

We present a new scalable volumetric reconstruction algorithm for multi-view stereo using a graphics processing unit (GPU). It is an effectively parallelized GPU algorithm that simultaneously uses a large number of GPU threads, each of which performs voxel carving, in order to integrate depth maps with images from multiple views. Each depth map, triangulated from pair-wise semi-dense correspondences, represents a view-dependent surface of the scene. This algorithm also provides scalability for large-scale scene reconstruction in a high resolution voxel grid by utilizing streaming and parallel computation. The output is a photo-realistic 3D scene model in a volumetric or point-based representation. We demonstrate the effectiveness and the speed of our algorithm with a synthetic scene and real urban/outdoor scenes. Our method can also be integrated with existing multi-view stereo algorithms such as PMVS2 to fill holes or gaps in textureless regions.

97 MATHEMATICS AND COMPUTING↗