Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “COMPUTER ARCHITECTURE”

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 631 records · Page 35

RELAP-7 Development Updates

RELAP-7 is a nuclear systems safety analysis code being developed at the Idaho National Laboratory, and is the next generation tool in the RELAP reactor safety/systems analysis application series. RELAP-7 development began in 2011 to support the Risk Informed Safety Margins Characterization (RISMC) Pathway of the Light Water Reactor Sustainability (LWRS) program. The overall design goal of RELAP-7 is to take advantage of the previous thirty years of advancements in computer architecture, software design, numerical methods, and physical models in order to provide capabilities needed for the RISMC methodology and to support nuclear power safety analysis. The code is being developed based on Idaho National Laboratory’s modern scientific software development framework – MOOSE (the Multi-Physics Object-Oriented Simulation Environment). The initial development goal of the RELAP-7 approach focused primarily on the development of an implicit algorithm capable of strong (nonlinear) coupling of the dependent hydrodynamic variables contained in the 1-D/2-D flow models with the various 0-D system reactor components that compose various boiling water reactor (BWR) and pressurized water reactor nuclear power plants (NPPs). During Fiscal Year (FY) 2015, the RELAP-7 code has been further improved with expanded capability to support boiling water reactor (BWR) and pressurized water reactor NPPs analysis. The accumulator model has been developed. The code has also been coupled with other MOOSE-based applications such as neutronics code RattleSnake and fuel performance code BISON to perform multiphysics analysis. A major design requirement for the implicit algorithm in RELAP-7 is that it is capable of second-order discretization accuracy in both space and time, which eliminates the traditional first-order approximation errors. The second-order temporal is achieved by a second-order backward temporal difference, and the one-dimensional second-order accurate spatial discretization is achieved with the Galerkin approximation of Lagrange finite elements. During FY-2015, we have done numerical verification work to verify that the RELAP-7 code indeed achieves 2nd-order accuracy in both time and space for single phase models at the system level.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

RELAP-7 Pressurizer Component Development Updates

RELAP-7 is a nuclear systems safety analysis code being developed at the Idaho National Laboratory (INL). RELAP-7 development began in 2011 to support the Risk Informed Safety Margins Characterization (RISMC) Pathway of the Light Water Reactor Sustainability (LWRS) program. The overall design goal of RELAP-7 is to take advantage of the previous thirty years of advancements in computer architecture, software design, numerical methods, and physical models in order to provide capabilities needed for the RISMC methodology and to support nuclear power safety analysis. The code is being developed based on Idaho National Laboratory’s modern scientific software development framework – MOOSE (the Multi-Physics Object-Oriented Simulation Environment). The initial development goal of the RELAP-7 approach focused primarily on the development of an implicit algorithm capable of strong (nonlinear) coupling of the dependent hydrodynamic variables contained in the 1-D/2-D flow models with the various 0-D system reactor components that compose various boiling water reactor (BWR) and pressurized water reactor nuclear power plants (NPPs). As part of the efforts to expand the capability for PWR simulation, an equilibrium single-region pressurizer model has been implemented in RELAP-7. The pressurizer component can simulate pressure and water level change through insurge, spray, and heating processes. Two simple tests – one for insurge process and another for outsurge process – have been reported to demonstrate and verify the functions of the pressurizer model. The typical single-phase PWR system model presented in the first RELAP-7 milestone report has been updated, as part of system level test for the new pressurizer model. The updated PWR system model with the pressurizer component can be used for more realistic transient simulations. The addition of the equilibrium single-region pressurizer model represents the first step of developing a suite of pressurizer models with different levels of fidelities. Non-equilibrium two-region two-zone model and non-equilibrium five-region three zone model will be implemented in the near future. Cross comparison and validation will be pursued when higher fidelity pressurizer models are completed.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A Porphyrin Spin Qubit and Its 2D Framework Nanosheets

