Search NASA⌕ Search

SEARCH · Search NASA

Results for “Synchronous machines”

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 415 records · Page 23

Shaft mode shape demonstration

The dynamic response of a rotating machine is directly influenced by its geometric configuration and all aspects of the rotor construction. These determine two significant parameters, mass distribution and stiffness, which yield a spectrum of natural frequencies and mode shapes. The mode shapes can be presented as snapshots of the characteristic amplitude/phase reponse patterns of the shaft, due to the major forcing function of unbalance, at different rotative speeds. To demonstrate the three shaft mode shapes of the rotor rig using the Shaft Mode Demonstrator and oscilloscopes. The synchronous (1X) amplitude and phase of the rotor vibration in the vertical direction from several points along the shaft is displayed on corresponding points of the demonstrator. Unfiltered vibration from vertical and horizontal probe pairs is displayed on the oscilloscopes in orbit format for a dynamic presentation of the mode shape.

Grissom, R.↗

Design and Analysis of a 25 MWe Supercritical CO2 Turbo Machine

This paper presents the design and analysis of a turbo machine operating with supercritical carbon dioxide (sCO2) in a 25 MWe Recompression Brayton Cycle (RCBC). The work was performed under US Department of Energy (DoE) program DE-EE-0010318. The design process involves the aerodynamic design of the compressor and turbine, including the initial layout of flowpaths and stage configurations to achieve high efficiency and performance. Additionally, a comprehensive rotodynamic analysis is performed to ensure the stability and reliability of the system. Conceptual designs for a high-speed motor and synchronous generator that match turbomachinery requirements are also developed from first principles.

42 ENGINEERING↗

Design and Analysis of the Staggered Double Grating Slow Wave Circuit for 263 GHz Sheet Beam TWT

The complete design process of a high-frequency circuit for a 263 GHz staggered double grating, sheet beam traveling wave tube is presented in this article. Here, this device, for use in a pulsed electron paramagnetic resonance spectrometer instrument, requires >30 dB gain and a 20 GHz bandwidth centered at 263 GHz. In addition to the standard Pierce gain analysis and point by point particle in cell (PIC) simulation, a novel fast pulse response analysis technique was utilized to determine the accurate synchronization voltage and test the ``hot” feature of the high-frequency circuit. Since this new method can evaluate the entire bandwidth in a single simulation, it can significantly reduce the computational resources normally required for the conventional PIC analysis while also illustrating the potential instabilities near the band edge. Good agreement between the fast pulse response and PIC simulation results validate the accuracy of this novel method. According to the analysis results and given the manufacturing limits of nano/micro-computer numerical control (CNC) machining, an appropriate SWS, coupler, and sever designs were chosen to complement the simulated design. Finally, a prototype circuit was manufactured and cold tested to verify the design and inspect the machining tolerances.

42 ENGINEERING↗

GridSTIX

SF-25-112 Grid-STIX is a comprehensive extension of the STIX (Structured Threat Information Expression) 2.1 ontology specifically designed for electrical grid cybersecurity applications. This ontology provides a standardized, machine-readable framework for modeling grid assets, operational technology devices, threats, vulnerabilities, supply chain risks, and security relationships in electrical power systems. ## Key Features - **Comprehensive Grid Coverage**: Physical assets, OT devices, grid components, sensors, and energy storage systems - **Zero Trust Architecture**: Policy decision points, enforcement points, trust brokers, and continuous monitoring - **AMI Infrastructure**: Advanced metering networks, head-end systems, mesh gateways, and MDM systems - **Advanced Security Modeling**: Attack patterns, vulnerabilities, mitigations, and supply chain risks - **Critical Grid Relationships**: Power flow, protection, control, and synchronization relationships - **Supply Chain Security**: Supplier modeling, country of origin tracking, and risk assessment - **Protocol Support**: DNP3, Modbus, IEC 61850, IEC 60870-5-104, OPC-UA, and IEEE standards - **Python Code Generation**: Automated STIX-compliant Python class generation from ontologies - **Interactive Visualization**: Enhanced HTML network graphs with grid-specific categorization - **STIX 2.1 Compliance**: Full compatibility with STIX threat intelligence ecosystem

