Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Accelerators, Computing”

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 145 records · Page 8

Training a Neural Network on Analog TaO x ReRAM Devices Irradiated With Heavy Ions: Effects on Classification Accuracy Demonstrated With CrossSim

The image classification accuracy of a TaO x ReRAM-based neuromorphic computing accelerator is evaluated after intentionally inducing a displacement damage up to a fluence of 10 14 2.5-MeV Si ions/cm 2 on the analog devices that are used to store weights. Results are consistent with a radiation-induced oxygen vacancy production mechanism. When the device is in the high-resistance state during heavy ion radiation, the device resistance, linearity, and accuracy after training are only affected by high fluence levels. Here, the findings in this paper are in accordance with the results of previous studies on TaO x -based digital resistive random access memory. When the device is in the low-resistance state during irradiation, no resistance change was detected, but devices with a 4-kΩ inline resistor did show a reduction in accuracy after training at 10 14 2.5-MeV Si ions/cm 2 . This indicates that changes in resistance can only be somewhat correlated with changes to devices’ analog properties. This paper demonstrates that TaO x devices are radiation tolerant not only for high radiation environment digital memory applications but also when operated in an analog mode suitable for neuromorphic computation and training on new data sets.

42 ENGINEERING↗

Evaluating Performance Portability with the CMS Heterogeneous Pixel Reconstruction code

In the past years the landscape of tools for expressing parallel algorithms in a portable way across various compute accelerators has continued to evolve significantly. There are many technologies on the market that provide portability between CPU, GPUs from several vendors, and in some cases even FPGAs. These technologies include C++ libraries such as Alpaka and Kokkos, compiler directives such as OpenMP, the SYCL open specification that can be implemented as a library or in a compiler, and standard C++ where the compiler is solely responsible for the offloading. Given this developing landscape, users have to choose the technology that best fits their applications and constraints. For example, in the CMS experiment the experience so far in heterogeneous reconstruction algorithms suggests that the full application contains a large number of relatively short computational kernels and memory transfer operations. In this work we use a stand-alone version of the CMS heterogeneous pixel reconstruction code as a realistic use case of HEP reconstruction software that is capable of leveraging GPUs effectively. We summarize the experience of porting this code base from CUDA to Alpaka, Kokkos, SYCL, std::par, and OpenMP offloading. We compare the event processing throughput achieved by each version on NVIDIA and AMD GPUs as well as on a CPU, and compare those to what a native version of the code achieves on each platform.

Andriotis, Nikolaos↗

High Performance Computing Based Parallel HIearchical Modal Association Clustering (HPAR HMAC)

For many applications, clustering is a crucial step in order to gain insight into the makeup of a dataset. The best approach to a given problem often depends on a variety of factors, such as the size of the dataset, time restrictions, and soft clustering requirements. The HMAC algorithm seeks to combine the strengths of 2 particular clustering approaches: model-based and linkage-based clustering. One particular weakness of HMAC is its computational complexity. HMAC is not practical for mega-scale data clustering. For high-definition imagery, a user would have to wait months or years for a result; for a 16-megapixel image, the estimated runtime skyrockets to over a decade! To improve the execution time of HMAC, it is reasonable to consider an multi-core implementation that utilizes available system resources. An existing imple-mentation (Ray and Cheng 2014) divides the dataset into N partitions - one for each thread prior to executing the HMAC algorithm. This implementation benefits from 2 types of optimization: parallelization and divide-and-conquer. By running each partition in parallel, the program is able to accelerate computation by utilizing more system resources. Although the parallel implementation provides considerable improvement over the serial HMAC, it still suffers from poor computational complexity, O(N2). Once the maximum number of cores on a system is exhausted, the program exhibits slower behavior. We now consider a modification to HMAC that involves a recursive partitioning scheme. Our modification aims to exploit divide-and-conquer benefits seen by the parallel HMAC implementation. At each level in the recursion tree, partitions are divided into 2 sub-partitions until a threshold size is reached. When the partition can no longer be divided without falling below threshold size, the base HMAC algorithm is applied. This results in a significant speedup over the parallel HMAC.

Patlolla, Dilip R↗