Abstract Molecular spin qubits have been shown to reach sufficiently long quantum coherence times to envision their use as hardware in quantum processors. These will however require their implementation in hybrid solid‐state devices for which the controlled localization and homogeneous orientation of the molecular qubits will be necessary. An alternative to isolated molecules that can ensure these key aspects is 2D framework in which the qubit would act as node. In this work, it is demonstrated that the isolated metalloporphyrin [Cu(H 4 TCPP)] molecule is a potential spin qubit, and maintains similar quantum coherence as node in a 2D [{CuTCPP}Zn 2 (H 2 O) 2 ] metal–organic framework. Mono‐ and multilayer deposits of nanosheets of a similar 2D framework are then successfully formed following a modular method based on Langmuir–Schaefer conditions. The orientation of the {CuTCPP} qubit nodes in these nanosheets is homogeneous parallel to the substrate. These nanosheets are also formed with a control over the qubit concentration, i.e., by dilution with the unmetallated porphyrin. Eventually, 2D nanosheets are formed in situ directly on a substrate, through a simple protocol devised to reproduce the Langmuir–Schaefer conditions locally. Altogether these studies show that 2D spin qubit frameworks are ideal components to develop a hybrid quantum computing architecture.

Urtizberea, Ainhoa↗

Toward Chirality-Encoded Domain Wall Logic

Nonvolatile logic networks based on spintronic and nanomagnetic technologies have the possibility to create high-speed, ultralow power computational architectures. This work investigates the feasibility of “chirality-encoded domain wall logic,” a nanomagnetic logic architecture where data are encoded by the chiral structures of mobile domain walls in networks of ferromagnetic nanowires and processed by the chiral structures' interactions with geometric features of the networks. High-resolution magnetic imaging is used to test two critical functionalities: the inversion of domain wall chirality at tailored artificial defect sites (logical NOT gates) and the chirality-selective output of domain walls from 2-in-1-out nanowire junctions (common operation to AND/NAND/OR/NOR gates). The measurements demonstrate both operations can be performed to a good degree of fidelity even in the presence of complex magnetization dynamics that would normally be expected to destroy chirality-encoded information. Together, these results represent a strong indication of the feasibility of devices where chiral magnetization textures are used to directly carry, rather than merely delineate, data.

36 MATERIALS SCIENCE↗

Spatiotemporal Thermal Coupling in VO 2 Device Arrays

Correlated oxides such as VO 2 exhibit an electrically driven insulator–metal transition (IMT) that underlies their promise for neuromorphic and memory devices. Yet the IMT is not a uniform bulk process but a spatiotemporal phenomenon in which local heating nucleates filaments, contracts or dissolves them with the electric field, and couples to the environment. In this work, we directly image the VO 2 IMT dynamics by mid-wave infrared, thermography synchronized with electrical transport, resolving device temperature with micrometer spatial and microsecond temporal resolution. At the single-device level, we capture the full cycle of filament nucleation, contraction, and relaxation during current/voltage-driven resistive switching. At the array level, we show that heat propagates across etched gaps with an effective length scale of ∼131 µm, enabling cooperative behaviors among electrically isolated devices. Short-range distanced devices exhibit mutual filament attraction and sequential dissolution, while long-range distanced devices differentiate into distinct roles: drivers that initiate switching, cooperative responders that undergo assisted self-oscillations, and passive reporters that record the thermal field. Furthermore, these results reframe thermal crosstalk, long regarded as parasitic, as an intrinsic coupling channel and design principle for organizing collective switching behaviors, with direct implications for emergent circuit functionality in neuromorphic and unconventional computing architectures.

coupling↗

Dynamic Symmetry Breaking in Chiral Magnetic Systems

