Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel system”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Dynamic Equivalence of Large-Scale Power Systems Based on Boundary Measurements

Parallel computing helped speed up many tasks that can be done independently. The advance in gaming industry did not produce a technology that helps the power industry to reduce the computation time for dynamic simulation in individual cases. To perform faster than real-time simulation for the purpose of predicting power system dynamic trajectory, power industry continues to struggle to reduce the system size and simulation time of large-scale power systems while keeping its dynamic behavior under various disturbances. There is also an acute need for real-time dynamic model reduction as more renewables enter the generation mix with dramatic changes in the generation outputs. All existing model reduction solutions are based on having access to a detailed dynamic model of the system. The system changes by the minutes, dynamic models are only updated annually. To solve this problem, wide-area measurements obtained by the phasor measurement unit (PMU) at the boundaries between the reduced system and the study system is used to represent the external area. An artificial neuro-fuzzy inference system (ANFIS) is established to perform the mapping of the measurement to the external equivalent model. Here the external area is regarded as a black-box. Model reduction studies are conducted on the Northeast Power Coordinating Council (NPCC) under various types of contingencies, by using a co-simulation approach between PSS/E and MATLAB. The results look very promising and will be discussed in this paper.

Tong, Ning↗
DOE OSTI2025

A study on dc fault handling of dc-dc converter based on series and parallel connected DABs in MVdc applications

With the increase of direct current (dc) based power generating stations and loads, multi-terminal medium voltage dc (MT-MVdc) systems are gaining popularity. The dc sources and loads are interfaced with the MT-MVdc systems using series and parallel connected dual-active-bridge (SP-DAB). In this paper, the dc fault ride through procedure of SP-DAB meant for MT-MVdc application is analyzed. The need for dc breaker (DCB) under the requirements of MT-MVdc is established through EMT simulation studies. It is shown that an additional dc filter capacitor is essential at the output terminals of the SP-DAB to ride through the dc faults.