Roadrunner Supercomputer Breaks the Petaflop Barrier

At 3:30 a.m. on May 26, 2008, Memorial Day, the "Roadrunner" supercomputer exceeded a sustained speed of 1 petaflop/s, or 1 million billion calculations per second. The sustained performance makes Roadrunner more than twice as fast as the current number 1 system on the TOP500 list. The best sustained performance to date is 74.5% efficiency, 1.026 petaflop/s. "Petaflop/s" is computer jargon—peta signifying the number 1 followed by 15 zeros (sometimes called a quadrillion) and flop/s meaning "double-precision floating point operations per second." Los Alamos held the fastest supercomputer title in 1993 with the Thinking Machines CM-5, and inaugurated the supercomputer era, assisting in the development of the Cray-1 in 1976. The Laboratory and IBM go all the way back to the first card-programmable calculators, used at Los Alamos in 1949. Los Alamos also housed serial number 1 of the IBM 704 in 1956. The Roadrunner supercomputer, developed by IBM in partnership with the Laboratory and the National Nuclear Security Administration, uses commercially available hardware, including aspects of commercial game console and graphics technologies. Because of its off-the-shelf components, the computer costs significantly less than a one-of-a-kind machine. It also uses a Linux operating system. The secret to its record-breaking performance is a unique hybrid design. Each compute node in this cluster consists of two AMD OpteronTM dual-core processors plus four PowerXCell 8iTM processors used as computational accelerators. The accelerators used in Roadrunner are a special IBM-developed variant of the Cell processor used in the Sony PlayStation® 3. The node-attached Cell accelerators are what make Roadrunner different than typical clusters. The Lab and IBM have been working on Roadrunner since 2006, but collaboration on Cell dates back to 2002. The first phase of the project included delivery of an initial Opteron-only cluster that operates at a speed of 71 teraflop/s. This initial system has been in full production at Los Alamos for almost a year, and Laboratory researchers are using this machine for classified weapons applications. The full-scale Roadrunner machine operates more than 10 times faster than the current installed system. Phase 2 of the Roadrunner project was completed in October 2007. Two external assessments, one by NNSA headquarters and one by an independent team of high performance computing experts, evaluated the machine's potential use for Laboratory applications, the Laboratory's ability to successfully manage the computing system, IBM's ability to deliver the product, and whether computer programs could be adapted to the new system. Based on the positive outcome of the assessments, the Laboratory and NNSA decided to pursue the final phase of the Roadrunner project. The powerful cluster of nodes will process information enabling the Laboratory to use Roadrunner for advanced physics and predictive simulations of complex scientific processes. Weapons science applications that can be processed by Roadrunner are applicable to all three of the U.S. Department of Energy weapons laboratories. The machine will also be well equipped to tackle the intricacies of modeling processes, ranging from the biomolecular to the cosmological. In addition, Los Alamos intends to purchase additional Roadrunner resources to support open science and technology applications. The full-scale Roadrunner system, named in honor of New Mexico's speedy state bird, broke the performance record at IBM's Poughkeepsie, New York, facility. The full machine will be moved to Los Alamos beginning in July and housed in the Nicholas Metropolis Center for Modeling and Simulation. The first computing applications are expected to begin running on the machine in January 2009. The cost of all phases of the Roadrunner project is approximately $120 million. More than 200 Laboratory employees have been involved in this effort. For more information about Roadrunner at Los Alamos National Laboratory, see the Roadrunner website at http://www.lanl.gov/roadrunner.

CELL BASED PROCESSOR↗

Analog optical computing primitives in silicon photonics

Optical computing accelerators help alleviate bandwidth and power consumption bottlenecks in electronics. In this paper, we show an approach to implementing logarithmic-type analog co-processors in silicon photonics and use it to perform the exponentiation operation and the recovery of a signal in the presence of multiplicative distortion. Finally, the function is realized by exploiting nonlinear-absorption-enhanced Raman amplification saturation in a silicon waveguide.

42 ENGINEERING↗

Deep learning for computational chemistry

