SEARCH · Engineering Papers

Results for “synchronous machine”

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.

SourceResearch connectionFrom yearThrough year

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

At least 163 records · Page 9

All sources NASA NTRS DOE OSTI

NASA NTRS1990

Automated synthesis of sequence invariant state machines

A computer aided design (CAD) tool for the design of very large scale integration (VLSI) synchronous sequential controllers is presented. Both the design and layout of the state machine are automatically generated. The program is process independent allowing a choice of design rules to base generation upon. An incremental layout creation approach was implemented which makes the tool useful in a wide range of layout applications. Flow table descriptions are input to characterize the desired machine and a layout archive is output.

Buehler, D.↗

DOE OSTI2024

Dynamic Shaping of Grid Response of Multi-Machine Multi-Inverter Systems Through Grid-Forming IBRs

We consider the problem of controlling the frequency response of weakly-coupled multi-machine multi-inverter low-inertia power systems via grid-forming inverter-based resources (IBRs). In contrast to existing methods, our approach relies on dividing the larger system into multiple strongly-coupled subsystems, without ignoring either the underlying network or approximating the subsystem response as an aggregate harmonic mean model. Rather, through a structured clustering and recursive dynamic shaping approach, the frequency response of the overall system to load perturbations is shaped appropriately. We demonstrate the proposed approach for a three-node triangular configuration and a small-scale radial network. Furthermore, previous synchronization analysis for heterogeneous systems requires the machines to satisfy certain proportionality property. In our approach, the effective transfer functions for each cluster can be tuned by the IBRs to satisfy such property, enabling us to apply the shaping control to systems with a wider range of heterogeneous machines.

frequency-shaping control↗

NASA NTRS1992

Approximation methods for stochastic petri nets

Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay equivalence often fails to converge, while flow equivalent aggregation can lead to potentially bad results if a strong dependence of the mean completion time on the interarrival process exists.

Jungnitz, Hauke Joerg↗

DOE OSTI2024

Errant Beam Prognostics with Machine Leaning at SNS Accelerator

Particle Accelerators are complex machine with many pieces of equipment running in synchronization to deliver required beam. However, faults in particle accelerators reduce the availability of the beam for experiments affecting the overall science output. To avoid these faults, we apply anomaly detection techniques to predict any unusual behavior and perform preemptive actions to improve the total availability. Many researchers have adopted semi-supervised Machine Learning (ML) methods such as auto-encoders and variational auto-encoders for such tasks. However, supervised ML techniques designed for similarity learning such as Siamese Neural Network (SNN) can outperform semi-supervised or unsupervised methods for anomaly prediction. One of the challenges associated with application of ML models to particle accelerators is the variability in observed data over time due to system configuration changes. We employ conditional models such as Conditional Siamese Neural Networks (CSNN), and Conditional-VAE (CVAE) to learn the variability in the data by using beam configuration parameters as conditional input. We apply these models for errant beam prediction at Spallation Neutron Source accelerator under different system configurations and compare their performance. We demonstrate that CSNN outperforms CVAE in our application. This talk will present the data source, collection, analysis, data-preparation, model development, hyper-parameter studies and the results.

Rajput, Kishansingh↗

DOE OSTI2023

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↗

NASA NTRS1988

Problems in characterizing barrier performance

The barrier is a synchronization construct which is useful in separating a parallel program into parallel sections which are executed in sequence. The completion of a barrier requires cooperation among all executing processes. This requirement not only introduces the wait for the slowest process delay which is inherent in the definition of the synchronization, but also has implications for the efficient implementation and measurement of barrier performance in different systems. Types of barrier implementation and their relationship to different multiprocessor environments are described. Then the problem of measuring the performance of barrier implementations on specific machine architecture is discussed. The fact that the barrier synchronization requires the cooperation of all processes makes the problem of performance measurement similarly global. Making non-intrusive measurements of sufficient accuracy can be tricky on systems offering only rudimentary measurement tools.

Jordan, Harry F.↗

DOE OSTI2026

RealisticSensors

An Unreal Engine 5 plugin for generating synchronized, timestamped multi-modal sensor data for machine learning and robotics applications.

Greenwood, Scott↗

NASA NTRS1986

The force on the flex: Global parallelism and portability

A parallel programming methodology, called the force, supports the construction of programs to be executed in parallel by an unspecified, but potentially large, number of processes. The methodology was originally developed on a pipelined, shared memory multiprocessor, the Denelcor HEP, and embodies the primitive operations of the force in a set of macros which expand into multiprocessor Fortran code. A small set of primitives is sufficient to write large parallel programs, and the system has been used to produce 10,000 line programs in computational fluid dynamics. The level of complexity of the force primitives is intermediate. It is high enough to mask detailed architectural differences between multiprocessors but low enough to give the user control over performance. The system is being ported to a medium scale multiprocessor, the Flex/32, which is a 20 processor system with a mixture of shared and local memory. Memory organization and the type of processor synchronization supported by the hardware on the two machines lead to some differences in efficient implementations of the force primitives, but the user interface remains the same. An initial implementation was done by retargeting the macros to Flexible Computer Corporation's ConCurrent C language. Subsequently, the macros were caused to directly produce the system calls which form the basis for ConCurrent C. The implementation of the Fortran based system is in step with Flexible Computer Corporations's implementation of a Fortran system in the parallel environment.

