Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computer Operations and Hardware”

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 523 records · Page 29

Situational Awareness of Grid Anomalies (SAGA)

The modern power industry becomes more vulnerable to cyber events due to the growing interconnectivity, interdependence, and complexity of the electric power grid. High-fidelity modeling and simulation tools that support the preventative risk analysis on potential cyber-relevant events is essential for ensuring the situational awareness of the system operator as it provides an inexpensive and risk-free environment to test the system responses under various cyber-relevant events and hereby can support research on cyber anomaly detection, optimal protective resource allocation, and mitigation measures. In this webinar, we will share NREL's cybersecurity research capabilities by highlighting the development of a scalable cyber-physical event test bed and demonstration with real hardware in the loop. The developed cyber-physical event test bed is backboned by an integrated transmission, distribution, and communication dynamic co-simulation framework and a plug-and-play cyber event generation module. It is designed to be modular and compatible with parallel computing, and thereby supports large-scale system simulations at an affordable computation cost. The test bed can capture millisecond-to-minutes dynamic frequency and voltage responses under cyber events from the bulk transmission system to the active distribution systems and distributed energy resources at the grid edge.

co-simulation↗

Hierarchical Task-Data Parallelism using Kokkos and Qthreads

This report describes a new capability for hierarchical task-data parallelism using Sandia's Kokkos and Qthreads, and evaluation of this capability with sparse matrix Cholesky factorization and social network triangle enumeration mini-applications. Hierarchical task-data parallelism consists of a collection of tasks with executes-after dependences where each task contains data parallel operations performed on a team of hardware threads. The collection of tasks and dependences form a directed acyclic graph of tasks - a task DAG. Major challenges of this research and development effort include: portability and performance across multicore CPU; manycore Intel Xeon Phi, and NVIDIA GPU architectures; scalability with respect to hardware concurrency and size of the task DAG; and usability of the application programmer interface (API).

97 MATHEMATICS AND COMPUTING↗

Best effort broadcast under cascading failures in interdependent critical infrastructure networks

Here, we present a novel study of reliable broadcast in interdependent networks, in which the failures in one network may cascade to another network. In particular, we focus on the interdependency between a communication network and a power grid network, where the power grid depends on the communication network for control and the communication network depends on the grid for power. In this paper, we propose a best effort broadcast algorithm to handle crash failures in the communication network that may cause cascading failures. We guarantee that all the correct nodes, which operate correctly according to the protocol and do not experience any software or hardware or network failures, eventually deliver the message if the sender is correct. We provide a centralized algorithm and a fully distributed algorithm for nodes to analyze and handle cascading failures. At the core of our work is the fully distributed algorithm which enjoys great performance and scalability. Our evaluation results show that the algorithm handles cascading failures with low overhead.

97 MATHEMATICS AND COMPUTING↗

Prediction of Cyclic Variability and Knock-Limited Spark Advance (KLSA) in Spark-Ignition (SI) Engine

Engine knock remains one of the major barriers to further improve thermal efficiency of Spark Ignition (SI) engines. Knock can be suppressed by lowering the compression ratio, or retarding the spark ignition timing, however, at an expense of efficiency penalty. SI engine is usually operated at knock-limited spark advance (KLSA) to achieve possibly maximum efficiency with given engine hardware and fuel properties, such as Research Octane Number (RON), Motor Octane Number (MON), and heat of vaporization, etc. Co-optimization of engine design and fuel properties is promising to improve the engine efficiency and predictive CFD models can be used to facilitate this optimization process. However, difficulties exist in predicting KLSA in CFD simulations. First, cyclic variability of SI engine demands that multi-cycle results are required to capture the extreme conditions. Secondly, Mach Courant-Friedrichs-Lewy (CFL) number of 1 is desired to accurately predict the knock intensity (KI), resulting in unaffordable computational cost, especially for multi-cycle simulations. In this study, a new approach to numerically predict KLSA using large Mach CFL number of 50 is proposed. This approach is validated against experimental data for a boosted Direct Injection Spark Ignition (DISI) engine at multiple loads and spark timings. G-equation combustion model coupled with well-mixed chemical kinetic model are used to predict the turbulent flame propagation and end-gas auto-ignition, respectively. Simulations run for 10 consecutive engine cycles at each condition. The results show good agreement between model predictions and experiments in terms of cylinder pressure, combustion phasing and cyclic variation. Engine knock is predicted with early spark ignition timing, indicated by significant pressure wave oscillation and end-gas heat release. Maximum Amplitude of Pressure Oscillation (MAPO) analysis is performed to quantify the KI, and the slope change point in KI extrema is used to indicate the KLSA accurately. Using a smaller Mach CFL number of 5 also results in the same conclusions thus demonstrating that this approach is insensitive to the Mach CFL number. The use of large Mach CFL number allows us to achieve fast turn-around time for multi-cycle engine CFD simulations.