The rise and fall of artificial neural networks is well documented in the scientific literature of both the fields of computer science and computational chemistry. Yet almost two decades later, we are now seeing a resurgence of interest in deep learning, a machine learning algorithm based on “deep” neural networks. Within the last few years, we have seen the transformative impact of deep learning the computer science domain, notably in speech recognition and computer vision, to the extent that the majority of practitioners in those field are now regularly eschewing prior established models in favor of deep learning models. In this review, we provide an introductory overview into the theory of deep neural networks and their unique properties as compared to traditional machine learning algorithms used in cheminformatics. By providing an overview of the variety of emerging applications of deep neural networks, we highlight its ubiquity and broad applicability to a wide range of challenges in the field, including QSAR, virtual screening, protein structure modeling, QM calculations, materials synthesis and property prediction. In reviewing the performance of deep neural networks, we observed a consistent outperformance against non neural networks state-of-the-art models across disparate research topics, and deep neural network based models often exceeded the “glass ceiling” expectations of their respective tasks. Coupled with the maturity of GPU-accelerated computing for training deep neural networks and the exponential growth of chemical data on which to train these networks on, we anticipate that deep learning algorithms will be a useful tool and may grow into a pivotal role for various challenges in the computational chemistry field.

Computational Chemistry↗

Accelerating GNNs on GPU Sparse Tensor Cores through N:M Sparsity-Oriented Graph Reordering

Recent advancements in GPU hardware support have introduced the capability to leverage N:M sparse patterns for substantial performance gains. Graphs in Graph Neural Networks (GNNs) are typically sparse, but the sparsity is often irregular, not conforming to such sparse patterns. In this paper, we propose a novel graph reordering algorithm, the first of its kind, to reshape irregular graph data into the N:M structured sparse pattern at the tile level, allowing linear-algebra-based graph operations in GNNs to benefit from the N:M sparse hardware. The optimization is lossless, maintaining the accuracy of GNN. It can remove 98-100\% violations of the N:M sparse patterns at the vector level, and increase the proportion of conforming graphs in SuiteSparse collection from 5-9\% to 88.7-93.5\%. On A100 GPUs, the optimization accelerates Sparse Matrix Matrix (SpMM) by up to 43X (2.3X -- 7.5X on average) and speeds up the key graph operations in GNNs on real graphs by as much as 8.6X (3.5X on average).

artificial intelligence, graph neural networks↗

The Kokkos Ecosystem [Brief]

In 2016/2017, the field of High-Performance Computing (HPC) entered a new era driven by fundamental physics challenges to produce ever more energy and cost-efficient processors. Since the convergence on the Message-Passing Interface (MPI) standard in the mid-1990s, application developers enjoyed a seemingly static view of the underlying machine — that of a distributed collection of homogeneous nodes executing in collaboration. However, after almost two decades of dominance, the sole use of MPI to derive parallelism acted as a limiter to improved future performance. While MPI is widely expected to continue to function as the basic mechanism for communication between compute nodes for the immediate future, additional parallelism is required on the computing node itself if high performance and efficiency goals are to be realized. When reviewing the architectures of the top HPC systems today, the change in paradigm is clear: the compute nodes of the leading machines in the world are either powered by many-core chips with a few dozen cores each, or use heterogeneous designs, where traditional CPUs marshal work to massively parallel compute accelerators which has as many as 200,000 processing threads in flight simultaneously. Complicating matters further for application developers, each processor vendor has its own preferred way of writing code for their architecture.The Kokkos EcoSystem was released by Sandia in 2017 to address this new era in HPC system design by providing a vendor independent performance portable programming system for scientific, engineering, and mathematical software applications written in the C++ programming language. Using Kokkos, application developers can be more productive because they will not have to create and maintain separate versions of their software for each architecture, nor will they have to be experts in each architecture's peculiar requirements. Instead, they will have a single method of programming for the diverse set of modern HPC architectures. While Kokkos started in 2011 as a programming model only, it soon became clear that complex applications needed more. It is also critical to have a portable mathematical functions and developers need tools to debug their applications, gain insight into the performance characteristics of their codes and tune algorithm performance parameters through automated processes. The Kokkos EcoSystem addresses those needs through its three main components: the Kokkos Core programming model, the Kokkos Kernels math library, and the Kokkos Tools project.