The Dzyaloshinskii–Moriya interaction (DMI) in magnetic systems stabilizes spin textures with preferred chirality, applicable to next-generation memory and computing architectures. In perpendicularly magnetized heavy-metal/ferromagnet films, the interfacial DMI originating from structural inversion asymmetry and strong spin-orbit coupling favors chiral Néel-type domain walls (DWs) whose energetics and mobility remain at issue. Thus, a new effect is characterized in which domains expand unidirectionally in response to a combination of out-of-plane and in-plane magnetic fields, with the growth direction controlled by the in-plane field strength. These growth directionalities and symmetries with applied fields cannot be understood from static treatments alone. The authors theoretically demonstrate that perpendicular field torques stabilize steady-state magnetization profiles highly asymmetric in elastic energy, resulting in a dynamic symmetry breaking consistent with the experimental findings. This phenomenon sheds light on the mechanisms governing the dynamics of Néel-type DWs and expands the utility of field-driven DW motion to probe and control chiral DWs.

36 MATERIALS SCIENCE↗

Stochastic density functional theory

Linear-scaling implementations of density functional theory (DFT) reach their intended efficiency regime only when applied to systems having a physical size larger than the range of their Kohn–Sham density matrix (DM). This causes a problem since many types of large systems of interest have a rather broad DM range and are therefore not amenable to analysis using DFT methods. For this reason, the recently proposed stochastic DFT (sDFT), avoiding exhaustive DM evaluations, is emerging as an attractive alternative linear-scaling approach. This review develops a general formulation of sDFT in terms of a (non)orthogonal basis representation and offers an analysis of the statistical errors (SEs) involved in the calculation. Using a new Gaussian-type basis-set implementation of sDFT, applied to water clusters and silicon nanocrystals, it demonstrates and explains how the standard deviation and the bias depend on the sampling rate and the system size in various types of calculations. We also develop a basis-set embedded-fragments theory, demonstrating its utility for reducing the SEs for energy, density of states and nuclear force calculations. Finally, we discuss the algorithmic complexity of sDFT, showing it has CPU wall-time linear-scaling. Lastly, the method parallelizes well over distributed processors with good scalability and therefore may find use in the upcoming exascale computing architectures.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Performance Tuning of Fock Matrix and Two-Electron Integral Calculations for NWChem on Leading HPC Platforms

Attaining performance in the evaluation of two-electron repulsion integrals and constructing the Fock matrix is of considerable importance to the computational chemistry community. Due to its numerical complexity improving the performance behavior across a variety of leading supercomputing platforms is an increasing challenge due to the significant diversity in high-performance computing architectures. In this paper, we present our successful tuning methodology for these important numerical methods on the Cray XE6, the Cray XC30, the IBM BG/Q, as well as the Intel Xeon Phi. Our optimization schemes leverage key architectural features including vectorization and simultaneous multithreading, and results in speedups of up to 2.5x compared with the original implementation.

Shan, Hongzhan↗

On the Design, Development, and Analysis of Optimized Matrix-Vector Multiplication Routines for Coprocessors

The manycore paradigm shift, and the resulting change in modern computer architectures, has made the development of optimal numerical routines extremely challenging. In this work, we target the development of numerical algorithms and implementations for Xeon Phi coprocessor architecture designs. In particular, we examine and optimize the general and symmetric matrix-vector multiplication routines (gemv/symv), which are some of the most heavily used linear algebra kernels in many important engineering and physics applications. We describe a successful approach on how to address the challenges for this problem, starting with our algorithm design, performance analysis and programing model and moving to kernel optimization. Our goal, by targeting low-level and easy to understand fundamental kernels, is to develop new optimization strategies that can be effective elsewhere for use on manycore coprocessors, and to show significant performance improvements compared to existing state-of-the-art implementations. Therefore, in addition to the new optimization strategies, analysis, and optimal performance results, we finally present the significance of using these routines/strategies to accelerate higher-level numerical algorithms for the eigenvalue problem (EVP) and the singular value decomposition (SVD) that by themselves are foundational for many important applications.

Kabir, Khairul↗

An inertia-free filter line-search algorithm for large-scale nonlinear programming

We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.

Chiang, Nai-Yuan↗

Dislocation-Limited Thermal Conductivity in LiF: Revisiting Perturbative Models

