Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Low latency”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Variational autoencoders for at-source data reduction and anomaly detection in high energy particle detectors

Detectors in next-generation high-energy physics experiments face several daunting requirements, such as high data rates, damaging radiation exposure, and stringent constraints on power, space, and latency. To address these challenges, machine learning in readout electronics can be leveraged for smart detector designs, enabling intelligent inference and data reduction at-source. Variational autoencoders (VAEs) offer a variety of benefits for front-end readout; an on-sensor encoder can perform efficient lossy data compression while simultaneously providing a latent space representation that can be used for anomaly detection. Results are presented from low-latency and resource-efficient VAEs for front-end data processing in a futuristic silicon pixel detector. Encoder-based data compression is found to preserve good performance of off-detector analysis while significantly reducing the off-detector data rate as compared to a similarly sized data filtering approach. Furthermore, the latent space information is found to be a useful discriminator in the context of real-time sensor defect monitoring. Together, these results highlight the multifaceted utility of autoencoder-based front-end readout schemes and motivate their consideration in future detector designs.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Multi-User Capacity for Cyclic Prefix Direct Sequence Spread Spectrum with Linear Detection and Precoding

Cyclic Prefix Direct Sequence Spread Spectrum (CP-DSSS) is a promising solution for futuristic 6G ultra-reliable low latency communications (URLLC) and massive machine type communication (mMTC) applications, where the CP-DSSS waveform would operate as a secondary network at the same frequencies as the primary network but at much lower SNR. In this paper, we show per-user capacity for multi-user scenarios, where simple matched filtering (MF) is performed on the uplink (UL) and time-reversal (TR) precoding is used on the downlink (DL). When operating in the low SNR regime, CP-DSSS achieves per-user capacity near the optimum single-user capacity by using a MF detector at the receiver for the UL. TR precoding converges to the optimal capacity as the number of antennas at the hub/gateway increases. Given the near-optimal performance of MF detection and TR precoding for each of the users, CP-DSSS can be implemented with simple device transceiver structures, reducing per-unit cost for massively deployed 6G networks.

5G and Beyond Communications↗
DOE OSTI2024

Real-time Anomaly Detection at the L1 Trigger of CMS Experiment

We present the preparation, deployment, and testing of an autoencoder trained for unbiased detection of new physics signatures in the CMS experiment Global Trigger (GT) test crate FPGAs during LHC Run 3. The GT makes the final decision whether to readout or discard the data from each LHC collision, which occur at a rate of 40 MHz, within a 50 ns latency. The Neural Network makes a prediction for each event within these constraints, which can be used to select anomalous events for further analysis. The GT test crate is a copy of the main GT system, receiving the same input data, but whose output is not used to trigger the readout of CMS, providing a platform for thorough testing of new trigger algorithms on live data, but without interrupting data taking. We describe the methodology to achieve ultra low latency anomaly detection, and present the integration of the DNN into the GT test crate, as well as the monitoring, testing, and validation of the algorithm during proton collisions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

CoREC: Scalable and Resilient In-memory Data Staging for In-situ Workflows

The dramatic increase in the scale of current and planned high-end HPC systems is leading new challenges, such as the growing costs of data movement and IO, and the reduced mean time between failures (MTBF) of system components. In-situ workflows, i.e., executing the entire application workflows on the HPC system, have emerged as an attractive approach to address data-related challenges by moving computations closer to the data, and staging-based frameworks have been effectively used to support in-situ workflows at scale. However, the resilience of these staging-based solutions has not been addressed, and they remain susceptible to expensive data failures. Furthermore, naive use of data resilience techniques such as n-way replication and erasure codes can impact latency and/or result in significant storage overheads. In this article, we present CoREC, a scalable and resilient in-memory data staging runtime for large-scale in-situ workflows. CoREC uses a novel hybrid approach that combines dynamic replication with erasure coding based on data access patterns. It also leverages multiple levels of replications and erasure coding to support diverse data resiliency requirements. Furthermore, the article presents optimizations for load balancing and conflict-avoiding encoding, and a low overhead, lazy data recovery scheme. We have implemented the CoREC runtime and have deployed with the DataSpaces staging service on leadership class computing machines and present an experimental evaluation in the article. Here, the experiments demonstrate that CoREC can tolerate in-memory data failures while maintaining low latency and sustaining high overall storage efficiency at large scales.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Overcoming the Technical Challenges of Coordinating Distributed Load Resources at Scale (Final Report)