97 MATHEMATICS AND COMPUTING↗

kynema-fmb [SWR-23-07]

Kynema-FMB (FKA: Kynema) is an open-source performance portable flexible multibody (FMB) dynamics solver designed for time-domain simulations. While originally tailored for wind turbine structural dynamics, the formulation and implementation are those of a general flexible-multidbody dynamics solver that can readily be applied to a wide range of systems. Kynema was designed with a narrow focus, namely to provide a lightweight, fast, accurate FMD solver for coupling to computational-fluid-dynamics (CFD) codes, especially the CFD codes in the Kynema suite, for fluid-structure-interaction (FSI) simulations. Kynema-FMB is equipped to model systems that can be represented as a collection of beams and rigid bodies that are connected through constraints. Degrees of freedom are defined in the inertial/global frame of reference and include displacements and rotations (formally as rotation matrices, but stored as quaternions). The underlying formulation is built on a Lie-group time integrator designed for index-3 differential-algebraic equations, which is second-order accurate in time (Bruls et al., 2012). Beam models are based on geometrically exact beam theory and are discretized as high-order spectral finite elements similar to those in BeamDyn (Wang et al., 2017). The governing equations for a FMD system like a wind turbine constitute a highly nonlinear system of constrained partial-differential equations. Kynema-FMB uses analytical Jacobians in the nonlinear-system solves in each time step. Linear systems use sparse storage and several third-party sparse-linear-system solvers are enabled. Ill conditioning of linear systems is mitigated with preconditioning described in Bottasso et al, 2008. Kynema-FMB is integrated with a simple open-source controller (ROSCO). There is an application programming interface (API) for coupling to geometry-resolved CFD (like that in Sharma et al., 2023) and actuator-force CFD (like that in Kuhn et al., 2025). In the latter, for actuator-line models, Kynema-FMB includes an internal blade-element solver that depends on user-provided lookup tables for coefficients of lift and drag, i.e., aerodynamic polars. Kynema-FMB is written in C++ and leverages Kokkos and Kokkos-Kernels (KokkosEcosystem) as its performance portability layer enabling simulations on both CPU and GPU systems. The repository is equipped with extensive automated testing at the unit and regression/system levels. The following describes the high-level development objectives conceived for Kynema: *Kynema will follow modern software development best practices, including test-driven development (TDD), version control, hierarchical automated testing, and continuous integration (CI) for a robust development environment. *The core data structures are memory efficient and enable vectorization and parallelization at multiple levels. *Data structures are data-oriented to exploit methods for accelerated computing including high utilization of chip resources (e.g., single instruction multiple data (SIMD) instruction sets) and parallelization using GP-GPUs. *The computational algorithms incorporate robust open-source libraries for mathematical operations, resource allocation, and data management. *The API design considers multiple stakeholder needs and ensure integration with existing and future ecosystems for data science, machine learning, and AI. *Kynema-FMB is written in modern C++ and leverages Kokkos as its performance-portability library with inspiration from the kynema stack.

Sprague, MichaelA.↗

Electronic Bottleneck Suppression in Next‐Generation Networks with Integrated Photonic Digital‐to‐Analog Converters

Digital‐to‐analog converters (DAC) are indispensable functional units in signal processing instrumentation and wide‐band telecommunication links for both civil and military applications. As photonic systems are capable of high data throughput and low latency, an increasingly found system limitation stems from the required domain crossing such as digital to analog and electronic to optical. A photonic DAC implementation, in contrast, enables a seamless signal conversion with respect to both energy efficiency and short signal delay, often requiring bulky discrete optical components and electric–optic transformation, hence introducing inefficiencies. Herein, a novel coherent parallel photonic DAC concept along with a 4‐bit experimental prototype capable of performing this DAC without optic–electric–optic domain crossing is introduced. This new paradigm guarantees a linear intensity weighting among bits when operating at high sampling rates (50 GHz), featuring an exceptional sampling efficiency (> 100 GS ) and small footprint (≈1 mm 2 ) in an 8‐bit implementation. Importantly, this photonic DAC enables seamless interfaces of next‐generation data processing hardware with high relevance in data centers, task‐specific compute accelerators such as neuromorphic engines, and network edge processing applications.

