Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Point-to-Point”

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 37 records · Page 2

A MeerKAT-meets-LOFAR study of Abell 1413: a moderately disturbed non-cool-core cluster hosting a ~500 kpc ‘mini’-halo

Many relaxed cool-core clusters host diffuse radio emission on scales of hundreds of kiloparsecs: mini-haloes. However, the mechanism responsible for generating them, as well as their connection with central active galactic nuclei, is elusive and many questions related to their physical properties and origins remain unanswered. This paper presents new radio observations of the galaxy cluster Abell 1413 performed with MeerKAT (L-band; 872 to 1712 MHz) and LOFAR HBA (120 to 168 MHz) as part of a statistical and homogeneous census of mini-haloes. Abell 1413 is unique among mini-halo clusters as it is a moderately disturbed non-cool-core cluster. Our study reveals an asymmetric mini-halo up to 584 kpc in size at 1283 MHz, twice as large as first reported at similar frequencies. The spectral index is flatter than previously reported, with an integrated value of α = −1.01 ± 0.06, shows significant spatial variation, and a tentative radial steepening. We studied the point-to-point X-ray/radio surface brightness correlation to investigate the thermal/non-thermal connection: our results show a strong connection between these components, with a superlinear slope of $b = 1.63^{+0.10}_{-0.10}$ at 1283 MHz and $b = 1.20^{+0.13}_{-0.11}$ at 145 MHz. We also explore the X-ray surface brightness/radio spectral index correlation, finding a slope of $b = 0.59^{+0.11}_{-0.11}$. Both investigations support the evidence of spectral steepening. Finally, in the context of understanding the particle acceleration mechanism, we present a simple theoretical model which demonstrates that hybrid scenarios – secondary electrons (re-)accelerated by turbulence – reproduce a superlinear correlation slope.

79 ASTRONOMY AND ASTROPHYSICS↗

Single-shot ionization-based monitor for pulsed electron beams

In this work, we present an experimental demonstration of a single-shot, nondestructive electron beam diagnostic based on the ionization of a low-density pulsed gas jet. In our study, 7 MeV electron bunches from a radio-frequency photoinjector, carrying up to 100 pC of charge, traversed a localized distribution of nitrogen gas (N 2 ). The interaction of the electron bunches with the N 2 gas generated a correlated signature in the ionized particle distribution, which was spatially magnified using a series of electrostatic lenses and recorded with a microchannel-plate detector. Various modalities, including point-to-point imaging and velocity mapping, are investigated. A temporal trace of the detector current enabled the identification of single- and double-ionization events. The characteristics of the ionization distribution, dependence on gas density, total bunch charge, and other parameters, are described. Approaches to scaling to higher electron bunch density and energy are suggested. Additionally, the instrument proves useful for comprehensive studies of the ionization process itself.

47 OTHER INSTRUMENTATION↗

How Bayesian methods can improve R -matrix analyses of data: The example of the d t reaction

The 3 H(d, n) 4 He reaction is of significant interest in nuclear astrophysics and nuclear applications. It is an important, early step in big-bang nucleosynthesis and a key process in nuclear fusion reactors. We use one- and two-level R-matrix approximations to analyze data on the cross section for this reaction at center-of-mass energies below 215 keV. We critically examine the data sets using a Bayesian statistical model that allows for both common-mode and additional point-to-point un- certainties. We use Markov Chain Monte Carlo sampling to evaluate this R-matrix-plus-statistical model and find two-level R-matrix results that are stable with respect to variations in the channel radii. The S factor at 40 keV evaluates to 25.36(19) MeV b (68% credibility interval). We discuss our Bayesian analysis in detail and provide guidance for future applications of Bayesian methods to R-matrix analyses. We also discuss possible paths to further reduction of the S-factor uncertainty.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Diaboloidal mirrors: algebraic solution and surface shape approximations

A new type of optical element that can focus a cylindrical wave to a point focus (or vice versa) is analytically described. Such waves are, for example, produced in a beamline where light is collimated in one direction and then doubly focused by a single optic. A classical example in X-ray optics is the collimated two-crystal monochromator, with toroidal mirror refocusing. The element here replaces the toroid, and in such a system provides completely aberration free, point-to-point imaging of rays from the on-axis source point. We present an analytic solution for the mirror shape in its laboratory coordinate system with zero slope at the centre, and approximate solutions, based on bending an oblique circular cone and a bent right circular cylinder, that may facilitate fabrication and metrology.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Derivation of closed-form ellipsoidal X-ray mirror shapes from Fermat's principle