Blakely, Benjamin [Argonne National Laboratory (AN↗

Machine-checked proofs of the design and implementation of a fault-tolerant circuit

A formally verified implementation of the 'oral messages' algorithm of Pease, Shostak, and Lamport is described. An abstract implementation of the algorithm is verified to achieve interactive consistency in the presence of faults. This abstract characterization is then mapped down to a hardware level implementation which inherits the fault-tolerant characteristics of the abstract version. All steps in the proof were checked with the Boyer-Moore theorem prover. A significant results is the demonstration of a fault-tolerant device that is formally specified and whose implementation is proved correct with respect to this specification. A significant simplifying assumption is that the redundant processors behave synchronously. A mechanically checked proof that the oral messages algorithm is 'optimal' in the sense that no algorithm which achieves agreement via similar message passing can tolerate a larger proportion of faulty processor is also described.

Bevier, William R.↗

Electromechanical Mode Online Estimation using Regularized Robust RLS Methods

This paper proposes a regularized robust recursive least square (R3LS) method for on-line estimation of power-system electromechanical modes based on synchronized phasor measurement unit (PMU) data. The proposed method utilizes an autoregressive moving average exogenous (ARMAX) model to account for typical measurement data, which includes low-level pseudo-random probing, ambient, and ringdown data. A robust objective function is utilized to reduce the negative influence from non-typical data, which include outliers and missing data. A dynamic regularization method is introduced to help include a priori knowledge about the system and reduce the influence of under-determined problems. Based on a 17-machine simulation model, it is shown through the Monte-Carlo method that the proposed R3LS method can estimate and track electromechani-cal modes by effectively using combined typical and non-typical measurement data.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Electromechanical Mode On-line Estimation using Regularized Robust RLS Methods

This paper proposes a regularized robust recursive least squares (R3LS) method for on-line estimation of power-system electromechanical modes based on synchronized phasor measurement unit (PMU) data. The proposed method utilizes an autoregressive moving average exogenous (ARMAX) model to account for typical measurement data, which includes low-level pseudo-random probing, ambient, and ringdown data. A robust objective function is utilized to reduce the negative influence from non-typical data, which include outliers and missing data. A dy-namic regularization method is introduced to help include a priori knowledge about the system and reduce the influence of under-determined problems. Based on a 17-machine simulation model, it is shown through the Monte-Carlo method that the proposed R3LS method can estimate and track electromechanical modes by effectively using combined typical and non-typical measurement data.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Choosing a software design method for real-time Ada applications: JSD process inversion as a means to tailor a design specification to the performance requirements and target machine

The validity of real-time software is determined by its ability to execute on a computer within the time constraints of the physical system it is modeling. In many applications the time constraints are so critical that the details of process scheduling are elevated to the requirements analysis phase of the software development cycle. It is not uncommon to find specifications for a real-time cyclic executive program included to assumed in such requirements. It was found that prelininary designs structured around this implementation abscure the data flow of the real world system that is modeled and that it is consequently difficult and costly to maintain, update and reuse the resulting software. A cyclic executive is a software component that schedules and implicitly synchronizes the real-time software through periodic and repetitive subroutine calls. Therefore a design method is sought that allows the deferral of process scheduling to the later stages of design. The appropriate scheduling paradigm must be chosen given the performance constraints, the largest environment and the software's lifecycle. The concept of process inversion is explored with respect to the cyclic executive.

Withey, James V.↗

A Big Data Approach to Analyzing Market Volatility

Understanding the microstructure of the financial market requires the processing of a vast amount of data related to individual trades, and sometimes even multiple levels of quotes. Analyzing such a large volume of data requires tremendous computing power that is not easily available to financial academics and regulators. Fortunately, public funded High Performance Computing (HPC) power is widely available at the National Laboratories in the US. In this paper we demonstrate that the HPC resource and the techniques for data-intensive sciences can be used to greatly accelerate the computation of an early warning indicator called Volume-synchronized Probability of Informed trading (VPIN). The test data used in this study contains five and a half year's worth of trading data for about 100 most liquid futures contracts, includes about 3 billion trades, and takes 140GB as text files. By using (1) a more efficient file format for storing the trading records, (2) more effective data structures and algorithms, and (3) parallelizing the computations, we are able to explore 16,000 different ways of computing VPIN in less than 20 hours on a 32-core IBM DataPlex machine. Our test demonstrates that a modest computer is sufficient to monitor a vast number of trading activities in real-time – an ability that could be valuable to regulators. Our test results also confirm that VPIN is a strong predictor of liquidity-induced volatility. With appropriate parameter choices, the false positive rates are about 7% averaged over all the futures contracts in the test data set. More specifically, when VPIN values rise above a threshold (CDF > 0.99), the volatility in the subsequent time windows is higher than the average in 93% of the cases.

97 MATHEMATICS AND COMPUTING↗

A customizable data management framework for high-repetition-rate high-energy-density science

The high-energy-density (HED) physics community is moving toward a new paradigm of high-repetition-rate (HRR) operation. To fully leverage the scientific power of HRR HED facilities, all of the components of each subsystem (laser, targetry, and performance diagnostics) must be connected and synchronized in a reliable and robust manner while the data acquired are tagged and archived in real time. To this end, GA has begun developing a generalized NoSQL-database framework, the MongoDB repository for information and archiving. An organizational strategy has been developed that shifts HED data organization from a shot-based to a diagnostic-based approach in order to increase archival and retrieval efficiency that lends itself to optimization applications. This work is a first step in pushing HRR HED science toward data management solutions that emphasize machine actionability and aim to stimulate community engagement to define data standards in HED science.

Instruments & Instrumentation↗

Flexible Peripheral Component Interconnect Input/Output Card

The Flexible Peripheral Component Interconnect (PCI) Input/Output (I/O) Card is an innovative circuit board that provides functionality to interface between a variety of devices. It supports user-defined interrupts for interface synchronization, tracks system faults and failures, and includes checksum and parity evaluation of interface data. The card supports up to 16 channels of high-speed, half-duplex, low-voltage digital signaling (LVDS) serial data, and can interface combinations of serial and parallel devices. Placement of a processor within the field programmable gate array (FPGA) controls an embedded application with links to host memory over its PCI bus. The FPGA also provides protocol stacking and quick digital signal processor (DSP) functions to improve host performance. Hardware timers, counters, state machines, and other glue logic support interface communications. The Flexible PCI I/O Card provides an interface for a variety of dissimilar computer systems, featuring direct memory access functionality. The card has the following attributes: 8/16/32-bit, 33-MHz PCI r2.2 compliance, Configurable for universal 3.3V/5V interface slots, PCI interface based on PLX Technology's PCI9056 ASIC, General-use 512K 16 SDRAM memory, General-use 1M 16 Flash memory, FPGA with 3K to 56K logical cells with embedded 27K to 198K bits RAM, I/O interface: 32-channel LVDS differential transceivers configured in eight, 4-bit banks; signaling rates to 200 MHz per channel, Common SCSI-3, 68-pin interface connector.

Bigelow, Kirk K.↗

Runtime Performance and Virtual Network Control Alternatives in VM-Based High-Fidelity Network Simulations

In prior work (Yoginath and Perumalla, 2011; Yoginath, Perumalla and Henz, 2012), the motivation, challenges and issues were articulated in favor of virtual time ordering of Virtual Machines (VMs) in network simulations hosted on multi-core machines. Two major components in the overall virtualization challenge are (1) virtual timeline establishment and scheduling of VMs, and (2) virtualization of inter-VM communication. Here, we extend prior work by presenting scaling results for the first component, with experiment results on up to 128 VMs scheduled in virtual time order on a single 12-core host. We also explore the solution space of design alternatives for the second component, and present performance results from a multi-threaded, multi-queue implementation of inter-VM network control for synchronized execution with VM scheduling, incorporated in our NetWarp simulation system.

Yoginath, Srikanth B↗

High-Level Synthesis of Parallel Specifications Coupling Static and Dynamic Controllers

The increased need for efficient ways to implement domain-specific accelerators is driving design methodologies towards the use of abstractions higher than the Register Transfer Level (RTL). In this scenario, High Level Synthesis (HLS) plays a significant role by enabling the automatic generation of custom hardware accelerators starting from high level descriptions (e.g., C code). Conventional HLS tools exploit parallelism mostly at the Instruction Level (ILP). They statically schedule the input specifications, and build centralized Finite State Machine (FSM) controllers. However, aggressive exploitation of ILP in many applications has diminishing returns and, usually, centralized approaches do not efficiently exploit coarser parallelism because FSMs are inherently serial. In this paper we present a HLS framework able to synthesize applications that, beside ILP, also expose Task Level Parallelism (TLP). An application can expose TLP through annotations that identify the parallel functions (i.e., tasks). To generate accelerators that efficiently execute concur- rent tasks, we need to solve several issues: devise a mechanism to support concurrent execution flows, exploit memory parallelism, and manage synchronization. To support concurrent execution flows, we introduce a novel adaptive controller. The adaptive controller is composed of a set of interacting control elements that independently manage the execution of a single operation or function call. These control elements check dependencies and resource constraints at runtime, enabling as soon as possible execution. To support parallel access to shared memories and synchronization, we introduce a novel Hierarchical Memory Interface (HMI). With respect to previous solutions, the proposed interface supports multi-ported memories and atomic memory operations, which commonly occur in parallel programming. Our framework can generate the hardware implementation of C functions by employing two different approaches, depending on its characteristics. If a function exposes TLP, then the framework generates hardware implementations based on the adaptive controller. Otherwise, the framework implements the function by exploiting a more conventional FSM approach, which is optimized for ILP exploitation. We evaluate our framework on a set of parallel applications, and show substantial performance improvements (average speedup of 4.7) with limited area over- heads (average area increase of 5.48 times).

Castellana, Vito G.↗

High-Level Synthesis of Parallel Specifications Coupling Static and Dynamic Controllers

The increased need for efficient ways to implement domain-specific accelerators is driving design methodologies towards the use of abstractions higher than the Register Transfer Level (RTL). In this scenario, High Level Synthesis (HLS) plays a significant role by enabling the automatic generation of custom hardware accelerators starting from high level descriptions (e.g., C code). Conventional HLS tools exploit parallelism mostly at the Instruction Level (ILP). They statically schedule the input specifications, and build centralized Finite State Machine (FSM) controllers. However, aggressive exploitation of ILP in many applications has diminishing returns and, usually, centralized approaches do not efficiently exploit coarser parallelism because FSMs are inherently serial. In this paper we present a HLS framework able to synthesize applications that, beside ILP, also expose Task Level Parallelism (TLP). An application can expose TLP through annotations that identify the parallel functions (i.e., tasks). To generate accelerators that efficiently execute concur- rent tasks, we need to solve several issues: devise a mechanism to support concurrent execution flows, exploit memory parallelism, and manage synchronization. To support concurrent execution flows, we introduce a novel adaptive controller. The adaptive controller is composed of a set of interacting control elements that independently manage the execution of a single operation or function call. These control elements check dependencies and resource constraints at runtime, enabling as soon as possible execution. To support parallel access to shared memories and synchronization, we introduce a novel Hierarchical Memory Interface (HMI). With respect to previous solutions, the proposed interface supports multi-ported memories and atomic memory operations, which commonly occur in parallel programming. Our framework can generate the hardware implementation of C functions by employing two different approaches, depending on its characteristics. If a function exposes TLP, then the framework generates hardware implementations based on the adaptive controller. Otherwise, the framework implements the function by exploiting a more conventional FSM approach, which is optimized for ILP exploitation. We evaluate our framework on a set of parallel applications, and show substantial performance improvements (average speedup of 4.7) with limited area over- heads (average area increase of 5.48 times).

Castellana, Vito G.↗

Identifying Potential Sub-Synchronous Oscillations Using Impedance Scan Approach: Preprint

This paper presents an impedance scan study on the real-world power system in Australia that has observed 17 to 20 Hz intermittent subsynchronous oscillations. Through the impedance scan of each of the IBRs, both individually and collectively, potential resonance modes are identified. The impedance scans were carried out using electromagnetic transient PSCAD models of the network. The network comprises of site-specific, black-boxed models of IBRs supplied by the generators. The impedance scan approach was divided in three major steps: (1) the first step is to identify IBRs where impedance analysis needs to be performed based on the magnitude of oscillations observed at their points of interconnection (POIs); (2) the second step focuses on performing impedance scans at selected IBRs in single-machine infinite-bus (SMIB) configuration to identify internal resonance modes of an IBR and to evaluate if any of these modes become unstable under certain grid conditions; (3) the third step performs impedance scans at a few selected IBRs while connected to the wider network model to obtain the impedance response of both the IBR and the grid - this step evaluates control interactions among IBRs. The impedance scan study found that a few IBRs have an underdamped resonance mode at around 17 Hz, which becomes unstable under a certain operating condition. Another interesting finding was that certain IBRs increase the effective grid impedance seen by another IBR in proximity for a particular operating condition. Under this operating condition, the resulting subsynchronous oscillation mode is more pronounced due to a combination of control interactions among IBRs through the transmission network under study and a resonance mode inside the IBRs.

control interactions↗

Virtual sensing-enabled digital twin framework for real-time monitoring of nuclear systems leveraging deep neural operators

Abstract Real-time monitoring is a foundation of nuclear digital twin technology, crucial for detecting material degradation and maintaining nuclear system integrity. Traditional physical sensor systems face limitations, particularly in measuring critical parameters in hard-to-reach or harsh environments, often resulting in incomplete data coverage. Machine learning-driven virtual sensors offer a transformative solution by complementing physical sensors in monitoring critical degradation indicators. This paper introduces the use of Deep Operator Networks (DeepONet) to predict key thermal-hydraulic parameters in the hot leg of pressurized water reactor. DeepONet acts as a virtual sensor, mapping operational inputs to spatially distributed system behaviors without requiring frequent retraining. Our results show that DeepONet achieves low mean squared and Relative L2 error, making predictions 1400 times faster than traditional CFD simulations . These characteristics enable DeepONet to function as a real-time virtual sensor, synchronizing with the physical system to track degradation conditions and provide insights within the digital twin framework for nuclear systems.

Hossain, Raisa↗

Software Synthesis for High Productivity Exascale Computing

Over the three years of our project, we accomplished three key milestones: We demonstrated how ideas from generative programming and software synthesis can help support the development of bulk-synchronous distributed memory kernels. These ideas are realized in a new language called MSL, a C-like language that combines synthesis features with high level notations for array manipulation and bulk-synchronous parallelism to simplify the semantic analysis required for synthesis. We also demonstrated that these high level notations map easily to low level C code and show that the performance of this generated code matches that of handwritten Fortran. Second, we introduced the idea of solver-aided domain-specific languages (SDSLs), which are an emerging class of computer-aided programming systems. SDSLs ease the construction of programs by automating tasks such as verification, debugging, synthesis, and non-deterministic execution. SDSLs are implemented by translating the DSL program into logical constraints. Next, we developed a symbolic virtual machine called Rosette, which simplifies the construction of such SDSLs and their compilers. We have used Rosette to build SynthCL, a subset of OpenCL that supports synthesis. Third, we developed novel numeric algorithms that move as little data as possible, either between levels of a memory hierarchy or between parallel processors over a network. We achieved progress in three aspects of this problem. First we determined lower bounds on communication. Second, we compared these lower bounds to widely used versions of these algorithms, and noted that these widely used algorithms usually communicate asymptotically more than is necessary. Third, we identified or invented new algorithms for most linear algebra problems that do attain these lower bounds, and demonstrated large speed-ups in theory and practice.

97 MATHEMATICS AND COMPUTING↗

An Adaptive Memory Interface Controller for Improving Bandwidth Utilization of Hybrid and Reconfigurable Systems

Emerging applications such as data mining, bioinformatics, knowledge discovery, social network analysis are irregular. They use data structures based on pointers or linked lists, such as graphs, unbalanced trees or unstructures grids, which generates unpredictable memory accesses. These data structures usually are large, but difficult to partition. These applications mostly are memory bandwidth bounded and have high synchronization intensity. However, they also have large amounts of inherent dynamic parallelism, because they potentially perform a task for each one of the element they are exploring. Several efforts are looking at accelerating these applications on hybrid architectures, which integrate general purpose processors with reconfigurable devices. Some solutions, which demonstrated significant speedups, include custom-hand tuned accelerators or even full processor architectures on the reconfigurable logic. In this paper we present an approach for the automatic synthesis of accelerators from C, targeted at irregular applications. In contrast to typical High Level Synthesis paradigms, which construct a centralized Finite State Machine, our approach generates dynamically scheduled hardware components. While parallelism exploitation in typical HLS-generated accelerators is usually bound within a single execution flow, our solution allows concurrently running multiple execution flow, thus also exploiting the coarser grain task parallelism of irregular applications. Our approach supports multiple, multi-ported and distributed memories, and atomic memory operations. Its main objective is parallelizing as many memory operations as possible, independently from their execution time, to maximize the memory bandwidth utilization. This significantly differs from current HLS flows, which usually consider a single memory port and require precise scheduling of memory operations. A key innovation of our approach is the generation of a memory interface controller, which dynamically maps concurrent memory accesses to multiple ports. We present a case study on a typical irregular kernel, Graph Breadth First search (BFS), exploring different tradeoffs in terms of parallelism and number of memories.

BFS↗