Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Build System”

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 541 records · Page 30

The ATLAS experiment software on ARM

With an increased dataset obtained during the Run 3 of the LHC at CERN and the even larger expected increase of the dataset by more than one order of magnitude for the HL-LHC, the ATLAS experiment is reaching the limits of the current data processing model in terms of traditional CPU resources based on x86_64 architectures and an extensive program for software upgrades towards the HL-LHC has been set up. The ARM architecture is becoming a competitive and energy efficient alternative. Some surveys indicate its increased presence in HPCs and commercial clouds, and some WLCG sites have expressed their interest. Chip makers are also developing their next generation solutions on ARM architectures, sometimes combining ARM and GPU processors in the same chip. Consequently it is important that the ATLAS software embraces the change and is able to successfully exploit this architecture. We report on the successful porting to ARM of the Athena software framework, which is used by ATLAS for both online and offline computing operations. Furthermore we report on the successful validation of simulation workflows running on ARM resources. For this we have set up an ATLAS Grid site using ARM compatible middleware and containers on Amazon Web Services (AWS) ARM resources. The ARM version of Athena is fully integrated in the regular software build system and distributed in the same way as other software releases. In addition, the workflows have been integrated into the HEPscore benchmark suite which is the planned WLCG wide replacement of the HepSpec06 benchmark used for Grid site pledges. In the overall porting process we have used resources on AWS, Google Cloud Platform (GCP) and CERN. A performance comparison of different architectures and resources will be discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Staircases of passive and active scalar concentration in cellular flow

This paper develops a unified model for staircase formation in both passive and active scalar systems, building upon prior numerical studies by offering new heuristic and physical insights. While prior studies primarily reported numerical results, they did not explore the underlying unifying physics that governs both types of scalar transport; this work addresses that gap by identifying shared mechanisms across both cases. Results of studies of passive and active scalar staircase formation in cellular flows are presented. Staircase formation in cellular flows occurs due to the interplay of fast mixing within cells and slow transport across the inter-cell boundary. The cell boundary emerges as a de facto transport barrier. Special attention is focused on the effects of cellular fluctuations and noise upon staircase structure. A forced, fluctuating vortex array model is used to drive the underlying flow structure. Cellular Peclet number and staircase profile curvature are identified as figures-of-merit to quantify the resiliency of layering. These are related to simple, multi-scatterer scalar random walk models. Results for Peclet number and curvature scaling with flow excitation are presented. We also study staircases of magnetic potential evolving in two-dimensional magnetohydrodynamics as examples of layering of active scalar concentration. Formation of magnetic potential staircases is indeed observed. Flux expulsion inhibits the intercellular transport of magnetic potential and strengthens staircase barriers. Magnetic staircases can be supported against resistive decay by magnetic potential noise forcing. Implications for staircase formation in magnetic confinement experiments are discussed.

Control theory↗

A DETERMINATION OF THE SPIN OF THE BLACK HOLE PRIMARY IN LMC X-1

The first extragalactic X-ray binary, LMC X-1, was discovered in 1969. In the 1980s, its compact primary was established as the fourth dynamical black hole candidate. Recently, we published accurate values for the mass of the black hole and the orbital inclination angle of the binary system. Building on these results, we have analyzed 53 X-ray spectra obtained by RXTE and, using a selected sample of 18 of these spectra, we have determined the dimensionless spin parameter of the black hole to be a{sub *} = 0.92{sup +0.05}{sub -0.07}. This result takes into account all sources of observational and model-parameter uncertainties. The standard deviation around the mean value of a{sub *} for these 18 X-ray spectra, which were obtained over a span of several years, is only {delta}a{sub *} = 0.02. When we consider our complete sample of 53 RXTE spectra, we find a somewhat higher value of the spin parameter and a larger standard deviation. Finally, we show that our results based on RXTE data are confirmed by our analyses of selected X-ray spectra obtained by the XMM-Newton, BeppoSAX, and Ginga missions.

79 ASTRONOMY AND ASTROPHYSICS↗

PATHWAYS OF LARGE-SCALE MAGNETIC COUPLINGS BETWEEN SOLAR CORONAL EVENTS