Jordan, H. F.↗

NASA NTRS1991

Field Telemetry of Blade-rotor Coupled Torsional Vibration at Matuura Power Station Number 1 Unit

The quasi-modal reduction technique and finite element model (FEM) were used to construct an analytical model for the blade-rotor coupled torsional vibration of a steam turbine generator of the Matuura Power Station. A single rotor test was executed in order to evaluate umbrella vibration characteristics. Based on the single rotor test results and the quasi-modal procedure, the total rotor system was analyzed to predict coupled torsional frequencies. Finally, field measurement of the vibration of the last stage buckets was made, which confirmed that the double synchronous resonance was 124.2 Hz, meaning that the machine can be safely operated. The measured eigen values are very close to the predicted value. The single rotor test and this analytical procedure thus proved to be a valid technique to estimate coupled torsional vibration.

Isii, Kuniyoshi↗

DOE OSTI2024

Event Detection and Classification Using Machine Learning Applied to PMU Data for the Western US Power System

Smart grid technology enhances our comprehension and reliability of the power grid, leveraging Phasor Measurement Unit (PMU) data—time-synchronized, high-frequency measurements gathered across the US power grid. This paper employs machine learning techniques to effectively analyze the vast PMU data in Wide Area Monitoring Systems (WAMS) for power grid event detection and classification. Analyzing several months of real-world PMU data, the paper focuses on machine learning for fast, precise event detection and classification, corroborated by utility event logs. Practical challenges like feature extraction, dimensionality reduction, and model selection are addressed. A novel feature yielding improved results is discovered, and a supplementary algorithm for detecting small power grid faults is developed. The final algorithm is validated using a month-long real PMU data set, demonstrating its capability in accurately identifying power grid events in near real-time.

machine learning, event detection, PMU↗

DOE OSTI2023

Beyond 15 MW: A cost of energy perspective on the next generation of drivetrain technologies for offshore wind turbines

Leading wind turbine manufacturers are racing to build larger and more powerful offshore machines. Drivetrain configurations often use a permanent-magnet synchronous generator (PMSG), in either a direct-drive configuration or coupled to a gearbox. With increasing demand for critical rare-earth magnets, new generator technologies are emerging to ensure a stable and secure supply chain. We evaluate three different topologies of radial flux synchronous generators employing high field magnets with reduced or no rare-earth content: a direct-drive interior PMSG (DD-IPMSG), a geared drivetrain combining a medium speed gearbox with a PMSG (MS-PMSG), and a direct-drive low-temperature superconducting generator (DD-LTSG). We develop a conceptual design module for each of these technologies within a larger framework for full turbine design. This provides the fairest comparison between technologies at nominal power ratings from 15-25 MW, which represent the next generation of offshore wind turbines. The analyses show that if operational expenditures (OpEx) are constant across the technologies, MS-PMSG results in the lowest LCOE with reductions of up to 7% relative to DD-IPMSG. DD-LTSG also yields lower LCOE values by 2%-3% for fixed-bottom turbines and 3%-5% with a floating platform. However, results are sensitive to OpEx assumptions, with a mere 10% increase causing the conclusions to shift.

17 WIND ENERGY↗

DOE OSTI2023

A Comparison of Generator Technologies for Offshore Wind Turbines

Leading wind turbine manufacturers are racing to build larger and more powerful offshore machines. Drivetrain configurations often use a permanent-magnet synchronous generator (PMSG), in either a direct-drive configuration or coupled to a gearbox. With increasing demand for critical rare-earth magnets, new generator technologies are emerging to ensure a stable and secure supply chain. We evaluate three different topologies of radial flux synchronous generators employing high field magnets with reduced or no rare-earth content: a direct-drive interior PMSG (DD-IPMSG), a geared drivetrain combining a medium speed gearbox with a PMSG (MS-PMSG), and a direct-drive low-temperature superconducting generator (DD-LTSG). We develop a conceptual design module for each of these technologies within a larger framework for full turbine design. This provides the fairest comparison between technologies at nominal power ratings from 15-25MW, which represent the next generation of offshore wind turbines. The analyses show that if operational expenditures (OpEx) are constant across the technologies, MS-PMSG results in the lowest LCOE with reductions of up to 7% relative to DD-IPMSG. DD-LTSG also yields lower LCOE values by 2-3% for fixed-bottom turbines and 3-5% with a floating platform. However, results are sensitive to OpEx assumptions, with a mere 10% increase causing the conclusions to shift.

direct drive↗

DOE OSTI2020

Accelerating Parallel Applications in Cloud Platforms via Adaptive Time-Slice Control

