Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational pipelines”

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 289 records · Page 16

iDDS: intelligent distributed dispatch and scheduling for workflow orchestration

The intelligent distributed dispatch and scheduling (iDDS) service is a versatile workflow orchestration system designed for large-scale, distributed scientific computing. iDDS extends traditional workload and data management by integrating data-aware execution, conditional logic, and programmable workflows, enabling automation of complex and dynamic processing pipelines. Originally developed for the ATLAS experiment at the large hadron collider, iDDS has evolved into an experiment-agnostic platform that supports both template-driven workflows and a Function-as-a-Task model for Python-based orchestration. This paper presents the architecture and core components of iDDS, highlighting its scalability, modular message-driven design, and integration with systems such as PanDA and Rucio. We demonstrate its versatility through real-world use cases: fine-grained tape resource optimization for ATLAS, orchestration of large Directed Acyclic Graph (DAG) workflows for the Rubin Observatory, distributed hyperparameter optimization for machine learning applications, active learning for physics analyses, and AI-assisted detector design at the electron–ion collider. By unifying workload scheduling, data movement, and adaptive decision-making, iDDS reduces operational overhead and enables reproducible, high-throughput workflows across heterogeneous infrastructures. We conclude with current challenges and future directions, including interactive, cloud-native, and serverless workflow support.

97 MATHEMATICS AND COMPUTING↗

Policy Considerations When Federating Facilities for Experimental and Observational Data Analysis

Today’s computational, experimental, and observational facilities afford us tremendous opportunities to couple theory and experiment at increasingly large scales. Empirical sensing capabilities are growing dramatically with beam line and detector improvements, and with advances in our ability to deploy large-scale data gathering observations of the natural world. The coupling of computational simulations and analysis to process the data from experimental and observational facilities is giving rise to cross-facility workflows. Such federations of facilities are in fact becoming an explicit requirement for large-scale scientific discovery. As we scale up these pipelines of scientific discovery, each participating facility needs to establish and align policies so that the federation can work seamlessly in an end-to-end manner. This chapter outlines specific policy considerations in enabling the federation of facilities for data analysis. Design choices and vital policy decisions cover the areas of data acquisition and storage, data transfer, computational resource allocation and co-scheduling, seamless federated user access, and cross-cutting governance. By highlighting the explicit and implicit interdependencies between facilities, we aim to provide facility designers and policymakers the information on policy issues to address early in a facility’s operations, thus enabling successful cross-facility federation and improved experimental and observational data analysis outcomes.

Shankar, Mallikarjun (Arjun)↗

AEPF: Attention-Enabled Point Fusion for 3D Object Detection

Current state-of-the-art (SOTA) LiDAR-only detectors perform well for 3D object detection tasks, but point cloud data are typically sparse and lacks semantic information. Detailed semantic information obtained from camera images can be added with existing LiDAR-based detectors to create a robust 3D detection pipeline. With two different data types, a major challenge in developing multi-modal sensor fusion networks is to achieve effective data fusion while managing computational resources. With separate 2D and 3D feature extraction backbones, feature fusion can become more challenging as these modes generate different gradients, leading to gradient conflicts and suboptimal convergence during network optimization. To this end, we propose a 3D object detection method, Attention-Enabled Point Fusion (AEPF). AEPF uses images and voxelized point cloud data as inputs and estimates the 3D bounding boxes of object locations as outputs. An attention mechanism is introduced to an existing feature fusion strategy to improve 3D detection accuracy and two variants are proposed. These two variants, AEPF-Small and AEPF-Large, address different needs. AEPF-Small, with a lightweight attention module and fewer parameters, offers fast inference. AEPF-Large, with a more complex attention module and increased parameters, provides higher accuracy than baseline models. Experimental results on the KITTI validation set show that AEPF-Small maintains SOTA 3D detection accuracy while inferencing at higher speeds. AEPF-Large achieves mean average precision scores of 91.13, 79.06, and 76.15 for the car class’s easy, medium, and hard targets, respectively, in the KITTI validation set. Results from ablation experiments are also presented to support the choice of model architecture.