Jaldanki, Sreenivasa [ORNL] (ORCID:000000028122322↗
DOE OSTI2021

The LSBmax algorithm for boosting resilience of electric grids post (N‐2) contingencies

Abstract A computationally improved algorithm is presented to find the best transmission switching (TS) candidate for boosting resilience of electricity grids subject to ( N ‐2) contingencies. Here, resilience is computed as the reduction in load shed after the above‐mentioned ( N‐ ) contingencies. TS is a planned line outage, and past research shows that changing the transmission system's topology changes the power flow and removes post contingency violations. Finding the best TS candidate in a computationally suitable time for effectively boosting resilience is a challenge. The best TS candidate is found using a novel heuristic method by decreasing the search space based on proximity to the bus with the maximum load shedding (LSB). The LSB algorithm is faster than existing algorithms in the literature; and, it is compatible with both the AC and DC optimal power flow formulations. To validate the authors' claims of speedup and accuracy, two metrics are used to analyze the results from the IEEE 39‐bus and 118‐bus systems. Finally, the inherent parallelism of the LSB algorithm is leveraged on a high‐performance computing platform and applied to the large‐scale Polish 2383‐bus test system to validate scalability in both size and speedup in computation time.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Single classical field description of interacting scalar fields

In this report we test the degree to which interacting Bosonic systems can be approximated by a classical field as total occupation number is increased. This is done with our publicly available code repository, QIBS, a new massively parallel solver for these systems. We use a number of toy models well studied in the literature and track when the classical field description admits quantum corrections, called the quantum breaktime. This allows us to test claims in the literature regarding the rate of convergence of these systems to the classical evolution. We test a number of initial conditions, including coherent states, number eigenstates, and field number states. We find that of these initial conditions, only number eigenstates do not converge to the classical evolution as occupation number is increased. We find that systems most similar to scalar field dark matter exhibit a logarithmic enhancement in the quantum breaktime with total occupation number. Systems with contact interactions or with field number state initial conditions, and linear dispersions, exhibit a power law enhancement. Finally, we find that the breaktime scaling depends on both model interactions and initial conditions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Three practical workflow schedulers for easy maximum parallelism

Runtime scheduling and workflow systems are an increasingly popular algorithmic component in HPC because they allow full system utilization with relaxed synchronization requirements. There are so many special-purpose tools for task scheduling, one might wonder why more are needed. Use cases seen on the Summit supercomputer needed better integration with MPI and greater flexibility in job launch configurations. Preparation, execution, and analysis of computational chemistry simulations at the scale of tens of thousands of processors revealed three distinct workflow patterns. A separate job scheduler was implemented for each one using extremely simple and robust designs: file-based, task-list based, and bulk-synchronous. Comparing to existing methods shows unique benefits of this work, including simplicity of design, suitability for HPC centers, short startup time, and well-understood per-task overhead. All three new tools have been shown to scale to full utilization of Summit, and have been made publicly available with tests and documentation. This work presents a complete characterization of the minimum effective task granularity for efficient scheduler usage scenarios. Here, these schedulers have the same bottlenecks, and hence similar task granularities as those reported for existing tools following comparable paradigms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Grid-Forming and Grid-Following Inverter Comparison of Droop Response

With the increase in penetration of inverter-based resources (IBRs) in the electrical power system, the ability of these devices to provide grid support to the system has become a necessity. With standards previously developed for the interconnection requirements of grid-following inverters (GFLI) (most commonly photovoltaic inverters), it has been well documented how these inverters “should” respond to changes in voltage and frequency. However, with other IBRs such as grid-forming inverters (GFMIs) (used for energy storage systems, standalone systems, and as uninterruptable power supplies) these requirements are either: not yet documented, or require a more in deep analysis. With the increased interest in microgrids, GFMIs that can be paralleled onto a distribution system have become desired. With the proper control schemes, a GFMI can help maintain grid stability through fast response compared to rotating machines. This paper will present an experimental comparison of commercially available GFMI and GFLI ' responses to voltage and frequency deviation, as well as the GFMI operating as a standalone system and subjected to various changes in loads.

Grid Support, Inverter, Droop Control, Volt-VAR, F↗
DOE OSTI2020

Current possibilities and future opportunities for erasure coded computations

The key capability established through the research funded by this award are erasure coded computations for linear systems, in serial and in parallel. This capability enables powerful efficient and scalable alternatives to existing linear system solvers in fault-prone computational systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Review of hybrid HVDC systems combining line communicated converter and voltage source converter

Hybrid HVDC system, which consists of the advantages of line commutated converter (LCC) and voltage source converter (VSC), is an emerging power transmission system. This paper presents a review of four LCC-VSC hybrid HVDC topologies. The first topology is the pole-hybrid HVDC system, in which the LCC and VSC form the positive- and negative-pole respectively. The second one is the terminal-hybrid HVDC system; in this topology one terminal adopts LCC and the other terminal adopts VSC. The series converter-hybrid HVDC system is the third topology wherein each terminal is formed by LCC and VSC in series. The fourth hybrid topology under consideration is a parallel converter-hybrid HVDC system with LCC and VSC connected in parallel in each terminal. Here, the main contribution of this paper is a comprehensive analysis and comparison of the four mentioned hybrid topologies in terms of PQ operating zone, power flow reversal method, and DC fault ride-through strategy.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Control and Simulation of a Grid-Forming Inverter for Hybrid PV-Battery Plants in Power System Black Start

Power system restoration is an important part of system planning. Power utilities are required to maintain black start capable generators that can energize the transmission system and provide cranking power to non-blackstart capable generators. Traditionally, hydro and diesel units are used as black start capable generators. With the increased penetration of bulk size solar farms, inverter based generation can play an important role in faster and parallel black start thus ensuring system can be brought back into service without the conventional delays that can be expected with limited black start generators. Inverter-based photovoltaic (PV) power plants have advantages that are suitable for black start. This paper proposes the modeling, control, and simulation of a grid-forming inverter-based PV-battery power plant that can be used as a black start unit. The inverter control includes both primary and secondary control loops to imitate the control of a conventional synchronous machine. The proposed approach is verified using a test system modified from the IEEE 9-bus system in the time-domain electromagnetic transient simulation tool PSCAD. The simulation results shows voltage and frequency stability during a multi-step black-start and network energization process.

Nguyen, Quan H.↗
DOE OSTI2024

Enabling Low-Overhead HT-HPC Workflows at Extreme Scale using GNU Parallel

GNU Parallel is a versatile and powerful tool for process parallelization widely used in scientific computing. This paper demonstrates its effective application in high-performance computing (HPC) environments, particularly focusing on its scalability and efficiency in executing large-scale high-throughput high-performance computing (HT-HPC) workflows. Through real-world examples, we highlight GNU Parallel’s performance across various HPC workloads, including GPU computing, container-based workloads, and node-local NVMe storage. Our results on two leading supercomputers, OLCF’s Frontier and NERSC’s Perlmutter, showcase GNU Parallel’s rapid process dispatching ability and its capacity to maintain low overhead even at extreme scales. We explore GNU Parallel’s application in massive parallel file transfers using a scheduled Data Transfer Node (DTN) cluster, emphasizing its broad utility in diverse scientific workflows. Beyond its direct application as a viable workflow manager, GNU Parallel can be employed in conjunction with other workflow systems as a "last-mile" parallelizing driver and as a quick prototyping tool to design and extract parallel profiles from application executions. We then argue that the potential for GNU Parallel to transform workflow management at extreme scales is substantial, paving the way for more efficient and effective scientific discoveries.

Maheshwari, Ketan↗
DOE OSTI2021

System and method for shingling wafer strips connected in parallel

A solar device includes a first string of first solar wafers, wherein a plurality of the first solar wafers each overlap with at least one vertically adjacent solar wafer from the first string. Additionally, the solar device includes a second string of second solar wafers, wherein a plurality of the second solar wafers each overlap with at least one vertically adjacent solar wafer from the second string, wherein a plurality of the first solar wafers overlap with one or more of the plurality of second solar wafers to electrically connect horizontally adjacent solar wafers in parallel.

Caswell, Nathaniel Alexis↗
DOE OSTI2023

System and method for shingling wafer strips connected in parallel

A solar device includes a first string of first solar wafers, wherein a plurality of the first solar wafers each overlap with at least one vertically adjacent solar wafer from the first string. Additionally, the solar device includes a second string of second solar wafers, wherein a plurality of the second solar wafers each overlap with at least one vertically adjacent solar wafer from the second string, wherein a plurality of the first solar wafers overlap with one or more of the plurality of second solar wafers to electrically connect horizontally adjacent solar wafers in parallel.

Caswell, Nathaniel↗
DOE OSTI2020

How fast can one resize a distributed file system?

Efficient resource utilization becomes a major concern as large-scale distributed computing infrastructures keep growing in size. Malleability, the possibility for resource managers to dynamically increase or decrease the amount of resources allocated to a job, is a promising way to save energy and costs. However, state-of-the-art parallel and distributed storage systems have not been designed with malleability in mind. The reason is mainly the supposedly high cost of data transfers required by resizing operations. Nevertheless, as network and storage technologies evolve, old assumptions about potential bottlenecks can be revisited. In this study, we evaluate the viability of malleability as a design principle for a distributed storage system. We specifically model the minimal duration of the commission and decommission operations. To show how our models can be used in practice, we evaluate the performance of these operations in HDFS, a relevant state-of-the-art distributed file system. We show that the existing decommission mechanism of HDFS is good when the network is the bottleneck, but can be accelerated by up to a factor 3 when storage is the limiting factor. We also show that the commission in HDFS can be substantially accelerated. With the highlights provided by our model, we suggest improvements to speed both operations in HDFS. We discuss how the proposed models can be generalized for distributed file systems with different assumptions and what perspectives are open for the design of efficient malleable distributed file systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

On Simulating the Formation of Structured, Crystalline Systems via Non-classical Pathways

Observations in crystal growth and assembly from recent in situ methods suggest alternative, non-classical crystallization pathways play an important role in the determination of the micro- and meso- structures in crystalline systems. These processes display parallels that cross-cut multiple disciplines investigating crystallization across four orders of magnitude in size scales and widely differing environments, hinting that alternative crystal growth pathways may be a fundamental scheme in natural crystal formation. Using a system of short-range attractive microbeads, we demonstrate that the addition of a small concentration of sub-species incommensurate with the lattice spacing of the dominant species results in a stark change in crystal size and morphology. These changes are attributed to the presence of fleeting, amorphous-like configurations of beads that ultimately change the melting and growth dynamics in preferred directions. From these real-time observations, we hypothesize the amorphous mineral precursors present in biological mineralized tissues undergo similar non-classical crystallization processes resulting in the complex structures found in biomineralization.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Methods for separating isotopes from a sample of fission products

Systems and methods for efficient, effective, and safe separation and isolation of multiple isotopes (e.g., Mo, Zr, Ba, Sr, Te, and lanthanide isotopes) from fission products includes use of a plurality of chromatography columns, each containing a chromatographic resin formulated to target one or more particular isotopes. The system is operable in a “series” configuration to load the multiple columns by a single pass of the sample. Then, the system may be transitioned (e.g., using valves) to a “parallel” configuration in which multiple columns of the system may be operated simultaneously to elute targeted isotopes. Additional parallel operations of the columns, using different eluent compositions, may be used to elute different targeted isotopes. The system may be reconditioned in preparation for a subsequent sample.

Snow, Mathew S.↗
DOE OSTI2023

Systems for separating isotopes from a sample of fission products

Systems and methods for efficient, effective, and safe separation and isolation of multiple isotopes (e.g., Mo, Zr, Ba, Sr, Te, and lanthanide isotopes) from fission products includes use of a plurality of chromatography columns, each containing a chromatographic resin formulated to target one or more particular isotopes. The system is operable in a “series” configuration to load the multiple columns by a single pass of the sample. Then, the system may be transitioned (e.g., using valves) to a “parallel” configuration in which multiple columns of the system may be operated simultaneously to elute targeted isotopes. Additional parallel operations of the columns, using different eluent compositions, may be used to elute different targeted isotopes. The system may be reconditioned in preparation for a subsequent sample.

Snow, Mathew S.↗
DOE OSTI2021

Neuromorphic Graph Algorithms

Graph algorithms enable myriad large-scale applications including cybersecurity, social network analysis, resource allocation, and routing. The scalability of current graph algorithm implementations on conventional computing architectures are hampered by the demise of Moore’s law. We present a theoretical framework for designing and assessing the performance of graph algorithms executing in networks of spiking artificial neurons. Although spiking neural networks (SNNs) are capable of general-purpose computation, few algorithmic results with rigorous asymptotic performance analysis are known. SNNs are exceptionally well-motivated practically, as neuromorphic computing systems with 100 million spiking neurons are available, and systems with a billion neurons are anticipated in the next few years. Beyond massive parallelism and scalability, neuromorphic computing systems offer energy consumption orders of magnitude lower than conventional high-performance computing systems. We employ our framework to design and analyze new spiking algorithms for shortest path and dynamic programming problems. Our neuromorphic algorithms are message-passing algorithms relying critically on data movement for computation. For fair and rigorous comparison with conventional algorithms and architectures, which is challenging but paramount, we develop new models of data-movement in conventional computing architectures. This allows us to prove polynomial-factor advantages, even when we assume a SNN consisting of a simple grid-like network of neurons. To the best of our knowledge, this is one of the first examples of a rigorous asymptotic computational advantage for neuromorphic computing.

97 MATHEMATICS AND COMPUTING↗