Ellipsoidal and plane-elliptical surfaces are widely used as reflective, point-to-point focusing elements in many optical systems, including X-ray optics. Here the classical optical path function approach of Fermat is applied to derive a closed-form expression for these surfaces that are uniquely described by the object and image distances and the angle of incidence at a point on a mirror surface. A compact description facilitates design, modeling, fabrication, and testing to arbitrary accuracy. Congruent surfaces in two useful coordinate systems — a system centered on the ellipsoid's axes of symmetry and a mirror-centered or `vertex' system with the surface tangent to the xy plane at the mirror's center — are presented. Expressions for the local slope and radii of curvature are derived from the result, and the first several terms of the Maclauren series expansion are provided about the mirror center.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Experimental Validation of a 40kW, 480V Point-to-Point DC Interlinks for Controller-Agnostic, Interoperable Networked Microgrids

This paper presents the experimental validation of point-to-point dc-interlinks for interconnecting two solar-based, laboratory-scale AC microgrids. DC interlinks provide a solution to numerous technical and operational challenges encountered in networked microgrids, including precise power flow control, stable and fast synchronization, enhanced stability, and improved voltage and frequency regulation. By decoupling microgrids through power converters, dc-interlinks enable power exchange among microgrids that can be owned by different entities (such as communities, utilities, or universities) and managed by diverse microgrid controller vendors. This characteristic makes this dc-interlinks a promising solution for networking real-world microgrids. The presented point-to-point dc interlink utilizes two four-quadrant converters: a 40kW 3-phase ac/dc regulating the dc-link voltage to 800V, and a 3-phase dc/ac controlling power flow. These converters, connected via a 20-foot dc cable, interconnect two ac microgrids operating at 480V, each featuring energy storage, photovoltaic generation, and load emulation. Experimental validation employs commercially available off-the-shelf (COTS) converters and real-world data from solar-powered microgrids in Adjuntas, Puerto Rico. To the authors’ knowledge, this work provides the first at-scale experimental validation of dc-interlinks for networked ac microgrids using COTS inverters, demonstrating their practicality and effectiveness in addressing real-world operational challenges.

Ferrari Maglia, Max [ORNL]↗

Physical Layer Security at a Point-to-Point MIMO System With 1-Bit DACs and ADCs

Low-resolution converters reduce the power consumption of wireless devices and help enable large energy-efficient arrays. In this letter, we evaluate the secrecy rate for the extreme case of 1-bit single-user multiple-input multiple-output systems following two signaling approaches. In the first method, the system uses discrete signaling. In the second, the system combines Gaussian signaling with artificial noise alongside power allocation. In the first case, we give a closed-form expression of the secrecy rate and propose an algorithm that provides near-optimal results for low signal-to-noise ratios (SNRs). Further, in the second scenario, depending on the channel state information, we suggest different precoding plans and derive a secrecy rate lower bound. At low SNR, power is allocated to the main signal. Only at high SNR is optimal power allocation effective. Moreover, knowing the eavesdropper channel greatly improves the system’s secrecy.

1-bit digital-to-analog (DAC) and analog-to-digita↗

Image Gradient Decomposition for Parallel and Memory-Efficient Ptychographic Reconstruction

Ptychography is a popular microscopic imaging modality for many scientific discoveries and sets the record for highest image resolution. Unfortunately, the high image resolution for ptychographic reconstruction requires significant amount of memory and computations, forcing many applications to compromise their image resolution in exchange for a smaller memory footprint and a shorter reconstruction time. In this paper, we propose a novel image gradient decomposition method that significantly reduces the memory footprint for ptychographic reconstruction by tessellating image gradients and diffraction measurements into tiles. In addition, we propose a parallel image gradient decomposition method that enables asynchronous point-to-point communications and parallel pipelining with minimal overhead on a large number of GPUs. Our experiments on a Titanate material dataset (PbTiO3) with 16632 probe locations show that our Gradient Decomposition algorithm reduces memory footprint by 51 times. In addition, it achieves time-to-solution within 2.2 minutes by scaling to 4158 GPUs with a super-linear strong scaling efficiency at 364% compared to runtimes at 6 GPUs. This performance is 2.7 times more memory efficient, 9 times more scalable and 86 times faster than the state-of-the-art algorithm.

