Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed architecture”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 667 records · Page 37

Nested Microgrids for Increased Grid Resiliency

The article presents a control and communication architecture for interconnecting multiple microgrids by leveraging IEC 61850 data models with distributed energy resources (DER) extensions, IEC Common Information Model (CIM) and Open Field Message Bus (OpenFMB) frameworks. An example use case for planned islanding in the nested microgrid scenario is also provided.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Influence of fiber architecture on the elastic an d inelastic response of metal matrix composites

This three part paper focuses on the effect of fiber architecture (i.e., shape and distribution) on the elastic and inelastic response of metal matrix composites. The first part provides an annotative survey of the literature, presented as a historical perspective, dealing with the effects of fiber shape and distribution on the response of advanced polymeric matrix and metal matrix composites. Previous investigations dealing with both continuously and discontinuously reinforced composites are included. A summary of the state-of-the-art will assist in defining new directions in this quickly reviving area of research. The second part outlines a recently developed analytical micromechanics model that is particularly well suited for studying the influence of these effects on the response of metal matrix composites. This micromechanics model, referred to as the generalized method of cells (GMC), is capable of predicting the overall, inelastic behavior of unidirectional, multi-phased composites given the properties of the constituents. In particular, the model is sufficiently general to predict the response of unidirectional composites reinforced by either continuous or discontinuous fibers with different inclusion shapes and spatial arrangements in the presence of either perfect or imperfect interfaces and/or interfacial layers. Recent developments regarding this promising model, as well as directions for future enhancements of the model's predictive capability, are included. Finally, the third pan provides qualitative results generated using GMC for a representative titanium matix composite system, SCS-6/TlMETAL 21S. Results are presented that correctly demonstrate the relative effects of fiber arrangement and shape on the longitudinal and transverse stress-strain and creep response, with both strong and weak fiber/matrix interfacial bonds. The fiber arrangements include square, square diagonal, hexagonal and rectangular periodic arrays, as well as a random array. The fiber shapes include circular, square and cross-shaped cross sections. The effect of fiber volume fraction on the observed stress-strain response is also discussed, as the thus-far poorly documented strain rate sensitivity effect. In addition to the well documented features of architecture dependent response of continuously reinforced two-phase MMC's, new results involving continuous multi-phase internal architectures are presented. Specifically, stress strain and creep response of composites with different size fibers having different internal arrangements and bond strengths are investigated with the aim of determining the feasibility of using this approach to enhance the transverse toughness and creep resistance of TMC's.

Arnold, Steven M.↗

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗

HTR-1.3 solver: Predicting electrified combustion using the hypersonic task-based research solver

Here this manuscript presents an updated open-source version of the Hypersonics Task-based Research (HTR) solver. The solver, whose main features are presented in Di Renzo et al. (2020) and Di Renzo & Pirozzoli (2021), is designed for direct numerical simulation of reacting flows at high Reynolds numbers. This new version extends the applications of the HTR solver to turbulent combustion in the presence of external electric fields. In particular, a new distributed Poisson solver compatible with heterogeneous architectures has been incorporated in the algorithm to compute the electric potential distribution in bi-periodic configurations. The drift fluxes of the electrically charged species are now included in the transport equations using a targeted essentially non-oscillatory scheme. A verification of these new features of the solver is provided using one-dimensional burner stabilized flames, whereas a three dimensional turbulent flame is utilized to discuss the scalability of the proposed numerical tool.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

R&D studies of the ATLAS LAr calorimeter readout electronics for super-LHC

The ATLAS Liquid Argon (LAr) calorimeters are high precision, high sensitivity and high granularity detectors. A total of 182,468 signals are digitized and processed real-time on detector, to provide energy and time deposited in each detector element at every occurrence of the L1-trigger. The current readout electronics will need to be upgraded to sustain the higher radiation levels expected with the increase of a factor 10 in luminosity at the LHC in the years {approx}2017. A completely innovative readout scheme is being developed. The front-end readout will send out data continuously at each bunch crossing through high speed radiation resistant optical links, the data will be processed real-time with the possibility of implementing trigger algorithms. This article is an overview of the R&D activities and architectural studies the ATLAS LAr Calorimeter Group is developing: front-end analog and mixed-signal ASIC design, radiation resistance optical-links in SOS, high-speed back-end processing units based on FPGA architectures and power supply distribution schemes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Novel Toxin Biosynthetic Gene Cluster in Harmful Algal Bloom-Causing Heteroscytonema crispum : Insights into the Origins of Paralytic Shellfish Toxins