The high-cadence, comprehensive view of the solar corona by SDO/AIA shows many events that are widely separated in space while occurring close together in time. In some cases, sets of coronal events are evidently causally related, while in many other instances indirect evidence can be found. We present case studies to highlight a variety of coupling processes involved in coronal events. We find that physical linkages between events do occur, but concur with earlier studies that these couplings appear to be crucial to understanding the initiation of major eruptive or explosive phenomena relatively infrequently. We note that the post-eruption reconfiguration timescale of the large-scale corona, estimated from the extreme-ultraviolet afterglow, is on average longer than the mean time between coronal mass ejections (CMEs), so that many CMEs originate from a corona that is still adjusting from a previous event. We argue that the coronal field is intrinsically global: current systems build up over days to months, the relaxation after eruptions continues over many hours, and evolving connections easily span much of a hemisphere. This needs to be reflected in our modeling of the connections from the solar surface into the heliosphere to properly model the solar wind, its perturbations, and the generation and propagation of solar energetic particles. However, the large-scale field cannot be constructed reliably by currently available observational resources. We assess the potential of high-quality observations from beyond Earth's perspective and advanced global modeling to understand the couplings between coronal events in the context of CMEs and solar energetic particle events.

79 ASTRONOMY AND ASTROPHYSICS↗

Breaking the silos: The art documentation suite

The art event-processing framework is used by almost all new experiments at Fermilab, and by several outside of Fermilab. All use art as an external product in the same sense that the compiler, ROOT, Geant4, CLHEP and boost are external products. The art team has embarked on a campaign to document art and develop training materials for new users. Many new users of art have little or no knowledge of C++, software engineering, build systems or the many external packages used by art or their experiments, such as ROOT, CLHEP, HEPPDT, and boost. To effectively teach art requires that the training materials include appropriate introductions to these topics as they are encountered. Experience has shown that simply referring readers to the existing native documentation does not work, too often a simple idea that they need to understand is described in a context that presumes prerequisites that are unimportant for a beginning user of art. There is the additional complication that the training materials must be presented in a way that does not presume knowledge of any of the experiments using art. Finally, new users of art arrive at random times throughout the year and the training materials must allow them to start to learn art at any time. This presentation will explain the strategies adopted by the art team to develop a documentation suite that complies with these boundary conditions. It will also show the present status of the documentation suite, including feedback the art team has received from pilot users.

97 MATHEMATICS AND COMPUTING↗

MAGNETIC CYCLES IN GLOBAL LARGE-EDDY SIMULATIONS OF SOLAR CONVECTION

We report on a global magnetohydrodynamical simulation of the solar convection zone, which succeeds in generating a large-scale axisymmetric magnetic component, antisymmetric about the equatorial plane and undergoing regular polarity reversals on decadal timescales. We focus on a specific simulation run covering 255 years, during which 8 polarity reversals are observed, with a mean period of 30 years. Time-latitude slices of the zonally averaged toroidal magnetic component at the base of the convecting envelope show a well-organized toroidal flux system building up in each solar hemisphere, peaking at mid-latitudes and migrating toward the equator in the course of each cycle, in remarkable agreement with inferences based on the sunspot butterfly diagram. The simulation also produces a large-scale dipole moment, varying in phase with the internal toroidal component, suggesting that the simulation may be operating as what is known in mean-field theory as an {alpha}{Omega} dynamo.

79 ASTRONOMY AND ASTROPHYSICS↗

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗

A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers

Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power.In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation.The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.

97 MATHEMATICS AND COMPUTING↗

Open-Source Architecture for Multi-Party Update Verification for Data Acquisition Devices

Power grids are integral parts of modern daily life and are increasingly under cyberattack. Common software update processes for grid control devices rely on only one organization to provide verification. This paper roposes a multi-signature software update process to help better secure data acquisition devices from malicious actions by using standard cryptosystems such as TLS. A prototype system build on Linux and off-the-shelf hardware has shown successful update and attack prevention with our customized multi-party update software.

Newberg, Benjamin↗

Materials challenges and opportunities for quantum computing hardware

Combatting noise on the platform The potential of quantum computers to solve problems that are intractable for classical computers has driven advances in hardware fabrication. In practice, the main challenge in realizing quantum computers is that general, many-particle quantum states are highly sensitive to noise, which inevitably causes errors in quantum algorithms. Some noise sources are inherent to the current materials platforms. de Leon et al. review some of the materials challenges for five platforms for quantum computers and propose directions for their solution. Science , this issue p. eabb2823

Science & Technology - Other Topics↗

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗

Newly Released Capabilities in the Distributed-Memory SuperLU Sparse Direct Solver