Chemistry↗

The LLNL nuclear data infrastructure for the GNDS data format

The next generation of nuclear data infrastructure tools at the Livermore National Laboratory (LLNL) consists of pipeline of codes that read and process nuclear data from evaluated files saved in the new GNDS (Generalised Nuclear Data Structure) nuclear data format. The processing code FUDGE (For Updating Data and Generating Evaluations) is at the front-end of this pipeline as it reads and process the evaluated data for use in downstream transport codes. FUDGE is Python based with C and C++ extensions for computationally intensive tasks. As is the case for the evaluated data, the processed output is also saved in the GNDS format and the GIDI+ API is provided as the interface between the processed data and the transport codes. GIDI+ is a C++ based suite of codes and it includes GIDI (General Interaction Data Interface), a library for reading and writing GNDS data, and MCGIDI which is the cross section lookup, and reaction and product distribution sampling interface between Monte Carlo transport codes and the GNDS data. GIDI provides methods for easy access to the multi-group processed GNDS data and this is demonstrated through its implementation in ARDRA, the LLNL deterministic transport code. The evaluation and sampling methods in MCGIDI are available as both CPU and GPU methods which facilitates the use of MCGIDI in both traditional CPU-based as well as the next generation mixed model computational architectures. This is demonstrated through the GIDI+ implementation in MERCURY, the LLNL Monte Carlo transport code. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

PATOKA: Simulating Electromagnetic Observables of Black Hole Accretion

Abstract The Event Horizon Telescope (EHT) has released analyses of reconstructed images of horizon-scale millimeter emission near the supermassive black hole at the center of the M87 galaxy. Parts of the analyses made use of a large library of synthetic black hole images and spectra, which were produced using numerical general relativistic magnetohydrodynamics fluid simulations and polarized ray tracing. In this article, we describe the PATOKA pipeline, which was used to generate the Illinois contribution to the EHT simulation library. We begin by describing the relevant accretion systems and radiative processes. We then describe the details of the three numerical codes we use, iharm , ipole , and igrmonty , paying particular attention to differences between the current generation of the codes and the originally published versions. Finally, we provide a brief overview of simulated data as produced by PATOKA and conclude with a discussion of limitations and future directions.

79 ASTRONOMY AND ASTROPHYSICS↗

Real-Time Highly Resolved Spatial-Temporal Vehicle Energy Consumption Estimation Using Machine Learning and Probe Data

Real-time highly resolved spatial-temporal vehicle energy consumption is a key missing dimension in transportation data. Most roadway link-level vehicle energy consumption data are estimated using average annual daily traffic measures derived from the Highway Performance Monitoring System; however, this method does not reflect day-to-day energy consumption fluctuations. As transportation planners and operators are becoming more environmentally attentive, they need accurate real-time link-level vehicle energy consumption data to assess energy and emissions; to incentivize energy-efficient routing; and to estimate energy impact caused by congestion, major events, and severe weather. This paper presents a computational workflow to automate the estimation of time-resolved vehicle energy consumption for each link in a road network of interest using vehicle probe speed and count data in conjunction with machine learning methods in real time. The real-time pipeline can deliver energy estimates within a couple seconds on query to its interface. The proposed method was evaluated on the transportation network of the metropolitan area of Chattanooga, Tennessee. The volume estimation results were validated with ground truth traffic volume data collected in the field. To demonstrate the effectiveness of the proposed method, the energy consumption pipeline was applied to real-world data to quantify road transportation-related energy reduction because of mitigation policies to slow the spread of COVID-19 and to measure energy loss resulting from congestion.

Severino, Joseph↗

Bayesian Optimization for Reactor Design Optimization