Yue, Zongyu↗

Characterizing MPI matching via trace-based simulation

With the increased scale expected on future leadership-class systems, detailed information about the resource usage and performance of MPI message matching provides important insights into how to maintain application performance on next-generation systems. However, obtaining MPI message matching performance data is often not possible without significant effort. A common approach is to instrument an MPI implementation to collect relevant statistics. While this approach can provide important data, collecting matching data at runtime perturbs the application's execution, including its matching performance, and is highly dependent on the MPI library's matchlist implementation. In this paper, we introduce a trace-based simulation approach to obtain detailed MPI message matching performance data for MPI applications without perturbing their execution. Using a number of key parallel workloads, we demonstrate that this simulator approach can rapidly and accurately characterize matching behavior. Specifically, we use our simulator to collect several important statistics about the operation of the MPI posted and unexpected queues. For example, we present data about search lengths and the duration that messages spend in the queues waiting to be matched. Here, data gathered using this simulation-based approach have significant potential to aid hardware designers in determining resource allocation for MPI matching functions and provide application and middleware developers with insight into the scalability issues associated with MPI message matching.

97 MATHEMATICS AND COMPUTING↗

Distributed Energy Technologies Laboratory Wind Turbine Emulator Design Documentation

This document contains the design and operation principles for the wind turbine emulator (WTE) located in the Distributed Energy Technologies Laboratory (DETL) at Sandia National Laboratories (Sandia). The wind turbine emulator is a power hardware -in-the-loop (PHIL) representation of the research wind turbines located in Lubbock, Texas at the Sandia Scaled Wind Farm Technology (SWiFT) facility. This document describes installation and commissioning steps, and it provides references to component manuals and specifications.

17 WIND ENERGY↗

Efficient exascale discretizations: High-order finite element methods

Efficient exploitation of exascale architectures requires rethinking of the numerical algorithms used in many large-scale applications. These architectures favor algorithms that expose ultra fine-grain parallelism and maximize the ratio of floating point operations to energy intensive data movement. One of the few viable approaches to achieve high efficiency in the area of PDE discretizations on unstructured grids is to use matrix-free/partially assembled high-order finite element methods, since these methods can increase the accuracy and/or lower the computational time due to reduced data motion. In this paper we provide an overview of the research and development activities in the Center for Efficient Exascale Discretizations (CEED), a co-design center in the Exascale Computing Project that is focused on the development of next-generation discretization software and algorithms to enable a wide range of finite element applications to run efficiently on future hardware. CEED is a research partnership involving more than 30 computational scientists from two US national labs and five universities, including members of the Nek5000, MFEM, MAGMA and PETSc projects. We discuss the CEED co-design activities based on targeted benchmarks, miniapps and discretization libraries and our work on performance optimizations for large-scale GPU architectures. We also provide a broad overview of research and development activities in areas such as unstructured adaptive mesh refinement algorithms, matrix-free linear solvers, high-order data visualization, and list examples of collaborations with several ECP and external applications.

97 MATHEMATICS AND COMPUTING↗

Bridging Cloud and Edge Computing at NREL Using CONNECT: Cloud Optimized Networking for Next-Gen Edge Computing Technologies [Slides]