Wang, Xiao↗

Load Profile Inpainting for Missing Load Data Restoration and Baseline Estimation

This paper introduces a Generative Adversarial Nets (GAN) based, Load Profile Inpainting Network (Load-PIN) for restoring missing load data segments and estimating the baseline for a demand response event. The inputs are time series load data before and after the inpainting period together with explanatory variables (e.g., weather data). Here, we propose a Generator structure consisting of a coarse network and a fine-tuning network. The coarse network provides an initial estimation of the data segment in the inpainting period. The fine-tuning network consists of self-attention blocks and gated convolution layers for adjusting the initial estimations. Loss functions are specially designed for the fine-tuning and the discriminator networks to enhance both the point-to-point accuracy and realisticness of the results. We test the Load-PIN on three real-world data sets for two applications: patching missing data and deriving baselines of conservation voltage reduction (CVR) events. We benchmark the performance of Load-PIN with five existing deep-learning methods. Our simulation results show that, compared with the state-of-the-art methods, Load-PIN can handle varying-length missing data events and achieve 15-30% accuracy improvement.

14 SOLAR ENERGY↗

Performance Analysis and Optimal Node-aware Communication for Enlarged Conjugate Gradient Methods

Krylov methods are a key way of solving large sparse linear systems of equations but suffer from poor strong scalability on distributed memory machines. Furthermore, this is due to high synchronization costs from large numbers of collective communication calls alongside a low computational workload. Enlarged Krylov methods address this issue by decreasing the total iterations to convergence, an artifact of splitting the initial residual and resulting in operations on block vectors. In this article, we present a performance study of an enlarged Krylov method, Enlarged Conjugate Gradients (ECG), noting the impact of block vectors on parallel performance at scale. Most notably, we observe the increased overhead of point-to-point communication as a result of denser messages in the sparse matrix-block vector multiplication kernel. Additionally, we present models to analyze expected performance of ECG, as well as motivate design decisions. Most importantly, we introduce a new point-to-point communication approach based on node-aware communication techniques that increases efficiency of the method at scale.

97 MATHEMATICS AND COMPUTING↗

Optimizing Irregular Communication with Neighborhood Collectives and Locality-Aware Parallelism

Irregular communication often limits both the performance and scalability of parallel applications. Typically, applications individually implement irregular communication as point-to-point, and any optimizations are integrated directly into the application. As a result, these optimizations lack portability. It is difficult to optimize point-to-point messages within MPI, as the interface for single messages provides no information on the collection of all communication to be performed. However, the persistent neighbor collective API, released in the MPI 4 standard, provides an interface for portable optimizations of irregular communication within MPI libraries. This paper presents methods for implementing existing optimizations for irregular communication within neighborhood collectives, analyzes the impact of replacing point-to-point communication in existing codebases such as Hypre BoomerAMG with neighborhood collectives, and finally shows up to a 1.38x speedup on sparse matrix-vector multiplication communication within a BoomerAMG solve through the use of our optimized neighbor collectives. Here, the authors analyze three implementations of persistent neighborhood collectives for Alltoallv: an unoptimized wrapper of standard point-to-point communication, and two locality-aware aggregating methods. The second locality-aware implementation exposes an non-standard interface to perform additional optimization, and the authors present the additional 0.07x speedup from the extended interface. All optimizations are available in an open-source codebase, MPI Advance, which sits on top of MPI, allowing for optimizations to be added into existing codebases regardless of the system MPI install.

AMG↗

A Reference Implementation for a Quantum Message Passing Interface