Significant recent research has investigated the potential for loads to provide balancing services to the grid. However, this research has not addressed key issues that may arise when such schemes are applied at scale including: 1. Distribution Network Issues. Coordination of large numbers of loads could result in power flows that violate distribution network constraints; 2. Stability Issues. Certain strategies to control loads can exhibit nonlinearity in the form of period-adding bifurcations and chaos. Other control strategies can potentially synchronize the behavior of large numbers of loads. In both cases, the outcome can be power oscillations and instability; 3. Communication Network Issues. Bidirectional low-latency communication channels between a central controller (or several distributed controllers) and each resource are expensive and likely not necessary for effective coordination. Our research questions were: What network, stability, and communication issues might arise in practice when we coordinate large aggregations of loads? How can we coordinate loads to achieve performance objectives in a cost effective manner while avoiding these issues? The ultimate technical goal of the project was the development of network-aware, communication-constrained, non-disruptive load control strategies with stability guarantees that achieve the performance requirements of typical balancing services at a sufficiently low cost to enable the load aggregator and customer to profit. The overall goal was to establish credibility for load control at scale and contribute to U.S. energy security and environmental goals. The team succeeded in answering these research questions and developing these control strategies. The overall approach was based on the development of three testing environments: a simulation testbed, an experimental testbed (20 physical model houses with window-box air conditioners) coupled with the simulation testbed, and a field testbed (100 actual homes in Austin, TX) coupled with the simulation testbed, which enabled controller testing, identification of issues, controller development, and controller validation. The resulting controller was used to demonstrate fast timescale grid balancing (frequency regulation) by aggregations of physical and virtual air conditioners, with sufficient quality to participate in the electricity market. Cost benefit analysis showed overall benefits to the participating households, load aggregators, and the grid, especially if the control technology was integrated directly into existing programmable communicating thermostats. The project provides a variety of wider benefits. Our technology transfer and outreach activities lead us to choose an open-source licensing commercialization pathway, enabling the project results to be available to researchers, industry, and the public. Furthermore, new grid balancing technologies will increase grid flexibility and will enable higher penetrations of intermittent renewable energy resources, such as wind and solar, to be connected to the grid, reducing its environmental impact, and mitigating climate change to the benefit of society.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

Fiber optic computing using distributed feedback

Abstract The widespread adoption of machine learning and other matrix intensive computing algorithms has renewed interest in analog optical computing, which has the potential to perform large-scale matrix multiplications with superior energy scaling and lower latency than digital electronics. However, most optical techniques rely on spatial multiplexing, requiring a large number of modulators and detectors, and are typically restricted to performing a single kernel convolution operation per layer. Here, we introduce a fiber-optic computing architecture based on temporal multiplexing and distributed feedback that performs multiple convolutions on the input data in a single layer. Using Rayleigh backscattering in standard single mode fiber, we show that this technique can efficiently apply a series of random nonlinear projections to the input data, facilitating a variety of computing tasks. The approach enables efficient energy scaling with orders of magnitude lower power consumption than GPUs, while maintaining low latency and high data-throughput.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Performance trade-offs in reconfigurable networks for HPC