This study present a test case in which the Bayesian Optimization method is applied to a simulation-based reactor core design optimization problem. The test case aims to showcase the potential of an automated design optimization algorithm for reactor designs by streamlining the reactor core design workflow, given the high computational cost of simulations. The contributions of this work are threefold. First, the existing HTGR model is converted into a simulation-based design optimization test case by developing a pipeline that enables modification of key design parameters and evaluates design performance based on simulation outputs. Second, Bayesian Optimization is implemented and adapted to demonstrate the feasibility of automatic design optimization for nuclear reactor core. Proposed approach leverages Gaussian Process models to characterize the relationship between design variables and performance metrics, while incorporating novel acquisition functions that balance exploration of the design space with exploitation of promising configurations. This implementation lays the foundation for the future developments of reactor design optimization algorithms.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Scalable Data-Intensive Geocomputation: A Design for Real-Time Continental Flood Inundation Mapping

The convergence of data-intensive and extreme-scale computing enables an integrated software and data ecosystem for scientific discovery. Developments in this realm will fuel transformative research in data-driven interdisciplinary domains. Geocomputation provides computing paradigms in Geographic Information Systems (GIS) for interactive computing of geographic data, processes, models, and maps. Because GIS is data-driven, the computational scalability of a geocomputation workflow is directly related to the scale of the GIS data layers, their resolution and extent, as well as the velocity of the geo-located data streams to be processed. Unique in high user interactivity and low end-to-end latency requirements, geocomputation applications will dramatically benefit from the convergence of high-end data analytics (HDA) and high-performance computing (HPC). The application level challenge, however, is to identify and eliminate computational bottlenecks that arise along a geocomputation workflow. Indeed, poor scalability at any of the workflow components is detrimental to the entire end-to-end pipeline. Here, we study a large geocomputation use case in flood inundation mapping that handles multiple national-scale geospatial datasets and targets low end-to-end latency. We discuss benefits and challenges for harnessing both HDA and HPC for data-intensive geospatial data processing and intensive numerical modeling of geographic processes. We propose an HDA+HPC geocomputation architecture design that couples HDA (e.g., Spark)-based spatial data handling and HPC-based parallel data modeling. Key techniques for coupling HDA and HPC to bridge the two different software stacks are reviewed and discussed.

Liu, Yan↗

Dark energy survey year 3 results: cosmology from galaxy clustering and galaxy–galaxy lensing in harmonic space

We present the joint tomographic analysis of galaxy-galaxy lensing and galaxy clustering in harmonic space (HS), using galaxy catalogues from the first three years of observations by the Dark Energy Survey (DES Y3). We utilize the redMaGiC and MagLim catalogues as lens galaxies and the metacalibration catalogue as source galaxies. The measurements of angular power spectra are performed using the pseudo-$C_\ell$ method, and our theoretical modelling follows the fiducial analyses performed by DES Y3 in configuration space, accounting for galaxy bias, intrinsic alignments, magnification bias, shear magnification bias and photometric redshift uncertainties. We explore different approaches for scale cuts based on non-linear galaxy bias and baryonic effects contamination. Our fiducial covariance matrix is computed analytically, accounting for mask geometry in the Gaussian term, and including non-Gaussian contributions and super-sample covariance terms. To validate our HS pipelines and covariance matrix, we used a suite of 1800 log-normal simulations. We also perform a series of stress tests to gauge the robustness of our HS analysis. In the $\Lambda$CDM model, the clustering amplitude $S_8 =\sigma _8(\Omega _m/0.3)^{0.5}$ is constrained to $S_8 = 0.704\pm 0.029$ and $S_8 = 0.753\pm 0.024$ (68 per cent C.L.) for the redMaGiC and MagLim catalogues, respectively. For the wCDM, the dark energy equation of state is constrained to $w = -1.28 \pm 0.29$ and $w = -1.26^{+0.34}_{-0.27}$, for redMaGiC and MagLim catalogues, respectively. These results are compatible with the corresponding DES Y3 results in configuration space and pave the way for HS analyses using the DES Y6 data.

(cosmology:) cosmological parameters↗

Design-Space Exploration for Inverse-Design of Wind Turbine Blades Using Data-Driven Methods

