Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “software framework”

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 109 records · Page 6

CMS Experience with Adoption of the Community supported DD4hep Toolkit

DD4hep is an open-source software toolkit that provides comprehensive and complete generic detector descriptions for high energy physics (HEP) detectors. The Compact Muon Solenoid collaboration (CMS) has recently evaluated and adopted DD4hep to replace its custom detector description software. CMS has demanding software requirements as a very large, longrunning experiment that must support legacy geometries and study many possible upgraded detector designs of a constantly evolving detector that will be taking data for many years to come. CMS has chosen DD4hep since it is a high-quality, community-supported solution that will benefit from continuing modernization and maintenance. This presentation will discuss the issues of DD4hep adoption, the advantages and disadvantages of the various design choices, performance results, and the integration of the plugin systems from CMS and Gaudi, another open-source software framework. Recommendations about DD4hep based upon the CMS use cases will also be presented.

Vuosalo, Carl↗

Let’s get our hands dirty: a comprehensive evaluation of DAQDB, key-value store for petascale hot storage

Data acquisition systems are a key component for successful data taking in any experiment. The DAQ is a complex distributed computing system and coordinates all operations, from the data selection stage of interesting events to storage elements. For the High Luminosity upgrade of the Large Hadron Collider, the experiments at CERN need to meet challenging requirements to record data with a much higher occupancy in the detectors. The DAQ system will receive and deliver data with a significantly increased trigger rate, one million events per second, and capacity, terabytes of data per second. An effective way to meet these requirements is to decouple real-time data acquisition from event selection. Data fragments can be temporarily stored in a large distributed key-value store. Fragments belonging to the same event can be then queried on demand, by the data selection processes. Implementing such a model relies on a proper combination of emerging technologies, such as persistent memory, NVMe SSDs, scalable networking, and data structures, as well as high performance, scalable software. In this paper, we present DAQDB (Data Acquisition Database) — an open source implementation of this design that was presented earlier, with an extensive evaluation of this approach, from the single node to the distributed performance. Furthermore, we complement our study with a description of the challenges faced and the lessons learned while integrating DAQDB with the existing software framework of the ATLAS experiment.

Abed Abud, Adam↗

Extending Rucio with modern cloud storage support

Rucio is a software framework designed to facilitate scientific collaborations in efficiently organising, managing, and accessing extensive volumes of data through customizable policies. The framework enables data distribution across globally distributed locations and heterogeneous data centres, integrating various storage and network technologies into a unified federated entity. Rucio offers advanced features like distributed data recovery and adaptive replication, and it exhibits high scalability, modularity, and extensibility. Originally developed to meet the requirements of the high-energy physics experiment ATLAS, Rucio has been continuously expanded to support LHC experiments and diverse scientific communities. Recent R&D projects within these communities have evaluated the integration of both private and commercially-provided cloud storage systems, leading to the development of additional functionalities for seamless integration within Rucio. Furthermore, the underlying systems, FTS and GFAL/Davix, have been extended to cater to specific use cases. This contribution focuses on the technical aspects of this work, particularly the challenges encountered in building a generic interface for self-hosted cloud storage, such as MinIO or CEPH S3 Gateway, and established providers like Google Cloud Storage and Amazon Simple Storage Service. Additionally, the integration of decentralised clouds like SEAL is explored. Key aspects, including authentication and authorisation, direct and remote access, throughput and cost estimation, are highlighted, along with shared experiences in daily operations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Integration of RNTuple in ATLAS Athena