CONNECT is an innovative on-premise hardware and software solution that integrates edge and cloud computing infrastructure at NREL. Built on the AWS Greengrass middleware and leveraging the MQTT protocol, CONNECT enables real-time data streaming from IoT devices and gateways to both cloud and local services, empowering researchers to rapidly capture, analyze, and act upon edge-generated data while leveraging cloud capabilities. The platform addresses research infrastructure challenges by providing a pre-approved platform which is already configured with the correct networking and cybersecurity baselines thus eliminating procurement delays and enabling on-demand availability. CONNECT's hybrid architecture efficiently manages burstable workloads, allowing research teams to dynamically scale computational capacity, handle peak data loads, and reduce operational bottlenecks. Advanced capabilities include built-in GPU support for executing machine learning models which enables low-latency inference at the edge from models trained in the cloud. This architecture supports real-time analytics and filtering, providing a mechanism to allow only transmitting and processing high-value data. Cloud-based configuration management permits engineers to manage on-premise systems remotely, optimizing operational efficiency. By bridging edge and cloud computing, CONNECT provides NREL researchers with a flexible, scalable platform that accelerates scientific discovery while maintaining robust security and performance standards.

97 MATHEMATICS AND COMPUTING↗

Differential Power Processing for Ultra-Efficient Data Storage

Here this paper presents the hardware, software, and power codesign of an ultra-efficient data storage server with differential power processing (DPP). DPP can reduce the power conversion stress, improve the efficiency, and enhance the functionality of modular power electronics systems. The power inputs of a large number of hard disk drives (HDDs) were connected in series and supported by a multiport ac-coupled differential power processing (MAC-DPP) converter through a multiwinding transformer. Methods for controlling the multi-input multi-output power flow in the multiwinding transformer while avoiding core saturation were investigated. A ten-port MAC-DPP prototype with 700-W/in 3 power density was built to support a 450-W HDD storage system with ten series-stacked voltage domains. The prototype was tested on a 50-HDD server testbench, and the overall system loss is below 1 W (99.77% system efficiency). The server was able to maintain high-speed reading and writing operation of all 50 HDDs against the worst hot-swapping scenarios. A variety of hardware/software configurations and many cloud storage techniques were tested on the fully functioning server. Experimental results show that the energy efficiency of large-scale information systems (CPU/GPU clusters, memory banks, HDD arrays, etc.) can be greatly improved by software, hardware, and power codesign.

42 ENGINEERING↗

Optimal size of the block in block GMRES on GPUs: computational model and experiments

The block version of GMRES (BGMRES) is most advantageous over the single right hand side (RHS) counterpart when the cost of communication is high while the cost of floating point operations is not. This is the particular case on modern graphics processing units (GPUs), while it is generally not the case on traditional central processing units (CPUs). Here, in this paper, experiments on both GPUs and CPUs are shown that compare the performance of BGMRES against GMRES as the number of RHS increases, with a particular focus on GPU performance. The experiments indicate that there are many cases in which BGMRES is slower than GMRES on CPUs, but faster on GPUs. Furthermore, when varying the number of RHS on the GPU, there is an optimal number of RHS where BGMRES is clearly most advantageous over GMRES. A computational model for the GPU is developed using hardware specific parameters, providing insight towards how the qualitative behavior of BGMRES changes as the number of RHS increase, and this model also helps explain the phenomena observed in the experiments.

97 MATHEMATICS AND COMPUTING↗

Real-Time Considerations for Rugged Embedded Systems

This chapter introduces the characterizing aspects of embedded systems, and discusses the specific features that a designer should address to an embedded system “rugged”, i.e., able to operate reliably in harsh environments. The chapter addresses both the hardware and the less obvious software aspect. After presenting a current list of certifications for ruggedization, the chapters present a case study that focuses on the interaction of the hardware and software layers in reactive real-time system. In particular, it shows how the use of fast FPGA prototyping could provide insights on unexpected factors that influence the performance and thus responsiveness to events of a scheduling algorithm for multiprocessor systems that manages both periodic, hard real-time task, and aperiodic tasks. The main lesson is that to make the system “rugged”, a designer should consider these issues by, for example, overprovisioning resources and/or computation capabilities.

FPGA↗

Multi-Agent Control Planes for Quantum Networks: A Scalable Architecture for Autonomous Quantum Internet Management