Caused by both eukaryotic dinoflagellates and prokaryotic cyanobacteria, harmful algal blooms are events of severe ecological, economic, and public health consequence, and their incidence has become more common of late. Despite coordinated research efforts to identify and characterize the genomes of harmful algal bloom-causing organisms, the genomic basis and evolutionary origins of paralytic shellfish toxins produced by harmful algal blooms remain at best incomplete. The paralytic shellfish toxin saxitoxin has an especially complex genomic architecture and enigmatic phylogenetic distribution, spanning dinoflagellates and multiple cyanobacterial genera. Using filtration and extraction techniques to target the desired cyanobacteria from nonaxenic culture, coupled with a combination of short- and long-read sequencing, we generated a reference-quality hybrid genome assembly for Heteroscytonema crispum UTEX LB 1556, a freshwater, paralytic shellfish toxin-producing cyanobacterium thought to have the largest known genome in its phylum. We report a complete, novel biosynthetic gene cluster for the paralytic shellfish toxin saxitoxin. Leveraging this biosynthetic gene cluster, we find support for the hypothesis that paralytic shellfish toxin production has appeared in divergent Cyanobacteria lineages through widespread and repeated horizontal gene transfer. This work demonstrates the utility of long-read sequencing and metagenomic assembly toward advancing our understanding of paralytic shellfish toxin biosynthetic gene cluster diversity and suggests a mechanism for the origin of paralytic shellfish toxin biosynthetic genes.

59 BASIC BIOLOGICAL SCIENCES↗

MassiveGNN: Efficient Training via Prefetching for Massively Connected Distributed Graphs

Graph Neural Networks (GNN) are indispensable in learning from graph-structured data, yet their rising computational costs, especially on massively connected graphs, pose significant challenges in terms of execution performance. To tackle this, distributed-memory solutions such as partitioning the graph to concurrently train multiple replicas of GNNs are in practice. However, approaches requiring a partitioned graph usually suffer from communication overhead and load imbalance, even under optimal partitioning and communication strategies due to irregularities in the neighborhood minibatch sampling. This paper proposes practical trade-offs for improving the sampling and communication overheads for representation learn- ing on distributed graphs (using popular GraphSAGE architecture) by developing a parameterized prefetch and eviction scheme on top of the state-of-the-art Amazon DistDGL distributed GNN framework, demonstrating about 15–40% improvement in end-to-end training performance on the NERSC Perlmutter supercomputer for various OGB datasets.

Machine Leanring, high performance comptuing, grap↗

Real-Time Control and Operation for a Flexible Microgrid with Dynamic Boundary

To better utilize the existing electric power grid distribution network automation of smart switches, a microgrid can expand or shrink its electrical boundary according to available renewable generation. Previous literature only focused on the design of a microgrid with a dynamic boundary, but without considering real-time operation. This paper proposes a microgrid controller that enables operation of microgrid with dynamic boundary and can be integrated into the existing distribution automation system. The architecture of the control system is introduced, and the essential functions such as online topology assessment and synchronization are presented. Simulation results are given to demonstrate the feasibility of the proposed controller.

Ma, Yiwei↗

Distributed-memory Parallel Algorithms for Matching and Coloring

Graph matching and coloring constitute two fundamental classes of combinatorial problems having numerous established as well as emerging applications in computational science and engineering, high-performance computing, and informatics. We provide a snapshot of an on-going work on the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical problems from these classes, edge-weighted matching and distance-1 vertex coloring. Graph algorithms in general have low concurrency and poor data locality, making it challenging to achieve scalability on massively parallel machines. We overcome this challenge by employing a variety of techniques, including approximation, speculation and iteration, optimized communication, and randomization, in concert. We present preliminary results on weak and strong scalability studies conducted on an IBM Blue Gene/P machine employing up to tens of thousands of processors. The results show that the algorithms hold strong potential for computing at petascale.

Combinatorial scientific computing↗

A Hierarchical Multi-Agent Based Anomaly Detection for Wide-Area Protection in Smart Grid

Future smart grid capabilities provide assurance to expand the advanced information and communication technologies to evolve into densely interconnected cyber physical system. Remedial Action Scheme (RAS), widely used for wide-area protection, relies on the interconnected networks and data sharing devices, which are exposed to the multitude of vulnerabilities. This paper presents our proposed approach to developing multi-agent based RAS scheme against the system-aware stealthy cyber-attacks. Specifically, we propose the two-level hierarchical architecture which consists of distributed local RAS controllers (RAScs) as local agents, operating at different zones/ areas, which are constantly monitored by an overseer, the central agent. The local controllers receive local and randomly changing outside zonal measurements and cyclically forwards to the overseer. The overseer identifies the corrupted controller using the anomaly detection algorithm which processes the measurements coming from the local controllers, compute measurement errors using local and outside zonal measurements, perform validation checks, and finally detect anomalies based on the two-step verification. Next, as a proof of concept, we have implemented and validated the proposed methodology in cyber physical environment at Iowa State’s PowerCyber testbed. We have also implemented the coordinated attack vectors which involve corrupting the local controller and later performing stealthy attacks on the system’s generator. We have evaluated its performance during the online testing in terms of detection rate and Iatency. The experimental results show that it is efficient in detecting different classes of attacks, including ramp and pulse attacks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