After using ROOT’s TTree I/O subsystem for over two decades and storing more than an exabyte of compressed High Energy Physics (HEP) data, advances in technology have motivated a complete redesign, RNTuple, which breaks backward-compatibility to take better advantage of these storage options. The RNTuple I/O subsystem has been designed to address performance bottlenecks and other shortcomings of TTree. Specifically, RNTuple comes with an updated, more compact binary data format that can be stored both in ROOT files and natively in object stores. It is designed for modern storage hardware (e.g. high-throughput low-latency NVMe SSDs), and provides robust and easy to use interfaces. The binary format of RNTuple is scheduled to become production grade in 2024, and recently has become mature enough to start exploring the integration into software used by HEP experiments. In this contribution, we discuss the developments to support the features as required by the ATLAS analysis Event Data Model (EDM) in RNTuple, which will enable its integration into the Athena software framework. With these developments in place, we evaluate the performance of the current most recent versions of RNTuple-based ATLAS data sets and compare this to that of TTree.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

3D ion gyro-orbit heat load predictions for NSTX-U

Abstract High power tokamaks operate with divertor heat loads capable of destroying the plasma facing components (PFCs). High fidelity heat load predictions are necessary to ascertain the PFC state for design and during operation. Typical heat flux calculations are 2D, time invariant, and assume that power flows directly along the magnetic field lines (the optical approximation). These assumptions neglect the complex 3D geometries employed to protect the PFCs, the time varying nature of the plasma and PFC thermal state, and the helical trajectories of ions with finite Larmor radii (the gyro-orbit approximation). An integrated software framework, the heat flux engineering analysis toolkit (HEAT), was developed to generate time varying optical heat loads applied to real engineering computer aided design (CAD) (Looby et al 2022 Fusion Sci. Technol. 78 10–27). Recently, an ion-gyro orbit module has been added to HEAT. This module calculates the helical trajectories of ions as they gyrate about the magnetic field lines using kinetic theory macro-particles to accelerate the calculation. First, the new gyro-orbit module will be presented. Next, a comparison to existing research is performed. Finally, an analysis of the gyro-orbit heat loads for NSTX-U is presented for diverted discharges using the engineering CAD models utilized for PFC fabrication. Including these gyro-orbit effects can enhance the PFC performance by ‘smearing’ out the magnetic shadows associated with the castellated fish-scaled geometry. Simultaneously, the helical trajectories can degrade performance when they load narrow regions on edges and corners with high heat fluxes. Analysis of the trade-offs between these competing effects is included, and regions for further investigation are identified.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Control Co-Design Studies for a 22 MW Semisubmersible Floating Wind Turbine Platform

We present a control co-design software framework that can be used to optimize floating wind turbines and their controllers. Because this framework has many options for design variables, constraints, and merit figures, along with modeling fidelity levels, we seek to demonstrate best practices for using the tool while designing a floating platform for the new 22 MW offshore reference wind turbine developed within the International Energy Agency Wind Technology Commercialization Programme 55 on Reference Wind Turbines and Farms. During these studies, we evaluate the use of different simulation fidelity levels, the effect of using different load cases for controller tuning, and the difference between sequential and simultaneous control co-design solutions. Based on these efforts, we suggest using an algorithm that performs an initial search of the design space before optimization. We find that solving smaller optimization problems, in a sequential manner, leads to more reliable outcomes in fewer iterations than larger, simultaneous control co-design solutions. However a simultaneous CCD solution produces a platform with a 2% lower mass than the sequential CCD outcome.

17 WIND ENERGY↗

Speeding up particle track reconstruction using a parallel Kalman filter algorithm

One of the most computationally difficult problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is determining the trajectory of charged particles during event reconstruction. Algorithms used at the LHC today rely on Kalman filtering, which builds physical trajectories incrementally while incorporating material effects and error estimation. Recognizing the need for faster computational throughput, we have adapted Kalman-filter-based methods for highly parallel, many-core SIMD architectures that are now prevalent in high-performance hardware. In this paper, we discuss the design and performance of the improved tracking algorithm, referred to as mkFit. A key piece of the algorithm is the Matriplex library, containing dedicated code to optimally vectorize operations on small matrices. The physics performance of the mkFit algorithm is comparable to the nominal CMS tracking algorithm when reconstructing tracks from simulated proton-proton collisions within the CMS detector. We study the scaling of the algorithm as a function of the parallel resources utilized and find large speedups both from vectorization and multi-threading. mkFit achieves a speedup of a factor of 6 compared to the nominal algorithm when run in a single-threaded application within the CMS software framework.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Optimizing the hit finding algorithm for liquid argon TPC neutrino detectors using parallel architectures