We revisit models to describe phonon-dislocation interactions and resulting dislocation-limited thermal conductivity (k), particularly as applied to describe the temperature-dependent k behavior of LiF with significant dislocation densities. Coupling semiempirical models of phonon scattering from dislocation strain fields provided by Klemens and Carruthers with density functional theory description of the phonons and input parameters, we find that both models significantly overpredict the measured k of LiF, as found previously. However, more direct application of the quantum perturbation theory description, from which the models were derived, gives significantly stronger phonon-dislocation scattering and strongly underpredicts the measured k data. We revisit the derivation of phonon-dislocation-strain field scattering and provide numerical details regarding its implementation. This work demonstrates that quantum perturbative calculations, now accessible to modern computational architectures, may provide a reasonable description of dislocation-limited k in materials as governed by phonon-strain field interactions provided that questions regarding the relevant strain field range can be resolved.

36 MATERIALS SCIENCE↗

PASTA: A Parallel Sparse Tensor Algorithm Benchmark Suite

Tensor methods have gained increasingly attention from various applications, including machine learning, quantum chemistry, healthcare analytics, social network analysis, data mining, and signal processing, to name a few. Sparse tensors and their algorithms become critical to further improve the performance of these methods and enhance the interpretability of their output. This work presents a sparse tensor algorithm benchmark suite (PASTA) for single- and multi-core CPUs. To the best of our knowledge, this is the first benchmark suite for sparse tensor world. PASTA targets on: 1) helping application users to evaluate different computer systems using its representative computational workloads; 2) providing insights to better utilize existed computer architecture and systems and inspiration for the future design. This benchmark suite will be publicly released.

HPC, sparse tensor, benchmark↗

The OpenMC Monte Carlo particle transport code

A new Monte Carlo code called OpenMC is currently under development at the Massachusetts Institute of Technology as a tool for simulation on high-performance computing platforms. Given that many legacy codes do not scale well on existing and future parallel computer architectures, OpenMC has been developed from scratch with a focus on high performance scalable algorithms as well as modern software design practices. The present work describes the methods used in the OpenMC code and demonstrates the performance and accuracy of the code on a variety of problems.

Nuclear Science & Technology↗

Direct NeTS sampling of nuclear graphite $S(α, β, T)$ in Serpent

For advanced reactor applications, Neural Thermal Scattering (NeTS) modules were developed to predict the thermal scattering law (TSL or $S(α, β, T)$) of a nuclear graphite neutron moderator. NeTS are multi-layer, feedforward artificial neural networks, which act as universal function approximators designed for TSL datasets. In this case, a 4-layer neural network with 164 neurons per layer is trained using FLASSH evaluated data in PyTorch and serialized as a torchscript dictionary to predict $S(α, β, T)$ on-the-fly. Relative, absolute and maximum percent deviations of NeTS from File 7 data generated using the FLASSH code are on the order of 0.01%, 0.1% and 1%, respectively, with low inference latencies of 0.000172 s per $S(α, β, T)$ at a given temperature. Capturing the full dimensionality of possible inelastic neutron-lattice interactions, NeTS functionality is embedded in the Serpent Monte Carlo code, where $S(α, β, T)_{NeTS}$ sampling is conducted on-the-fly and compared to ACE look-up-tables for predicting TREAT criticality. k-eff differences between sampling algorithms of 6 pcm are observed and are within the order of Monte Carlo uncertainty. Compared to discrete and continuous-energy ACE files (30 MB and 131 MB per temperature), the NeTS format is on the order of 200–300 kB for a continuous-temperature, interpolation-free representation of $S(α, β, T)$ and cross sections. NeTS-in-Serpent runtimes comparable with ACE look-up tables are achieved by scaling NeTS for high performance computing architectures with hybrid OpenMP + MPI parallelization. This work validates a novel, self-contained reactor physics framework for predictive cross sections, and demonstrates a general methodology for embedding modern machine learning libraries within existing neutronic analysis frameworks.

Nuclear Criticality Safety Program (NCSP)↗

GMRES with embedded ensemble propagation for the efficient solution of parametric linear systems in uncertainty quantification of computational models