FiberFlex: Real-time FPGA-based Intelligent and Distributed Fiber Sensor System for Pedestrian Recognition

In recent years, security monitoring of public places and critical infrastructure has heavily relied on the widespread use of cameras, raising concerns about personal privacy violations. To balance the need for effective security monitoring with the protection of personal privacy, we explore the potential of optical fiber sensors for this application. This article proposes FiberFlex, an intelligent and distributed fiber sensor system. Ultizing Field Programmable Gate Arrays (FPGA) high-level synthesis (HLS) acceleration, FiberFlex offers real-time pedestrian detection by co-designing the entire pipeline of optical signal acquisition, processing, and recognition networks based on the principles of optical fiber sensing. As a promising alternative to traditional camera-based monitoring systems, FiberFlex achieves pedestrian detection by analyzing the vibration patterns caused by pedestrian footsteps, enabling security monitoring while preserving individual privacy. FiberFlex comprises three modules: First , fiber-optic sensing system: A fiber-optic distributed acoustic sensing (DAS) system is built and used to measure the ground vibration waves generated by people walking. Second , algorithms: We first collect the training data by measuring the ground vibration waves, label the data, and use the data to train the neural network models to perform pedestrian recognition. Third , hardware accelerators: We use HLS tools to design hardware modules on FPGA for data collection and pre-processing and integrate them with the downstream neural network accelerators to perform in-line real-time pedestrian detection. The final detection results are sent back from FPGA to the host CPU. We implement our system FiberFlex with the in-house built DAS system and AMD/Xilinx Kintex7 FPGA KC705 board and verify the whole system using the real-world collected data. We conduct recognition tests on five test subjects of varying ages, heights, and weights in a fixed sensing area. Each subject experienced 20 real-time recognition tests using their daily walking habits, and the subjects were given adequate rest between tests. After 100 tests on five test subjects, the overall real-time recognition accuracy exceeded \(88.0\%\) . The whole system uses 55 W of power, 33 W in the optical DAS system and 22 W in the FPGA. Relying on its end-to-end interdisciplinary design, FiberFlex seamlessly combines fiber-optic sensors with FPGA accelerators to enable low-power real-time security monitoring without compromising privacy, making it a valuable addition to the existing security monitoring network. According to FiberFlex, more valuable research can be conducted in the future, such as fall monitoring for the elderly, migration of identification networks between different application scenarios, and improvement of anti-interference performance in more complex environments. In future perception networks, where the “eyes” are not feasible, let’s use fiber optic touch instead.

Distributed↗

Cabana

Physics simulations that use particles in their algorithms are ubiquitous on modern high performance computers. Cabana is a C++ library for developing particle-based simulations on heterogeneous high performance computing platforms. Cabana provides general data structures and algorithms for common particle operations in a way that is both performant and portable on HPC systems. This includes particle data structure allocatable and configurable on GPU and CPU architectures, and threaded and distributed algorithms for sorting particles, halo exchanges, neighbor list generation, and other basic particle operations.

Slattery, StuartR↗

Joint Genome Institute Analysis Workflow Service (JAWS) v2.7

The U.S. Department of Energy Joint Genome Institute (JGI) has developed the JGI Analysis Workflow Service (JAWS) as a distributed framework to run computational workflows across diverse high-performance computing (HPC) and cloud environments. JAWS enhances the reusability, scalability, and robustness of scientific workflows by orchestrating data movement, code execution, and results retrieval across multiple DOE facilities. At its core, JAWS integrates the Cromwell workflow engine to run workflows expressed in the Workflow Description Language (WDL), ensuring portability and interoperability. To provide consistent runtime environments, JAWS employs container technologies such as Shifter, Apptainer, and Docker. Workflow tasks are managed via HTCondor on HPC backends, while Globus ensures secure and efficient data transfer between sites. JAWS is deployed as a multi-site workflow manager across national laboratory computing facilities, with dedicated instances supporting community projects such as the National Microbiome Data Collaborative (NMDC) and KBase. This distributed, service-oriented architecture enables users to "write once, run anywhere," providing scalable, production-quality workflow execution.

Kirton, Edward↗

Incentive-Based Control and Coordination of Distributed Energy Resources