Neutrinos are particles that interact rarely, so identifying them requires large detectors which produce lots of data. Processing this data with the computing power available is becoming even more difficult as the detectors increase in size to reach their physics goals. Liquid argon time projection chamber (LArTPC) neutrino experiments are expected to grow in the next decade to have 100 times more wires than in currently operating experiments, and modernization of LArTPC reconstruction code, including parallelization both at data- and instruction-level, will help to mitigate this challenge. The LArTPC hit finding algorithm is used across multiple experiments through a common software framework. In this paper we discuss a parallel implementation of this algorithm. Using a standalone setup we find speedup factors of two times from vectorization and 30–100 times from multi-threading on Intel architectures. The new version has been incorporated back into the framework so that it can be used by experiments. On a serial execution, the integrated version is about 10 times faster than the previous one and, once parallelization is enabled, more speedups comparable to the standalone program are achieved.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

ALICE upgrades during the LHC Long Shutdown 2

A Large Ion Collider Experiment (ALICE) has been conceived and constructed as a heavy-ion experiment at the LHC. During LHC Runs 1 and 2, it has produced a wide range of physics results using all collision systems available at the LHC. In order to best exploit new physics opportunities opening up with the upgraded LHC and new detector technologies, the experiment has undergone a major upgrade during the LHC Long Shutdown 2 (2019–2022). This comprises the move to continuous readout, the complete overhaul of core detectors, as well as a new online event processing farm with a redesigned online-offline software framework. These improvements will allow to record Pb-Pb collisions at rates up to 50 kHz, while ensuring sensitivity for signals without a triggerable signature.

47 OTHER INSTRUMENTATION↗

Improving ICARUS track reconstruction algorithms

The ICARUS experiment is part of the Short-Baseline Neutrino program at Fermilab. Its primary objective is to explore the possible existence of sterile neutrinos in the O(1 eV) mass range and to clarify the anomalies observed in the Liquid Scintillator Neutrino Detector and MiniBooNE experiments. The ICARUS-T600 detector is a Liquid Argon Time Projection Chamber, capable of producing high-resolution 3D images and precise calorimetric measurements of ionizing particles. This technology allows for a detailed study of neutrino interactions across a broad energy range, from a few keV to several hundred GeV. The track reconstruction is achieved through a software framework that applies a series of pattern recognition algorithms, transforming raw detector signals into fully reconstructed event topologies. This process involves identifying interaction vertices, particle tracks, and electromagnetic showers within the TPC. However, in certain cases, these algorithms may mistakenly break a single particle track into several shorter segments, interpreting each as a distinct particle. Since track length is used to estimate the particle's energy, such fragmentation can result in an energy underestimation of several hundred MeV. Furthermore, when a track is split into multiple segments, the particle identification (which relies on analyzing the energy loss as a function of the residual range) may fail, potentially leading to the loss of the entire event. To mitigate this problem, we have developed a dedicated algorithm designed to identify and reconnect (“stitch”) the tracks that were erroneously divided into multiple segments.