Designing efficient interconnects to support high-bandwidth and low-latency communication is critical toward realizing high performance computing (HPC) and data center (DC) systems in the exascale era. At extreme computing scales, providing the requisite bandwidth through overprovisioning becomes impractical. These challenges have motivated studies exploring reconfigurable network architectures that can adapt to traffic patterns at runtime using optical circuit switching. Despite the plethora of proposed architectures, surprisingly little is known about the relative performances and trade-offs among different reconfigurable network designs. We aim to bridge this gap by tackling two key issues in reconfigurable network design. First, we study how cost, power consumption, network performance, and scalability vary based on optical circuit switch (OCS) placement in the physical topology. Specifically, we consider two classes of reconfigurable architectures: one that places OCSs between top-of-rack (ToR) switches—ToR-reconfigurable networks (TRNs)—and one that places OCSs between pods of racks—pod-reconfigurable networks (PRNs). Second, we tackle the effects of reconfiguration frequency on network performance. Our results, based on network simulations driven by real HPC and DC workloads, show that while TRNs are optimized for low fan-out communication patterns, they are less suited for carrying high fan-out workloads. PRNs exhibit better overall trade-off, capable of performing comparably to a fully non-blocking fat tree for low fan-out workloads, and significantly outperform TRNs for high fan-out communication patterns.

Teh, Min Yee↗
DOE OSTI2022

Reconfigurable Intelligent Surfaces Empowered THz Communication in LEO Satellite Networks

Massive swarms of low Earth orbit (LEO) satellites are poising to serve for high-speed and low-latency ubiquitous connectivity with almost global coverage. Broadband inter-satellite communication is one of the key elements of satellite communication systems that orchestrate massive satellite swarms in cooperation. Thanks to technological advancements in microelectronics and micro-systems, the terahertz (THz) band has emerged as a strong candidate for inter-satellite links (ISLs) due to its promise of wideband communication. Especially, multi-antenna systems can improve the system performance along with the wideband supported by the THz band. However, multi-antenna systems should be reconsidered due to their size, weight, and price/power (SWaP) constraints. On the other hand, as a state-of-art multi-antenna technology, reconfigurable intelligent surface (RIS) is able to relax SWaP constraints because of its passive component-based structures. However, as similar reflection characteristic throughout wideband is difficult to meet, it is possible to observe beam misalignment. In this work, we first provide an assessment of the use of the THz band for ISLs and quantify the impact of misalignment fading on error performance. Then, in order to compensate for the high path loss associated with high carrier frequencies, and to further improve the signal-to-noise ratio (SNR), we propose the use of RISs mounted on neighboring satellites to enable signal propagation. Based on a mathematical analysis of the problem, we present the error rate expressions for RIS-assisted ISLs with misalignment fading. Also, numerical results show that RIS can leverage the error rate performance and achievable capacity of THz ISLs.

reconfigurable intelligent surfaces (RISs)↗
DOE OSTI2020

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↗
DOE OSTI2024

Topology property analysis and application of stable time-delay regions for linear multiple time-delay systems

This study examines the relationship between the topology of stable time-delay regions and the stability analysis of an linear multiple time delay system. To analyze the topology of stable time-delay regions, we construct a function with a value equal to zero for the time-delay points on the boundaries of stable time-delay regions. The function is continuous and differentiable in the whole defining field with a global minimum of zero so that we can locate the boundaries by minimizing the value of the function. Based on the topology analysis, we proposed a performance validation approach for controllers that are designed to stabilize the system using feedback signals with time delays. The method based on the topology analysis is simple and reliable so that can deal with a linear time-invariant system with high order and multiple time delays (more than 3). The example case study shows that the above method is reliable and enables ultra-low latency coordination and control for the future power grid with ubiquitous power electronics.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Extending OpenSHMEM with Aggregation Support for Improved Message Rate Performance