We present the new features available in the recent release of SuperLU_DIST, Version 8.1.1. SuperLU_DIST is a distributed-memory parallel sparse direct solver. The new features include (1) a 3D communication-avoiding algorithm framework that trades off inter-process communication for selective memory duplication, (2) multi-GPU support for both NVIDIA GPUs and AMD GPUs, and (3) mixed-precision routines that perform single-precision LU factorization and double-precision iterative refinement. Apart from the algorithm improvements, we also modernized the software build system to use CMake and Spack package installation tools to simplify the installation procedure. Throughout the article, we describe in detail the pertinent performance-sensitive parameters associated with each new algorithmic feature, show how they are exposed to the users, and give general guidance of how to set these parameters. We illustrate that the solver’s performance both in time and memory can be greatly improved after systematic tuning of the parameters, depending on the input sparse matrix and underlying hardware.

97 MATHEMATICS AND COMPUTING↗

Kip, Version 1.0

This high-performance ray tracing library provides very fast rendering, compact code, type flexibility via C++ 'generic programming' techniques, and ease of use through an application programming interface (API) that functions independently of any GUI, on-screen display, or other enclosing application. Kip supports constructive solid geometry models based on any of several built-in shapes and operators and allows for new, user-defined shapes and operators. Additional features include basic texturing, input/output of models using a simple human-readable file format with full error checking and detailed diagnostics, and support for shared data parallelism. Kip is written in pure, ANSI Standard C++, is entirely platform independent, and is very easy to use, as it requires no build system, configuration or installation scripts, wizards, special preprocessing, makefiles, or external libraries.

Staley, Martin↗

Global-Address Space Networking for Exascale

GASNet-EX is a portable, open-source, high-performance communication library designed to efficiently support the networking requirements of Partitioned Global Address Space (PGAS) runtime systems and other alternative models in future exascale machines. The library is an evolution of the popular GASNet communication system, building upon over 15 years of lessons learned. GASNet is a language-independent, networking middleware layer that provides network-independent, high-performance communication primitives including Remote Memory Access (RMA) and Active Messages (AM). It has been used to implement parallel programming models and libraries such as UPC, Co-Array Fortran, Titanium, Legion, Chapel, and many others. The interface is primarily intended as a compilation target and for use by runtime library writers (as opposed to end users), and the primary goals are high performance, interface portability, and expressiveness. GASNet stands for "Global-Address Space Networking".

ECP↗

guideline36_conformance_test 0.1

The American Society of Heating, Refrigerating and Air-Conditioning Engineers (ASHRAE) has established a set of standardized high performance sequences of operation for Heating, Ventilation and Air Conditioning (HVAC) systems in buildings through their "Guideline 36". In order to achieve the intended performance, these sequences must be translated and programmed accurately in the Building Automation System (BAS) controllers. Standardizing these sequences will allow for a more efficient product delivery mechanism where the sequences are programmed and tested centrally by each manufacturer, and then distributed to their dealers/engineering contractors. This approach would minimize the need for each installer to re-interpret and program the sequences, reduces risk of errors, and reduces the time required for commissioning in the field. To achieve this goal, a performance validation method is needed to provide independent confirmation that each manufacturer has programmed the Guideline 36 sequences accurately. A standardized method of test would also avoid the need for manual interpretation (and the associated human variability) that is required with typical functional testing approaches by automating the inputs and the range of expected responses. This software "guideline36_conformance_test" has been developed to conduct standardized, repeatable and manufacturer independent tests to validate that a BAS controller has been programmed in conformance with Guideline 36. Manufacturers would provide the controller (or the control program) and the software would run a suite of tests by setting a set of inputs to the controller and verifying the output signals from the controller matches the expected output as set by Guideline 36.

Pritoni, Marco↗

OpenStudio-Variability-Gem v1.0

This gem contains methods to introduce variability to extend core OpenStudio SDK. The term "variability" refers to changes in building systems efficiency, operation, or controls, which are non-routine events.

Li, Han↗

SalineMoose

SalineMoose is a MOOSE wrapper for the open-source Saline code, which is an interface for fluid property databsae files. This code is meant to provide access to Saline, which can easily be integrated into MOOSE-based codes that need access to the fluid thermophysical properties that Saline can provide. Wrapping Saline in SalineMoose allows MOOSE codes to use the native MOOSE build system for linking Saline to their MOOSE application.

Salko, Robert↗