Meng, Jiawei↗

Graph Identification of Proteins in Tomograms (GRIP-Tomo) 2.0: Topologically aware classification for proteins

Cryo-electron tomography (cryo-ET) enables structural characterization of biomolecules under near-native conditions. Existing approaches for interpreting the resulting three-dimensional volumes are computationally expensive and have difficulty interpreting density associated with small proteins/complexes. To explore alternate approaches for identifying proteins in cryo-ET data we pursued a Graph Network and topologically invariant approach. Here, we report on a fast algorithm that classifies particles by searching for nuances of evolutionarily conversed motifs and the geometrical characteristics of protein structure. GRIP-Tomo 2.0 is a machine-learning pipeline that extracts interpretable topological features of protein structures within noisy experimental backgrounds. Compared to version 1.0, the new pipeline includes three upgrades that significantly improve performance including synthetic tomogram generation simulating realistic noise, graph-based persistent feature extraction as protein fingerprints, and high-performance computing acceleration. GRIP-Tomo 2.0 achieves over 90% accuracy in classifying between proteins and noise using both real and synthetic datasets which represents a foundational step toward advancing cryo-ET workflows and empowering automated visual proteomics.

Li, Chengxuan↗

Parametric reduced-order modeling for component-oriented treatment and localized nonlinear feature inclusion

Abstract We propose coupling a physics-based reduction framework with a suited response decomposition technique to derive a component-oriented reduction (COR) approach, which is suitable for assembly systems featuring localized nonlinearities. Dependencies on influencing parameters are injected into the reduced-order model (ROM), thus ensuring robustness and validity over a domain of parametric inputs, while capturing nonlinear effects. The implemented approach employs individual component modes to capture localized features while additionally relying on reduced modes of a global nature to approximate the system’s dynamics accurately. The global modes are derived from a linear monolithic system, defined as a result of a coordinate separation scheme, which permits the proposed COR-ROM to naturally couple the response between linear and nonlinear subdomains. The derived low-order representation utilizes a proper orthogonal decomposition projection and is additionally reinforced with the inclusion of a hyper-reduction technique to capture the underlying high-fidelity model response while providing accelerated computations. The resulting approach is exemplified in the synthetic case studies of a four-story shear frame with multiple nonlinear regions driven by hysteresis and a large-scale kingpin connection featuring plasticity.

Vlachas, Konstantinos (ORCID:000000029124219X)↗

Large-scale scenarios of electric vehicle charging with a data-driven model of control

Transportation electrification is forecast to bring millions of new electric vehicles to roads worldwide this decade. Planning to support those vehicles depends on detailed scenarios of their electricity demand in both uncontrolled and controlled or smart charging scenarios. In this work, we present a novel modeling approach to enable rapid generation of demand estimates that represent the impact of controlled charging for large-scale scenarios with millions of individual drivers. To model the effect of load modulation control on aggregate charging profiles, we propose a novel machine learning approach that replaces traditional optimization approaches. We demonstrate its performance modeling workplace charging control under a range of electricity rate schedules, achieving small errors (2.5%–4.5%) while accelerating computations by more than 4000 times. To generate the uncontrolled charging demand for scenarios with residential, workplace, and public charging we use statistical representations of a large data set of real charging sessions. We demonstrate the methodology by generating diverse sets of scenarios for California's charging demand in 2030 which consider multiple charging segments and controls, each run locally in under 50 s. We further demonstrate support for rate design by modeling the large-scale impact of a new, custom rate schedule for workplace charging.

33 ADVANCED PROPULSION SYSTEMS↗

OpenACC acceleration for the P N – P N - 2 algorithm in Nek5000

Due to its high performance and throughput capabilities, GPU-accelerated computing is becoming a popular technology in scientific computing, in particular using programming models such as CUDA and OpenACC. The main advantage with OpenACC is that it enables to simply port codes in their ‘‘original’’ form to GPU systems through compiler directives, thus allowing an incremental approach. An OpenACC implementation is applied to the CFD code Nek5000 for simulation of incompressible flows, based on the spectral-element method. The work follows up previous implementations and focuses now on the P N - P N-2 method for the spatial discretization of the Navier–Stokes equations. Performance results of the ported code show a speed-up of up to 3.1 on multi-GPU for a polynomial order N > 11.