OpenSHMEM is a highly efficient one-sided communication API that implements the PGAS parallel programming model, and is known for its low latency communication operations that can be mapped efficiently to RDMA capabilities of network interconnects. However, applications that use OpenSHMEM can be sensitive to point-to-point message rates, as many-to-many communication patterns can generate large amounts of small messages which tend to overwhelm network hardware that has predominantly been optimised for bandwidth over message rate. Additionally, many important emerging classes of problems such as data analytics are similarly troublesome for the irregular access patterns they employ. Message aggregation strategies have been proven to significantly enhance network performance, but their implementation often involves complex restructuring of user code, making them unwieldy. This paper shows how to combine the best qualities of message aggregation within the communication model of OpenSHMEM such that applications with small and irregular access patterns can improve network performance while maintaining their algorithmic simplicity. We do this by providing a path to a message aggregation framework called conveyors through a minimally intrusive OpenSHMEM extension introducing aggregation contexts that fit more naturally to the OpenSHMEM atomics, gets, and puts model. We test these extensions using four of the bale 3.0 applications which contain essential many-to-many access patterns to show how they can produce performance improvements of up to 65×.

Welch, Aaron↗
DOE OSTI2021

Charged Particle Tracking via Edge-Classifying Interaction Networks

Recent work has demonstrated that geometric deep learning methods such as graph neural networks (GNNs) are well suited to address a variety of reconstruction problems in high-energy particle physics. In particular, particle tracking data are naturally represented as a graph by identifying silicon tracker hits as nodes and particle trajectories as edges, given a set of hypothesized edges, edge-classifying GNNs identify those corresponding to real particle trajectories. In this work, we adapt the physics-motivated interaction network (IN) GNN toward the problem of particle tracking in pileup conditions similar to those expected at the high-luminosity Large Hadron Collider. Assuming idealized hit filtering at various particle momenta thresholds, we demonstrate the IN’s excellent edge-classification accuracy and tracking efficiency through a suite of measurements at each stage of GNN-based tracking: graph construction, edge classification, and track building. The proposed IN architecture is substantially smaller than previously studied GNN tracking architectures; this is particularly promising as a reduction in size is critical for enabling GNN-based tracking in constrained computing environments. Furthermore, the IN may be represented as either a set of explicit matrix operations or a message passing GNN. Efforts are underway to accelerate each representation via heterogeneous computing resources towards both high-level and low-latency triggering applications.

accelerator physics↗
DOE OSTI2026

Preliminary proof-of-concept of real-time divertor heat flux control from infrared cameras with nitrogen injection in the DIII-D tokamak

In future tokamak reactors like ITER and the Fusion Pilot Plant (FPP), real-time feedback control of heat flux to the plasma-facing components (PFC) will be critical for steady-state operation. This work presents the first experimental demonstration of real-time divertor heat flux estimation with infrared thermography and feedback control with impurity seeding on the DIII-D tokamak. The flexible infrastructure of the Plasma Control System (PCS) on DIII-D makes this new capability possible. The PCS software runs on a gateway computer system, and five real-time compute nodes. An array of low latency streaming digitizers from D-TACQ Solutions connects to these real-time computers to collect and process data, and send commands to actuators during plasma discharges. This system handles the signal IO from the tokamak and allows the PCS to utilize the diagnostic data necessary to perform control in real-time. Feedback control on heat flux was accomplished by feeding infrared camera data from the “Infrared TV” (IRTV) camera to a custom-developed User Datagram Protocol (UDP) server. This server transmits infrared data to a newly developed PCS algorithm that estimates the heat flux to PFC. Here, a proportional integral derivative (PID) controller minimizes the error between a heat flux reference and the real-time estimate by injecting nitrogen gas into the divertor.

Algorithm development↗
DOE OSTI2026

Real-time plasma monitoring framework for advanced plasma control and ML-research in DIII-D