In a previous work, embedded ensemble propagation was proposed to improve the efficiency of sampling-based uncertainty quantification methods of computational models on emerging computational architectures. It consists of simultaneously evaluating the model for a subset of samples together, instead of evaluating them individually. A first approach introduced to solve parametric linear systems with ensemble propagation is ensemble reduction. In Krylov methods for example, this reduction consists in coupling the samples together using an inner product that sums the sample contributions. Ensemble reduction has the advantages of being able to use optimized implementations of BLAS functions and having a stopping criterion which involves only one scalar. However, the reduction potentially decreases the rate of convergence due to the gathering of the spectra of the samples. In this paper, we investigate a second approach: ensemble propagation without ensemble reduction in the case of GMRES. This second approach solves each sample simultaneously but independently to improve the convergence compared to ensemble reduction. This raises two new issues which are solved in this paper: the fact that optimized implementations of BLAS functions cannot be used anymore and that ensemble divergence, whereby individual samples within an ensemble must follow different code execution paths, can occur. We tackle those issues by implementing a high-performing ensemble GEMV and by using masks. The proposed ensemble GEMV leads to a similar cost per GMRES iteration for both approaches, i.e. with and without reduction. For illustration, we study the performances of the new linear solver in the context of a mesh tying problem. Furthermore, this example demonstrates improved ensemble propagation speed-up without reduction.

BLAS↗

A scalable exponential-DG approach for nonlinear conservation laws: With application to Burger and Euler equations

In this work, we propose an Exponential DG framework for partial differential equations. We decompose 7 governing equations into linear and nonlinear parts to which we apply the discontinuous Galerkin 8 (DG) spatial discretization. In particular, we construct the linear part using Jacobian that effectively 9 capture stiff characteristics in the system. The former is integrated analytically, whereas the latter 10 is approximated. This approach i) is stable with a large Courant number (Cr > 1); ii) supports 11 high-order solutions both in time and space; iii) is computationally favorable compared to IMEX 12 DG methods with no preconditioner; iv) becomes comparable to explicit RKDG methods on uniform 13 mesh and beneficial on non-uniform grid for Euler equations; v) is scalable in a modern massively 14 parallel computing architecture due to its explicit nature of exponential time integrators and com15 pact communication stencil of DG method. Numerical results demonstrate the performance of our 16 proposed methods through various examples. We also discuss the stability and convergence analysis 17 for our exponential DG scheme in the context of Burgers equation.

42 ENGINEERING↗

Acceleration of the Particle Swarm Optimization for Peierls–Nabarro modeling of dislocations in conventional and high-entropy alloys

Dislocations are among the most important defects in determining the mechanical properties of both conventional alloys and high-entropy alloys. The Peierls-Nabarro model supplies an efficient pathway to their geometries and mobility. The difficulty in solving the integro-differential Peierls-Nabarro equation is how to effectively avoid the local minima in the energy landscape of a dislocation core. Among the other methods to optimize the dislocation core structures, we choose the algorithm of Particle Swarm Optimization, an algorithm that simulates the social behaviors of organisms. By employing more particles (bigger swarm) and more iterative steps (allowing them to explore for longer time), the local minima can be effectively avoided. But this would require more computational cost. The advantage of this algorithm is that it is readily parallelized in modern high computing architecture. We demonstrate the performance of our parallelized algorithm scales linearly with the number of employed cores.

36 MATERIALS SCIENCE↗

The MINER$\nu$A Data Acquisition System and Infrastructure

MINERvA (Main INjector ExpeRiment v-A) is a new few-GeV neutrino cross-section experiment that began taking data in the FNAL NuMI (Fermi National Accelerator Laboratory Neutrinos at the Main Injector) beam-line in March of 2010. MINERvA employs a fine-grained scintillator detector capable of complete kinematic characterization of neutrino interactions. This paper describes the MINERvA data acquisition system (DAQ) including the readout electronics, software, and computing architecture.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