Quantum networks are expected to enable distributed quantum computing, secure communication, and global entanglement distribution. However, operating such networks presents significant challenges, including stochastic quantum processes, fragile entanglement resources, dynamic topology, and cross-layer control requirements. Current quantum network control architectures largely rely on centralized or hierarchical controllers inspired by classical software-defined networking (SDN). While effective for small testbeds, these approaches face scalability, latency, and reliability limitations as quantum networks grow. This paper proposes a multi-agent control plane architecture for quantum networks. In this design, intelligent software agents operate at quantum nodes, repeaters, and orchestration layers, collectively managing entanglement generation, routing, purification, and scheduling. The distributed intelligence of the agent system allows the network to adapt dynamically to quantum hardware variability and environmental noise. We argue that multi-agent systems provide significant advantages over centralized control approaches, including scalability, resilience, local autonomy, and real-time adaptation. The paper discusses architectural design principles, agent coordination mechanisms, and research challenges in deploying multi-agent control planes for the emerging quantum Internet.

Alnajjar, Anees [ORNL] (ORCID:0000000237101601)↗

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE↗

Binary Complex Neural Network Acceleration on FPGA

Being able to learn from complex data with phase information is imperative for many signal processing applications. Today’s real-valued deep neural networks (DNNs) have shown efficiency in latent information analysis but fall short when applied to the complex domain. Deep complex networks (DCN) , in contrast, can learn from complex data, but have high computational costs; therefore, they cannot satisfy the instant decision making requirements of many deployable systems dealing with short observations or short signal bursts. Recent, Binarized Complex Neural Network (BCNN), which integrates DCNs with binarized neural networks (BNN), shows great potential in classifying complex data in real-time. In this paper, we propose a structural pruning based accelerator of BCNN, which is able to provide more than 5000 frames/s inference throughput on edge devices. The high performance comes from both the algorithm and hardware sides. On the algorithm side, we conduct structural pruning to the original BCNN models and obtain 20 × pruning rates with negligible accuracy loss; on the hardware side, we propose a novel 2D convolution operation accelerator for the binary complex neural network. Experimental results show that the proposed design works with over 90% utilization and is able to achieve the inference throughput of 5882 frames/s and 4938 frames/s for complex NIN-Net and ResNet-18 using CIFAR-10 dataset and Alveo U280 Board.

Peng, Hongwu↗

Braiding for the win: Harnessing braiding statistics in topological states to play quantum games

Nonlocal quantum games provide proof of principle that quantum resources can confer an advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent paper [O. Hart et al., Phys. Rev. Lett. 134, 130602 (2025)], we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this paper we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Additionally, by connecting the win probability to twist products, we show that success at the game serves as a many-body entanglement witness. Namely, if the players implement a perfect quantum strategy on large length scales, the quantum state they share cannot be connected to a trivial product state via a constant-depth local unitary circuit. Lastly, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.

Fractons↗

Comparison of Distributive Consensus Algorithms for AnomalyDetection on the Power-Grid

As an increasing number of devices in the power-grid rely on high-precision clocks to measure electrical properties and time stamp data, GPS receivers have become a vulnerability on the power-grid. GPS spoofing attacks, in which a fake signal is transmitted, can cause sensor measurement errors that can misinform protective equipment and grid operators for both the transmission and distribution grid. The technology being developed to secure precision clocks in the transmission grid are not appropriate for the distribution grid. Thus, there is a need to developed anomaly detection algorithms that are suitable for the hardware available on the distribution grid. Traditionally, a distributed detection framework is comprised of spatially distributed nodes which acquire observations about a quantity of interest and sends the data to the fusion center, where a global decision is made. Instead the distribution grid has low-power devices, such as smart inverters and microPMUs, that could be used to perform highly parallelized calculations. Having on node calculations is beneficial since it is more network and computation efficient, as the more calculations can be performed where the data is being captured instead of communicating across a slow network to a centralized fusion center. Instead, we could employ an alternate peer-to-peer type of information exchange on the distribution grid that can still reach a global decision. A decentralized approach to anomaly detection makes efficient use of the computational and network bandwidth that exists, and it also lacks the single point of failure of a centralized approach. Thus, a decentralized local information exchange and/or inference is preferred. Lastly, the unreliability of the distribution grid network connections and potential noise or error in the measurements must be considered. In order to produce an effective detection tool, a Byzantine-fault tolerant and asynchronous algorithm must be developed. Thus, the first phase of our project is to develop a distributed, decentralized, asynchronous, Byzantine-fault tolerant, collaborative autonomy-based anomaly detection algorithm to collectively analyze clusters of data for signs of a malicious attack.

97 MATHEMATICS AND COMPUTING↗

Portable Industrial Control Systems Simulator (Final Report)