The state-of-the-practice aerodynamic design methods for wind turbine blades is typically based on Blade-Element Momentum (BEM) theory using a pre-designed frozen family of airfoils. The airfoils are themselves typically designed using panel methods. The design of the next-generation of large flexible rotors will need to capture the non-linear aerodynamics and three-dimensional flow to reduce the levelized cost of wind energy. Data-driven methods for aerodynamic design using data generated by computational fluid dynamics offer an attractive alternative to BEM-based methods that captures the non-linear aerodynamics of the component airfoils as well as the root and tip sections. In this work, we develop and demonstrate a framework to "smartly" explore the relevant design space in combination with an appropriate automated CFD pipeline to evaluate the aerodynamics of each design. The design-space exploration framework uses appropriate perturbations to the airfoil shape and induction profile from a baseline shape in combination with the inverse-design using BEM. The resulting designs are evaluated using an automated CFD pipeline using the in-house CFD solver framework "Mercury". We perform verification and validation to establish the capability of the Mercury framework to predict the aerodynamic performance of wind turbines. The CFD simulation of the perturbed blade shapes are optimized to restart from the converged baseline simulation to reduce the computational time. Finally, we demonstrate the design-space exploration technique for the design of the outboard section and the full rotor using perturbations to the shape and operating conditions of the NREL 5-MW turbine.

aerodynamic design methods↗

Reduced Order Model for Guided Wave Propagation on Gas Pipelines to Enable Real-Time Simulation

Reduced order model for simulation of Guided wave propagation is presented here. The utilization of reduced order models ensures efficient data generation for a variety of parameters where it takes huge computational effort to simulate, crucial for timely monitoring and decision-making. Autoencoder based reduced order models are proposed here, which are trained on simulated data from open-source finite element framework, Firedrake.

Bukka, Sandeep Reddy↗

Reduced Order Model for Guided Wave Propagation on Gas Pipelines to Enable Real-Time Simulation

Reduced order model for simulation of Guided wave propagation is presented here. The utilization of reduced order models ensures efficient data generation for a variety of parameters where it takes huge computational effort to simulate, crucial for timely monitoring and decision-making. Autoencoder based reduced order models are proposed here, which are trained on simulated data from open-source finite element framework, Firedrake.

Bukka, Sandeep Reddy↗

Impacts of floating-point non-associativity on reproducibility for HPC and deep learning applications

Run to run variability in parallel programs caused by floating-point non-associativity has been known to significantly affect reproducibility in iterative algorithms, due to accumulating errors. Non-reproducibility can critically affect the efficiency and effectiveness of correctness testing for stochastic programs. Recently, the sensitivity of deep learning training and inference pipelines to floating-point non-associativity has been found to sometimes be extreme. It can prevent certification for commercial applications, accurate assessment of robustness and sensitivity, and bug detection. New approaches in scientific computing applications have coupled deep learning models with high-performance computing, leading to an aggravation of debugging and testing challenges. Here we perform an investigation of the statistical properties of floating-point non-associativity within modern parallel programming models, and analyze performance and productivity impacts of replacing atomic operations with deterministic alternatives on GPUs. We examine the recently-added deterministic options in PyTorch within the context of GPU deployment for deep learning, uncovering and quantifying the impacts of input parameters triggering run to run variability and reporting on the reliability and completeness of the documentation. Finally, we evaluate the strategy of exploiting automatic determinism that could be provided by deterministic hardware, using the Groq LPUTM accelerator for inference portions of the deep learning pipeline. We demonstrate the benefits that a hardware-based strategy can provide within reproducibility and correctness efforts.

Shanmugavelu, Sanjif↗

Optimization of Thermal Conductance at Interfaces Using Machine Learning Algorithms