Real-time and adaptive plasma control is crucial for robust tokamak operation, requiring sensitivity and tolerance measurements of the plasma state. This paper presents the implementation of an integrated real-time plasma monitoring framework on the DIII-D tokamak to support advanced control approaches, including machine-learning (ML) methods. The system is built on the SHIELD framework, a high-performance modular architecture that provides a unified pipeline for integrating diverse diagnostics. The framework leverages high-bandwidth digitizers, fast numerical processing, and deterministic, low-latency interconnects to stream high-fidelity data from diagnostics such as electron cyclotron emission (ECE), beam emission spectroscopy (BES), CO interferometers, and a visible tangential divertor camera (TangTV). The system’s validity is demonstrated through direct comparisons of real-time and offline data. Furthermore, we present two key applications of the developed plasma monitoring system with ML-based plasma control strategies, including real-time divertor detachment and active Alfvén Eigenmode control. As a result, this work presents a robust and scalable approach for integrating high-frequency, multidimensional diagnostics into advanced control algorithms for future fusion devices.

AI/ML↗
DOE OSTI2024

Integrated photonic encoder for low power and high-speed image processing

Abstract Modern lens designs are capable of resolving greater than 10 gigapixels, while advances in camera frame-rate and hyperspectral imaging have made data acquisition rates of Terapixel/second a real possibility. The main bottlenecks preventing such high data-rate systems are power consumption and data storage. In this work, we show that analog photonic encoders could address this challenge, enabling high-speed image compression using orders-of-magnitude lower power than digital electronics. Our approach relies on a silicon-photonics front-end to compress raw image data, foregoing energy-intensive image conditioning and reducing data storage requirements. The compression scheme uses a passive disordered photonic structure to perform kernel-type random projections of the raw image data with minimal power consumption and low latency. A back-end neural network can then reconstruct the original images with structural similarity exceeding 90%. This scheme has the potential to process data streams exceeding Terapixel/second using less than 100 fJ/pixel, providing a path to ultra-high-resolution data and image acquisition systems.

47 OTHER INSTRUMENTATION↗
DOE OSTI2022

Hardware-accelerated inference for real-time gravitational-wave astronomy

The field of transient astronomy has seen a revolution with the first gravitational-wave detections and the arrival of multi-messenger observations they enabled. Transformed by the first detection of binary black hole and binary neutron star mergers, computational demands in gravitational-wave astronomy are expected to grow by at least a factor of two over the next five years as the global network of kilometer-scale interferometers are brought to design sensitivity. With the increase in detector sensitivity, real-time delivery of gravitational-wave alerts will become increasingly important as an enabler of multi-messenger followup. In this work, we report a novel implementation and deployment of deep learning inference for real-time gravitational-wave data denoising and astrophysical source identification. This is accomplished using a generic Inference-as-a-Service model that is capable of adapting to the future needs of gravitational-wave data analysis. Overall, our implementation allows seamless incorporation of hardware accelerators and also enables the use of commercial or private (dedicated) as-a-service computing. Based on our results, we propose a paradigm shift in low-latency and offline computing in gravitational-wave astronomy. Such a shift can address key challenges in peak-usage, scalability and reliability, and provide a data analysis platform particularly optimized for deep learning applications. The achieved sub-millisecond scale latency will also be relevant for any machine learning-based real-time control systems that may be invoked in the operation of near-future and next generation ground-based laser interferometers, as well as the front-end collection, distribution and processing of data from such instruments.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Improving Performance of Tape Restore Request Scheduling in the Storage System dCache

Given the anticipated increase in the amount of scientific data, it is widely accepted that primarily disk based storage will become prohibitively expensive. Tape based storage, on the other hand, provides a viable and affordable solution for the ever increasing demand for storage space. Coupled with a disk caching layer that temporarily holds a small fraction of the total data volume to allow for low latency access, it turns tape based systems into active archival storage (write once, read many) that imposes additional demands on data flow optimization compared to traditional backup setups (write once, read never). In order to preserve the lifetime of tapes and minimize the inherently higher access latency, different tape usage strategies are being evaluated. As an important disk storage system for scientific data that transparently handles tape access, dCache is making efforts to evaluate its recall optimization potential and is introducing a proof-of-concept, high-level stage request scheduling component within its SRM implementation.

Morschel, Lea↗
DOE OSTI2024

Integration of RNTuple in ATLAS Athena

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

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