Industrial Control Systems (ICS) are more integrated than they have ever been before, but also the division between IT (Information Technology) and OT (Operational Technology) is becoming a grey area. As the integration of IT and OT occurs more often, cyber attack will also increase. Cyber attacks on Critical Infrastructure can be highly detrimental to society, notably via compromised Industrial Control Systems (ICS). Virtual and physical simulation has been used in medical fields, mathematics, architecture, aeronautics, space, and many more. Virtualization & Simulation in a lab environment is ideal because there is a need for the ability to test theories and designs is a safe and cost-effective way without risking equipment damage or, more importantly, human life. Furthermore, OT and ICS are some of the most difficult systems to use for research and development. They are either committed to operations or widely expensive to set up in a life-like environment. Virtualization and simulation will allow these otherwise accessible systems to be a test bed for the training, development, and research of SRNL customers or engineers and scientists at SRNL. This will allow the testbed to fit into a small form factor and interact with a simulator with minimum hardware components for easy transports and replication effort within the environment.

42 ENGINEERING↗

Supporting ARPA-E Power Grid Optimization (Final Report)

Pacific Northwest National Laboratory (PNNL), Arizona State University (ASU), Georgia Institute of Technology (Georgia Tech), Los Alamos National Laboratory (LANL), National Renewable Energy Laboratory (NREL), Texas A&M University (TAMU), The University of Texas at Austin (UT), and the University of Wisconsin-Madison (UW-M) supported the ARPA-E Grid Optimization (GO) Competition by providing a common problem formulation, data format, datasets, evaluation mechanism, scoring, rules, and results that resulted in the awarding of $\$9.24$ million dollars to teams from academia, industry, and national labs for solving three sets of increasingly difficult non-linear, security- constrained AC Optimal Powerflow (AC-OPF) optimization problems in order to increase the efficiency of the US Electric Grid. It is estimated that a 1% increase in efficiency can save $\$1$ billion. Current industry practices typically use a linear DC model (DC-OPF) in order solve the OPF problem within the time constraints of the operation schedule. The GO Competition challenges the best power engineers, mathematicians, and computer scientists to make possible operational decisions based on accurate physical models. To accomplish this, the GO Competition created a series of Challenges and funded teams to produce the best solver. Challenge 1 was to solve the security constrained Alternating Current Optimal Power Flow (ACOPF) problem. Challenge 2 extended that to by adding adjustable transformer tap ratios, phase shifting transformers, switchable shunts, price-responsive demand, ramp rate constrained generators and loads, and fast-start unit commitment (UC). Furthermore, Challenge 2 was a maximization problem while Challenge 1 was a minimization problem. While Challenge 3 was being developed, the entrants were invited to find better solutions to the Challenge 2 synthetic datasets with no restrictions on time, hardware, or algorithms. The Challenge 2 solutions turned out to be very good. Challenge 3 expanded the Challenge 2 problem further by using multiperiod dynamic markets, including advisory models for extreme weather events, day-ahead markets, and the real-time markets with an extended look-ahead. These problems included active bid-in demand and topology optimization. Together the Challenges used nearly 30 million CPU hours. Since each team was working on the same problem, using the same data, and running on the same hardware, fair comparisons could be drawn as to the best solver. The datasets were varied enough, however, that the best solver for one dataset was not necessarily the best at another, so cumulative scores were used. The process was managed by the PNNL maintained website https://GOCompetition.energy.gov, where Entrants could find information about the problem, the data, the rules, submit their solver for evaluation, and see the scores of all the competing teams on a Leaderboard. Interest was world-wide but only American teams were eligible for prizes. The Competition has produced 34 journal articles 115 papers and been cited over 500 times in the literature, including 12 dissertations (4 from foreign countries; Columbia (2), Germany, and Italy) and 3 from the DOE ExaScale project. Software developed by Pearl Street Technologies for Challenges 1 and 2 is now deployed by Southwest Power Pool (SPP) and Midcontinent Independent Service Operator (MISO). Other teams have received inquiries from venture capitalists. Google DeepMind has thanked the Competition for making the datasets developed for the Competition public. They are using it to train machine learning models. The larger datasets have billions of unknowns to be solved for, but only a small percent matter in the final solution. Knowing what unknowns are important can dramatically speedup the solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