We report optimization of thermal transport across the interface of two different materials is critical to micro-/nanoscale electronic, photonic, and phononic devices. Although several examples of compositional intermixing at the interfaces having a positive effect on interfacial thermal conductance (ITC) have been reported, an optimum arrangement has not yet been determined because of the large number of potential atomic configurations and the significant computational cost of evaluation. On the other hand, computation-driven materials design efforts are rising in popularity and importance. Yet, the scalability and transferability of machine learning models remain as challenges in creating a complete pipeline for the simulation and analysis of large molecular systems. In this work we present a scalable Bayesian optimization framework, which leverages dynamic spawning of jobs through the Message Passing Interface (MPI) to run multiple parallel molecular dynamics simulations within a parent MPI job to optimize heat transfer at the silicon and aluminum (Si/Al) interface. We found a maximum of 50% increase in the ITC when introducing a two-layer intermixed region that consists of a higher percentage of Si. Because of the random nature of the intermixing, the magnitude of increase in the ITC varies. We observed that both homogeneity/heterogeneity of the intermixing and the intrinsic stochastic nature of molecular dynamics simulations account for the variance in ITC.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Artificial Intelligence Strategy and Implementation [Slides]

LANL strategic activities for AI center on this goal: accelerate development of AI-enabled capabilities for science and security, with focus on developing and applying mission-relevant core AI technologies, creating an AI workforce pipeline and training opportunities, and building AI partnerships and community.

42 ENGINEERING↗

HEPTAPOD: Orchestrating High Energy Physics Workflows Towards Autonomous Agency

Many workflows in high-energy-physics (HEP) stand to benefit from recent advances in transformer-based large language models (LLMs). While early applications of LLMs focused on text generation and code completion, modern LLMs now support orchestrated agency: the coordinated execution of complex, multi-step tasks through tool use, structured context, and iterative reasoning. We introduce the HEP Toolkit for Agentic Planning, Orchestration, and Deployment (HEPTAPOD), an orchestration framework designed to bring this emerging paradigm to HEP pipelines. The framework enables LLMs to interface with domain-specific tools, construct and manage simulation workflows, and assist in common utility and data analysis tasks through schema-validated operations and run-card-driven configuration. To demonstrate these capabilities, we consider a representative Beyond the Standard Model (BSM) Monte Carlo validation pipeline that spans model generation, event simulation, and downstream analysis within a unified, reproducible workflow. HEPTAPOD provides a structured and auditable layer between human researchers, LLMs, and computational infrastructure, establishing a foundation for transparent, human-in-the-loop systems.

Menzo, Tony [Alabama U.; Fermilab] (ORCID:00000002↗

Navigating Exascale Operational Data Analytics: From Inundation to Insight

In this paper, we address the challenges in achieving sustainable data-driven efficiency by providing a detailed exploration of the end-to-end operational data analytics (ODA) framework that evolved through two generations of supercomputer systems at the Oak Ridge Leadership Computing Facility (OLCF). This framework addresses large data streams ingested from heavily instrumented HPC environment that accumulates multi-terabytes per day. We outline the multifaceted data life cycle across HPC procurement, operations, and research & development, identifying key obstacles and design decisions that shape effective strategies in building and supporting data pipelines end-to-end. By sharing key insights and lessons learned from our experience, we offer recommendations for the HPC community on enabling sustainable operational data analytics and beyond. Our contributions aim to bridge the gap between potential and real benefits of operational data, guiding future efforts towards integrated and sustainable operational intelligence in high-performance computing environments.

Shin, Woong↗

Inductive predictions of hydrologic events using a Long Short-Term Memory network and the Soil and Water Assessment Tool

We present machine learning methods to predict hydrologic features such as streamflow and soil moisture from spatially and temporally varying hydrological and meteorological data. Here, we used a temporal reduction technique to reduce computation and memory requirements and trained a Long Short-Term Memory (LSTM) network to predict soil moisture and streamflow over multiple watersheds. We show LSTM networks can be trained in a fraction of the time required by complex process-based and attention-based models such as Soil and Water Assessment Tool (SWAT) and GeoMAN without sacrificing accuracy. We also demonstrate that outside data - sourced from a watershed other than the target - can be used to train LSTM to comparable or even superior prediction accuracy. The success of LSTM in such spatially-inductive settings shows hydrologic features can be predicted with minimal prior knowledge of the watershed in question. Finally, we make all methodologies of this work publicly available as an end-to-end software pipeline that facilitates rapid prototyping of hydrologic learners.

97 MATHEMATICS AND COMPUTING↗