Practical applications of quantum computing are currently limited by the number of qubits that can be set with reasonable fidelities for each system. Therefore, a distributed quantum computing system with multiple quantum computers coherently connected is highly demanding. To realize the internode communication of quantum information, the software interface, Quantum Message Passing Interface (QMPI), leveraging the framework built for classical MPI but taking advantage of quantum teleportation to communicate between different quantum nodes was proposed. In this project, we develop the QMPI with point-to-point and collective operations in Qiskit and characterize its performance by demonstrating the application implementations. Moreover, we developed a new technique for optimizing collective communication of the distributed quantum programs with Multi-Controlled Toffoli gates. This technique beats the state-of-the-art in terms of fidelity and the number of remote EPR pairs consumed in both simulations and experiments.

Shi, Yue↗

RingX: Scalable Parallel Attention for Long-Context Learning on HPC

The attention mechanism has become foundational for remarkable AI breakthroughs since the introduction of the Transformer, driving the demand for increasingly longer context to power frontier models such as large-scale reasoning language models and high-resolution image/video generators. However, its quadratic computational and memory complexities present substantial challenges. Current state-of-the-art parallel attention methods, such as ring attention, are widely adopted for long-context training but utilize a point-to-point communication strategy that fails to fully exploit the capabilities of modern HPC network architectures. In this work, we propose ringX, a scalable family of parallel attention methods optimized explicitly for HPC systems. By enhancing workload partitioning, refining communication patterns, and improving load balancing, ringX achieves up to 3.4 × speedup compared to conventional ring attention on the Frontier supercomputer. Optimized for both bi-directional and causal attention mechanisms, ringX demonstrates its effectiveness through training benchmarks of a Vision Transformer (ViT) on a climate dataset and a Generative Pre-Trained Transformer (GPT) model, Llama3 8B. Our method attains an end-to-end training speedup of approximately 1.5 × in both scenarios. To our knowledge, the achieved 38% model FLOPs utilization (MFU) for training Llama3 8B with a 1M-token sequence length on 4,096 GPUs represents one of the highest training efficiencies reported for long-context learning on HPC systems. Our code implementation is available at https://github.com/jqyin/ringX-attention.

Yin, Junqi [ORNL] (ORCID:0000000338435520)↗

SoS-SDQN: System of Systems Software-defined Quantum Networking

Quantum networks are needed for quantum domain applications that may run across different network deployments - point-to-point, multi-node networks, and possibly across inter-domain quantum networks, like the quantum internet. Unlike classical computing networks, quantum networks involve heterogeneous systems nodes that currently require local and manual control. This needs a unified control approach to help them integrate, work seamlessly, and have global knowledge. Software-defined Networking (SDN) has been successfully leveraged in classical networking for seamless and software-driven control of network infrastructure and packet switching, but not in management of quantum network applications across heterogeneous systems. In this paper, we review the current state of the art and present early developments of a System-of-Systems Software-defined Quantum Networking architecture (SoS-SDQN), a generic architecture that supports software-driven quantum network experiments across heterogeneous quantum systems. The architecture modifies the generic SDN to address the domain requirements of quantum networks and proposes a multilevel SDQN to provide a global view of network status, running applications, and control of incorporated heterogeneous quantum systems. We also design and implement a SoS SouthBound Quantum Interface (SoS-SBQI), a quantum infrastructure protocol that abstracts automation of applications across the network.

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

Deep Lynx: Digital Engineering Integration Hub

The construction of megaprojects has consistently demonstrated challenges for project managers in regard to meeting cost, schedule, and performance requirements. Megaproject construction challenges are common place within megaprojects with many active projects in the United States failing to meet cost and schedule efforts by significant margins. Currently, engineering teams operate in siloed tools and disparate teams where connections across design, procurement, and construction systems are translated manually or over brittle point-to-point integrations. The manual nature of data exchange increases the risk of silent errors in the reactor design, with each silent error cascading across the design. These cascading errors lead to uncontrollable risk during construction, resulting in significant delays and cost overruns. Deep Lynx allows for an integrated platform during design and operations of mega projects.

Darrington, JohnW↗

Phloem

Phloem is a Message Passing Interface (MPI) micro-benchmarking suite featuring sub-communicator collectives, methods for finding slow links on MPI interconnects, and point-to-point MPI benchmarks, including a messaging rate benchmark. All of the benchmarks except for ones related exclusively to finding slow links are GPU-aware via the Umpire resource management library.

Moody, AdamT [Lawrence Livermore National Laborato↗