97 MATHEMATICS AND COMPUTING↗

Insights into Supported Subnanometer Catalysts Exposed to CO via Machine-Learning-Enabled Multiscale Modeling

Subnanometer catalysts offer high noble metal utilization and superior performance for several reactions. However, understanding their structures and properties on an atomic scale under working conditions is challenging due to the large configurational space. Here, we introduce an efficient multiscale framework to predict their stability exposed to an adsorbate. The framework integrates a comprehensive toolset including density functional theory (DFT) calculations, cluster expansion, machine learning, and structure optimization. The end-to-end machine-learning workflow guides DFT data generation and enables significant computational acceleration. We demonstrate the approach for CO-adsorbed Pdn (n = 1–55) clusters on CeO 2 (111). Simulation results reveal that CO can facilitate restructuring by stabilizing smaller planar structures and bilayer structures of specific intermediate sizes, consistent with experimental reports. Metal–support interactions, preferential CO adsorption, and metal nuclearity and structure control catalyst stability. As a result, the framework allows automatic discovery of stable catalyst structures and a systematic strategy to exploit properties in the subnanometer scale.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Coupled Cluster Theory on Graphics Processing Units I. The Coupled Cluster Doubles Method

The coupled cluster (CC) ansatz is generally recognized as providing one of the best wave function-based descriptions of electronic correlation in small- and medium-sized molecules. The fact that the CC equations with double excitations (CCD) may be expressed as a handful of dense matrix-matrix multiplications makes it an ideal method to be ported to graphics processing units (GPUs). Here we present our implementation of the spin-free CCD equations in which the entire iterative procedure is evaluated on the GPU. The GPU-accelerated algorithm readily achieves a factor of 4-5 speedup relative to the multithreaded CPU algorithm on same-generation hardware. The GPU-accelerated algorithm is approximately 8-12 times faster than Molpro, 17-22 times faster than NWChem, and 21-29 times faster than GAMESS for each CC iteration. Single-precision GPU-accelerated computations are also performed, leading to an additional doubling of performance. Single-precision errors in the energy are typically on the order of 10 -6 hartrees and can be improved by about an order of magnitude by performing one additional iteration in double precision.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Ligand removal energetics control CO 2 electroreduction selectivity on atomically precise, ligated alloy nanoclusters

Atomically precise, thiolate-protected gold nanoclusters (TPNCs) exhibit remarkable catalytic performance for the electrochemical reduction of carbon dioxide (CO 2 R) to CO. The origin of their high CO 2 R activity and selectivity has been attributed to partial ligand removal from the thiolate-covered surfaces of TPNCs to expose catalytically active sulfur atoms. Recently, heterometal doped (alloy) TPNCs have been shown to exhibit enhanced CO 2 R activity and selectivity compared to their monometallic counterparts. However, systematic studies on the effect of doping (metal type and location on TPNC) on active site exposure and CO 2 R activity are missing in literature. Herein, we apply Density Functional Theory calculations to investigate the effect of heterometal (Pt, Pd, Hg and Cd) doping of Au 25 (SR) 18 TPNC on the active site exposure and CO 2 R activity and selectivity. In this study, we reveal that doping significantly modifies relevant TPNC electronic properties, such as electron affinity, while also altering partial ligand removal and carboxyl (*COOH) intermediate formation energies. Furthermore, we demonstrate that changing the dopant (e.g. Hg) position can change the selectivity of the TPNC towards CO (g) or H 2(g) formation, highlighting the importance of dopant locations in TPNC-based CO 2 R. Most notably, we report a universal (i.e. capturing different dopant types and positions) linear trend between the ligand removal energy and i) the *COOH formation energy, as well as, ii) the hydrogen (*H) formation energy on the different alloy TPNCs. Thus, utilizing the ligand removal energy as a descriptor for CO 2 RR activity and selectivity, our work opens new avenues for accelerated computational screening of different alloy TPNCs for electrocatalytic CO 2 R applications.

54 ENVIRONMENTAL SCIENCES↗