Higher penetration of renewable generation will increase the demand for adequate (and cost-effective) controllable resources on the grid that can mitigate and contain contingencies locally before they cause a network-wide collapse. This report details a scalable hierarchical control strategy for coordinating a vast number of heterogeneous distributed energy resources (DERs) in order to provide three ancillary grid services: frequency response, regulation, and ramping reserve. The control architecture consists of 1) a Distribution Reliability Coordinator (DRC), which allocates resource responses based on their declared flexibility, 2) aggregator controllers, which control a collection of DERs, and finally, 3) DER controllers at the individual devices. Test results are provided showing scalable performance on thousands of simulated residential DERs (air conditioners and water heaters) as well as results of a hardware-in-the-loop demonstration of commercial HVAC and microgrid equipment providing real responses in coordination with a grid simulation. Technology commercialization barriers and strategy is also discussed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hybrid Quantum Networks with Discrete Polarizations and Continuous Quadrature Variables

Final Scientific/Technical Report for DOE Project DE-SC0022069. Quantum communication and computation systems have evolved along two largely independent paradigms: discrete-variable (DV) systems that encode information in qubits such as photon polarizations or photon-number states, and continuous-variable (CV) systems that encode information in optical field quadratures. Each approach offers distinct advantages—DVs provide low error rates and compatibility with single-photon platforms, while CVs support deterministic operations and efficient quantum state manipulation. A fundamental challenge for building a scalable Quantum Internet lies in interfacing these two regimes into a unified hybrid architecture that can coherently distribute and process quantum information across heterogeneous quantum nodes. This project aims to develop and demonstrate a hybrid optical quantum network that seamlessly integrates DV and CV systems. Specifically, we investigate a new class of hybrid entanglement between the discrete polarizations of single photons and the continuous quadrature variables of optical cat states, overcoming incompatibilities in existing DV–CV demonstrations. Using this new entanglement resource, the team investigates a multi-node hybrid quantum local area network (Q-LAN) testbed capable of DV–CV entanglement generation, swapping, and distribution across fiber links.

74 ATOMIC AND MOLECULAR PHYSICS↗

Carbon-Based Quantum Information Science with Symmetry Protected Topological States (Final Report, DOE-BES award DE-SC0023105)

This research program established the scientific foundation for the rational, bottom-up design, synthesis, isolation, and investigation of symmetry-protected topological (SPT) electron spin qubits embedded in graphene nanoribbons (GNRs). The work focused on integrating atomically precise low-dimensional carbon nanostructures with emerging quantum logic architectures, providing a pathway toward scalable quantum materials for next-generation computing and sensing technologies. A central component of the program was the elucidation of fundamental relationships between real-space molecular architecture, local spin density distributions, electronic band dispersion, and energy level alignment in atomically precise GNR systems. These correlations define key operational parameters of SPT qubits and were systematically investigated to establish quantitative benchmarks against established molecular and solid-state spin qubit platforms. Attention was given to properties critical for quantum device performance, e.g. decoherence times, spectral sharpness of energy transitions, and tunable exchange interactions between spin states. The research demonstrated that these parameters can be engineered with atomic precision through scalable bottom-up synthetic strategies. Theory-guided design played a central role in identifying candidate structures hosting topologically protected spin states. Experimental validation was performed using both ensemble measurements and single-molecule characterization. In addition to advances in quantum materials synthesis, the program developed and applied spin-sensitive scanning probe microscopy techniques capable of directly probing quantum states and dynamic processes with atomic-scale spatial resolution. These capabilities enabled direct observation and characterization of quantum structures at the single-atom level. While the research activities were primarily hypothesis-driven fundamental investigations, the program adopted a comprehensive materials-by-design framework aimed at translating scientific discoveries into technological concepts compatible with scalable and intelligent manufacturing approaches.

36 MATERIALS SCIENCE↗

Space station data system analysis/architecture study. Task 2: Options development, DR-5. Volume 2: Design options

The primary objective of Task 2 is the development of an information base that will support the conduct of trade studies and provide sufficient data to make key design/programmatic decisions. This includes: (1) the establishment of option categories that are most likely to influence Space Station Data System (SSDS) definition; (2) the identification of preferred options in each category; and (3) the characterization of these options with respect to performance attributes, constraints, cost and risk. This volume contains the options development for the design category. This category comprises alternative structures, configurations and techniques that can be used to develop designs that are responsive to the SSDS requirements. The specific areas discussed are software, including data base management and distributed operating systems; system architecture, including fault tolerance and system growth/automation/autonomy and system interfaces; time management; and system security/privacy. Also discussed are space communications and local area networking.

Source record↗

Semi-automatic process partitioning for parallel computation

On current multiprocessor architectures one must carefully distribute data in memory in order to achieve high performance. Process partitioning is the operation of rewriting an algorithm as a collection of tasks, each operating primarily on its own portion of the data, to carry out the computation in parallel. A semi-automatic approach to process partitioning is considered in which the compiler, guided by advice from the user, automatically transforms programs into such an interacting task system. This approach is illustrated with a picture processing example written in BLAZE, which is transformed into a task system maximizing locality of memory reference.

Koelbel, Charles↗