Cloud platforms can provide flexible and cost-effective environments for parallel applications. However, the resource over-commitment issues, i.e., cloud providers often provide much more executable virtual CPUs than available physical CPUs, still impede the synchronization operations of parallel applications, causing severe performance degradation. Existing methods optimize parallel applications by promoting the priorities of involved VMs. They cannot fully explore the performance of parallel applications, because they ignore the time-slice requirements of different phases of parallel applications. Furthermore, non-parallel applications experience unsatisfied performance because of low scheduling priorities. Given empirical analysis on time-slices of virtual machines (VMs), we find that shortening time-slices can mitigate synchronization overhead which incurs during communication phases, while over-short time-slices cause frequent cache misses in computation phases. Accordingly, we propose an Adaptive Time-slice Control (ATC) mechanism. ATC first detects the phases of parallel applications based on lock latency or cache misses. Then, ATC shortens time-slices during communication phases and prolongs time-slices during computation phases for parallel applications, and sets a uniform time-slice for non-parallel applications. Finally, we evaluate ATC using seven well-known benchmarks with 25+ applications. Experiments show that ATC obtains 1.5-75x performance gain for running parallel applications than state-of-the-art solutions, with nearly unaffected impact on non-parallel applications.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Event Cause Analysis in Distribution Networks using Synchro Waveform Measurements

This paper presents a machine learning method for event cause analysis to enhance situational awareness in distribution networks. The data streams are captured using time-synchronized high sampling rates synchro waveform measurement units (SWMU). The proposed method is formulated based on a machine learning method, the convolutional neural network (CNN). This method is capable of capturing the spatiotemporal feature of the measurements effectively and perform the event cause analysis. Several events are considered in this paper to encompass a range of possible events in real distribution networks, including capacitor bank switching, transformer energization, fault, and high impedance fault (HIF). The dataset for our study is generated using the real time digital simulator (RTDS) to simulate real-world events. The event cause analysis is performed using only one cycle of the voltage waveforms after the event is detected. The simulation results show the effectiveness of the proposed machine learning-based method compared to the state-of-the-art classifiers.

Niazazari, Iman↗

DOE OSTI2022

Improved Line Outage Detection in Transmission Systems with Few PMUs

Unlike transmission systems, distribution systems historically lack enough measurements, making their real-time monitoring almost impossible. Recent deployment of diverse types of devices such as phasor measurement units (PMUs), smart meters, solar inverters and weather information sensors opens up new ways of monitoring these systems, with the assistance of customized machine learning (ML) applications. The paper describes a grid-model-informed machine learning (ML) tool which integrates heterogeneous data streams and creates synchronous measurement snapshots to be used by a hybrid robust state estimator (SE) which provides not only accurate state estimates but also real-time feedback for ML model refinement. Improved monitoring performance due to the use of developed computational framework is experimentally observed by simulated scenarios on an electric utility’s distribution system.

Distribution systems, graph learning, machine lear↗

NASA NTRS1995

Communication overhead on the Intel Paragon, IBM SP2 and Meiko CS-2

Interprocessor communication overhead is a crucial measure of the power of parallel computing systems-its impact can severely limit the performance of parallel programs. This report presents measurements of communication overhead on three contemporary commercial multicomputer systems: the Intel Paragon, the IBM SP2 and the Meiko CS-2. In each case the time to communicate between processors is presented as a function of message length. The time for global synchronization and memory access is discussed. The performance of these machines in emulating hypercubes and executing random pairwise exchanges is also investigated. It is shown that the interprocessor communication time depends heavily on the specific communication pattern required. These observations contradict the commonly held belief that communication overhead on contemporary machines is independent of the placement of tasks on processors. The information presented in this report permits the evaluation of the efficiency of parallel algorithm implementations against standard baselines.

Bokhari, Shahid H.↗

DOE OSTI2022

First direct observations of gear-changing in a collider

In this work we perform the first demonstration of gear-changing in a real world collider. Gear-changing refers to a collision scheme where each ring of a collider stores a different harmonic number of bunches. These bunches are kept synchronized using different velocities. Such a system has been theorized, but has now been demonstrated using the Double ElectroStatic Ion Ring ExpEriment (DESIREE) in Stockholm Sweden. The experiment was able to demonstrate a gear-changing system, with both four on three bunches and five on four bunches. We determined a measurable parameter that shows a gear-changing system out to $37500$ turns of the slow beam (1 second). We were also able to detect a measurable longitudinal beam-beam interaction. We developed insights into how to control this type of system, opening up new possibilities, and showing that DESIREE can be used for gear-changing research.

43 PARTICLE ACCELERATORS↗

NASA NTRS1993

Parallel-vector out-of-core equation solver for computational mechanics

A parallel/vector out-of-core equation solver is developed for shared-memory computers, such as the Cray Y-MP machine. The input/ output (I/O) time is reduced by using the a synchronous BUFFER IN and BUFFER OUT, which can be executed simultaneously with the CPU instructions. The parallel and vector capability provided by the supercomputers is also exploited to enhance the performance. Numerical applications in large-scale structural analysis are given to demonstrate the efficiency of the present out-of-core solver.

Qin, J.↗