Ricci, Alessandro Maria [Pisa U.; INFN, Pisa] (ORC↗

Active learning emulators for nuclear two-body scattering in momentum space

In this work we extend the active learning emulators for two-body scattering in coordinate space with error estimation, recently developed by Maldonado et al. [Phys. Rev. C 112, 024002], to coupled-channel scattering in momentum space. Our full-order model (FOM) solver is based on the Lippmann-Schwinger integral equation for the scattering t-matrix as opposed to the radial Schrödinger equation. We use (Petrov-)Galerkin projections and high-fidelity calculations at a few snapshots across the parameter space of the interaction to construct efficient reduced-order models (ROMs), trained by a greedy algorithm for locally optimal snapshot selection. Both the FOM solver and the corresponding ROMs are implemented efficiently in Python using Google's JAX library. We present results for emulating scattering phase shifts in coupled and uncoupled channels and cross sections, and assess the accuracy of the developed ROMs and their computational speedup factors. We also develop emulator error estimation for both the t-matrix and the total cross section. The software framework for reproducing and extending our results is publicly available. Together with our recent advances in developing active-learning emulators for three-body scattering, these emulator frameworks set the stage for full Bayesian calibrations of chiral nuclear interactions and optical models against scattering data with quantified emulator errors.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A general Bayesian algorithm for the autonomous alignment of beamlines

Autonomous methods to align beamlines can decrease the amount of time spent on diagnostics, and also uncover better global optima leading to better beam quality. The alignment of these beamlines is a high-dimensional expensive-to-sample optimization problem involving the simultaneous treatment of many optical elements with correlated and nonlinear dynamics. Bayesian optimization is a strategy of efficient global optimization that has proved successful in similar regimes in a wide variety of beamline alignment applications, though it has typically been implemented for particular beamlines and optimization tasks. In this paper, we present a basic formulation of Bayesian inference and Gaussian process models as they relate to multi-objective Bayesian optimization, as well as the practical challenges presented by beamline alignment. We show that the same general implementation of Bayesian optimization with special consideration for beamline alignment can quickly learn the dynamics of particular beamlines in an online fashion through hyperparameter fitting with no prior information. We present the implementation of a concise software framework for beamline alignment and test it on four different optimization problems for experiments on X-ray beamlines at the National Synchrotron Light Source II and the Advanced Light Source, and an electron beam at the Accelerator Test Facility, along with benchmarking on a simulated digital twin. We discuss new applications of the framework, and the potential for a unified approach to beamline alignment at synchrotron facilities.

47 OTHER INSTRUMENTATION↗

Analysis of Building Model Forecasts using Autonomous HVAC Optimization System for Residential Neighborhood

Heating, ventilation, and air conditioning (HVAC) systems account for the highest share of home energy consumption in the United States. Optimized HVAC control can provide thermal improved comfort to the occupants, improve energy efficiency, reduce energy cost, and support grid services. In this paper, we discuss a multi-agent and cloud-based software framework that has been deployed in occupied residential neighborhood. This system enables automatic data collection, learning, optimization, and dispatches signals to neighborhood devices. HVAC optimization is based on model predictive control (MPC). Since the operational performance of MPC depends on model forecasting accuracy, it is crucial to evaluate the model continuously and modify or retrain it as necessary. In this research, we developed an automated workflow to evaluate the performance of temperature and power forecasts based on measured data in the real world. This will provide researchers with a deeper understanding of the model and how it can be improved.

Lebakula, Viswadeep↗

ROAM: A Remotely Operated Accelerator Monitor

Monitoring accelerators in operation is a well known challenge due to the radiation environment. However, there are significant benefits in being able to deploy particular sensors in specific locations of accelerator enclosures for monitoring or troubleshooting purposes. Learning from experience at other labs, we used Commercial Off The Shelf (COTS) components and an open source robot control software framework (ROS) to build a remotely controlled robot platform including a standard suite of instruments such as cameras, LIDAR, and ultrasound, with the ability to incorporate other ad-hoc sensors for specific measurements, such as a Gamma radiation monitor. Special attention was given to the robot's ability to maintain safety in the high risk environment of an accelerator, with multiple failure contingencies in place to ensure collision free operation. Testing was performed to prove the platform's viability and showcase its capability for accelerator monitoring.

Thayer, Thomas C.↗

Deep Generative Models that Solve PDEs: Distributed Computing for Training Large Data-Free Models

Recent progress in scientific machine learning (SciML) has opened up the possibility of training novel neural network architectures that solve complex partial differential equations (PDEs). Several (nearly data free) approaches have been recently reported that successfully solve PDEs, with examples including deep feed forward networks, generative networks, and deep encoder-decoder networks. However, practical adoption of these approaches is limited by the difficulty in training these models, especially to make predictions at large output resolutions (≥1024×1024). Here we report on a software framework for data parallel distributed deep learning that resolves the twin challenges of training these large SciML models - training in reasonable time as well as distributing the storage requirements. Our framework provides several out of the box functionality including (a) loss integrity independent of number of processes, (b) synchronized batch normalization, and (c) distributed higher-order optimization methods. We show excellent scalability of this framework on both cloud as well as HPC clusters, and report on the interplay between bandwidth, network topology and bare metal vs cloud. We deploy this approach to train generative models of sizes hitherto not possible, showing that neural PDE solvers can be viably trained for practical applications. We also demonstrate that distributed higher-order optimization methods are 2-3× faster than stochastic gradient-based methods and provide minimal convergence drift with higher batch-size.

PDEs↗

Bridging Python to Silicon: The SODA Toolchain

Systems performing scientific computing, data analysis, and machine learning tasks have a growing demand for application-specific accelerators that can provide high computational performance while meeting strict size and power requirements. However, the algorithms and applications that need to be accelerated are evolving at a rate that is incompatible with manual design processes based on hardware description languages. Agile hardware design tools based on compiler techniques can help by quickly producing an application-specific integrated circuit (ASIC) accelerator starting from a high-level algorithmic description. Here, we present the software-defined accelerator (SODA) synthesizer, a modular and open-source hardware compiler that provides automated end-to-end synthesis from high-level software frameworks to ASIC implementation, relying on multilevel representations to progressively lower and optimize the input code. Our approach does not require the application developer to write any register-transfer level code, and it is able to reach up to 364 giga floating point operations per second (GFLOPS)/W efficiency (32-bit precision) on typical convolutional neural network operators.

97 MATHEMATICS AND COMPUTING↗

Extending XACC for Quantum Optimal Control

Quantum computing vendors are beginning to open up application programming interfaces for direct pulse-level quantum control. With this, programmers can begin to describe quantum kernels of execution via sequences of arbitrary pulse shapes. This opens new avenues of research and development with regards to smart quantum compilation routines that enable direct translation of higher-level digital assembly representations to these native pulse instructions. In this work, we present an extension to the XACC system-level quantum-classical software framework that directly enables this compilation lowering phase via user-specified quantum optimal control techniques. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences that are optimal with respect to the backend system dynamics. Our work is modular and extensible, enabling third party optimal control techniques and strategies in both C++ and Python. We demonstrate this extension with familiar gradient-based methods like gradient ascent pulse engineering (GRAPE), gradient optimization of analytic controls (GOAT), and Krotov's method. Our work serves as a foundational component of future quantum-classical compiler designs that lower high-level programmatic representations to low-level machine instructions.

Nguyen, Thien↗

Pulsar Based Timing for Grid Synchronization

Existing synchronization systems in the power grid, such as the global positioning system, are susceptible to temporary or permanent failures due to various unpredictable and uncontrollable factors such as cyber-attack and electromagnetic interferences, thus affecting the accuracy and reliability of generated timing signal. In this article, a pulsar astronomy-based timing system is proposed to provide an alternative synchronization signal. Further, this clock will offer significant security improvements to power grid applications, such as a wide-area monitoring system, which depends on a precise timing signal. The hardware and software frameworks are described in detail. First, a high-speed sampling hardware platform is designed to collect signals from radio telescopes. Then a periodic pulse extraction method with three steps is proposed to process the pulsar signal, including polyphase filterbanks, incoherent de-dispersion, and sliding window folding. Lastly, three experiments are conducted to verify the effectiveness of the frameworks. The generated pulsar timing pulse is presented, and the factors affecting its accuracy are also discussed. The analysis results demonstrate that the pulsar signals can provide high-accurate timing pulses for grid synchronization.

24 POWER TRANSMISSION AND DISTRIBUTION↗