Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed algorithm”

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 325 records · Page 18

Intelligent Systems for Power Management and Distribution

The motivation behind an advanced technology program to develop intelligent power management and distribution (PMAD) systems is described. The program concentrates on developing digital control and distributed processing algorithms for PMAD components and systems to improve their size, weight, efficiency, and reliability. Specific areas of research in developing intelligent DC-DC converters and distributed switchgear are described. Results from recent development efforts are presented along with expected future benefits to the overall PMAD system performance.

Button, Robert M.↗

Intelligent Systems for Power Management and Distribution

The motivation behind an advanced technology program to develop intelligent power management and distribution (PMAD) systems is described. The program concentrates on developing digital control and distributed processing algorithms for PMAD components and systems to improve their size, weight, efficiency, and reliability. Specific areas of research in developing intelligent DC-DC converters and distributed switchgear are described. Results from recent development efforts are presented along with expected future benefits to the overall PMAD system performance.

Button, Robert M.↗

Reliable algorithms for power system analysis in the presence of data uncertainties

A robust and reliable power flow analysis represents an essential requirement for many power systems applications as far as network optimization, voltage control, state estimation, and service restoration are concerned. The most common power flow approach, referred to here as a deterministic power flow (PLF), requires precise or 'crisp' values chosen by the analyst for each input variable. The solution provides precise network voltages and flows through each line. The specified values rest upon assumptions about the operating condition derived from historical measurements or predictions about future conditions and thus, cannot be considered accurate. Even in the case where the inputs are based on measurements, inaccuracies arise from time-skew problems, three-phase unbalance, static modeling approximations of dynamic components (e.g., transformer tap changers), variations in line parameters, and so on. The advent of deregulation and competitive power markets will only exacerbate this problem as well-known generation patterns change, loading becomes less predictable and the transmission paths grow more diverse. Conventional methodologies proposed in literature address tolerance analysis of power flow solution by means of detailed probabilistic methods, accounting for the variability and stochastic nature of the input data, and sampling based approaches. In particular uncertainty propagation using sampling based methods, such as the Monte Carlo, requires several model runs that sample various combinations of input values. Since the number of model runs can sometimes be very large, the required computer resources can sometimes be prohibitively expensive resulting in substantial computational demands. As far as probabilistic methods are concerned, they represent a useful tool, especially for planning studies, but, as evidenced by the many discussions reported in literature, they could reveal some shortcomings principally arising from: (1) the non-normal distribution and the statistical dependence of the input data; and (2) the difficulty arising in accurately identifying probability distributions for some input data, such as the power generated by wind or photovoltaic generators. All these could result in time consuming computations with several limitations in practical applications especially in power flow analysis of complex power networks. In order to try and overcome some of these limitations, obtaining thereby comprehensive power flow solution tolerance analysis at adequate computational costs, self validated computation could play a crucial role. Armed with such a vision, this chapter will analyze two advanced techniques for power flow analysis in the presence of data uncertainty namely the boundary power flow and the affine arithmetic power flow.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A generalization of algebraic surface drawing

An implicit surface mathematical description of three-dimensional space is defined in terms of all points which satisfy some equation F(x, y, z) equals 0. This form is ideal for space-shaded picture drawing, where the coordinates are substituted for x and y and the equation is solved for z. A new algorithm is presented which is applicable to functional forms other than those of first- and second-order polynomial functions, such as the summation of several Gaussian density distributions. The algorithm was created in order to model electron density maps of molecular structures, but is shown to be capable of generating shapes of esthetic interest.

Blinn, J. F.↗

Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly

One of the most computationally intensive tasks in computational biology is de novo genome assembly, the decoding of the sequence of an unknown genome from redundant and erroneous short sequences. A common assembly paradigm identifies overlapping sequences, simplifies their layout, and creates consensus. Despite many algorithms developed in the literature, the efficient assembly of large genomes is still an open problem. In this work, we introduce new distributed-memory parallel algorithms for overlap detection and layout simplification steps of de novo genome assembly, and implement them in the diBELLA 2D pipeline. Our distributed memory algorithms for both overlap detection and layout simplification are based on linear-algebra operations over semirings using 2D distributed sparse matrices. Our layout step consists of performing a transitive reduction from the overlap graph to a string graph. We provide a detailed communication analysis of the main stages of our new algorithms. diBELLA 2D achieves near linear scaling with over 80% parallel efficiency for the human genome, reducing the runtime for overlap detection by 1.2-1.3× for the human genome and 1.5-1.9× for C.elegans compared to the state-of-the-art. Our transitive reduction algorithm outperforms an existing distributed-memory implementation by 10.5-13.3× for the human genome and 18-29× for the C. elegans. Our work paves the way for efficient de novo assembly of large genomes using long reads in distributed memory.

59 BASIC BIOLOGICAL SCIENCES↗

Probabilistic Look-ahead Contingency Analysis Integrated with GE EMS Tool

This report documents implementation of the smart sampling-based probabilistic look-ahead contingency analysis algorithm, the integration with General Electric (GE) Grid Solutions’ commercial energy management system (EMS) tool, and the case study results using real world data from the Bonneville Power Administration (BPA).The probabilistic look-ahead contingency analysis algorithm incorporates forecast errors of renewable energy and load into contingency analysis functions to enable a predictive capability with a more complete picture, revealing the potential violations that are not normally detected by traditional deterministic approaches. To test its performance under practical environments, the probabilistic look-ahead contingency analysis algorithm has been integrated with the dominant GE EMS tool as a proof-of-concept for a seamless integration. To meet the output format of GE EMS tool, an extreme value distribution (EVD) algorithm is newly adapted to analyze the GE EMS’s violation-only output. Real world data from BPA are used to test its performance, and the results clearly show the effectiveness of the developed algorithm and improved situational awareness. This effort is an example of successful technology transition and cooperation under a real-world environment because it is a joint effort from department of energy, a national laboratory, a commercial vendor, and a large utility.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan↗

Families of Graph Algorithms: SSSP Case Study

Single-Source Shortest Paths (SSSP) is a well-studied graph problem. Examples of SSSP algorithms include the original Dijkstra’s algorithm and the parallel Δ-stepping and KLA-SSSP algorithms. In this paper, we use a novel Abstract Graph Machine (AGM) model to show that all these algorithms share a common logic and differ from one another by the order in which they perform work. We use the AGM model to thoroughly analyze the family of algorithms that arises from the common logic. We start with the basic algorithm without any ordering (Chaotic), and then we derive the existing and new algorithms by methodically exploring semantic and spatial ordering of work. Our experimental results show that new derived algorithms show better performance than the existing distributed memory parallel algorithms, especially at higher scales.

distributed-memory graph algorithms↗

Parallel discrete event simulation: A shared memory approach

With traditional event list techniques, evaluating a detailed discrete event simulation model can often require hours or even days of computation time. Parallel simulation mimics the interacting servers and queues of a real system by assigning each simulated entity to a processor. By eliminating the event list and maintaining only sufficient synchronization to insure causality, parallel simulation can potentially provide speedups that are linear in the number of processors. A set of shared memory experiments is presented using the Chandy-Misra distributed simulation algorithm to simulate networks of queues. Parameters include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential simulation of most queueing network models.

Reed, Daniel A.↗

Design of Safe Separation Bounds for Temporally Deconflicted Trajectories Under Bounded Uncertainties

This paper explores the derivation of safe separation bounds for a heterogeneous group of~$n$ Uncrewed Aerial Systems (UAS) that are assigned temporally deconflicted trajectories. Compared to spatially deconflicted trajectories, temporal deconfliction can lead to higher traffic capacities and a more efficient use of the available airspace. One challenge with this type of deconfliction is that collisions can occur if some cooperating UAS are behind or ahead of schedule. To overcome this risk, this paper derives a lower bound on the safety distance between two heterogeneous UAS in the presence of bounded uncertainties. This safety distance can be leveraged to inform trajectory generation algorithms. The proposed bound establishes a rigorous safety margin when the fleet deviates from the planned trajectories, both temporally and spatially. For its derivation the paper assumes the UAS implement a distributed coordination algorithm that allows the fleet to maintain their schedules synchronized within a bounded temporal error, and a path-following algorithm that lets the vehicles track a target that moves along the planned trajectory with a bounded spatial error.

autonomy↗

Weighted SVD algorithm for close-orbit correction and 10 Hz feedback in RHIC

Measurements of the beam position along an accelerator are typically treated equally using standard SVD-based orbit correction algorithms so distributing the residual errors, modulo the local beta function, equally at the measurement locations. However, sometimes a more stable orbit at select locations is desirable. In this paper, we introduce an algorithm for weighting the beam position measurements to achieve a more stable local orbit. The results of its application to close-orbit correction and 10 Hz orbit feedback are presented.

43 PARTICLE ACCELERATORS↗

Execution time support for scientific programs on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

Mapping robust parallel multigrid algorithms to scalable memory architectures

The convergence rate of standard multigrid algorithms degenerates on problems with stretched grids or anisotropic operators. The usual cure for this is the use of line or plane relaxation. However, multigrid algorithms based on line and plane relaxation have limited and awkward parallelism and are quite difficult to map effectively to highly parallel architectures. Newer multigrid algorithms that overcome anisotropy through the use of multiple coarse grids rather than line relaxation are better suited to massively parallel architectures because they require only simple point-relaxation smoothers. The parallel implementation of a V-cycle multiple semi-coarsened grid (MSG) algorithm or distributed-memory architectures such as the Intel iPSC/860 and Paragon computers is addressed. The MSG algorithms provide two levels of parallelism: parallelism within the relaxation or interpolation on each grid and across the grids on each multigrid level. Both levels of parallelism must be exploited to map these algorithms effectively to parallel architectures. A mapping of an MSG algorithm to distributed-memory architectures that demonstrate how both levels of parallelism can be exploited is described. The results is a robust and effective multigrid algorithm for distributed-memory machines.

Overman, Andrea↗

Use of Fuzzycones for Sun-Only Attitude Determination: THEMIS Becomes ARTEMIS

In order for two THEMIS probes to successfully transition to ARTEMIS it will be necessary to determine attitudes with moderate accuracy using Sun sensor data only. To accomplish this requirement, an implementation of the Fuzzycones maximum likelihood algorithm was developed. The effect of different measurement uncertainty models on Fuzzycones attitude accuracy was investigated and a bin-transition technique was introduced to improve attitude accuracy using data with uniform error distributions. The algorithm was tested with THEMIS data and in simulations. The analysis results show that the attitude requirements can be met using Fuzzycones and data containing two bin-transitions.

Hashmall, Joseph A.↗

A Fault-Tolerant Clock Synchronization and Geometry Determination Protocol

A fault-tolerant distributed protocol (algorithm) is presented that achieves optimum timing precision (clock synchronization) among the nodes and, simultaneously, determines the network's geometry (shape) - locations and distances of the nodes relative to each other - in a wireless distributed system. This protocol is based on the assumption of initial coarse synchrony of nodes' local clocks. The proposed solution assumes no prior knowledge of the nodes' locations, the distances between the nodes, or network's geometry, but assumes an ordered geometry where nodes have unique identifiers. This protocol accommodates large variations in the communication latencies among the nodes; thus, it applies equally to both wireless and wired networks.

Malekpour, Mahyar R.↗

Unit cell dilation technique for analyzing dilatometry data in microalloyed steels

Highlights: • Lever rule is not an adequate method to analyze dilatometry data. • A method called “Unit Cell Dilation” is developed to analyze the dilatometry data. • The new method calculates phase fractions while accounting for chemical changes during diffusive phase transformation. - Abstract: Dilatometry is the most accurate and common method for measuring the kinetics of phase transformations in solid specimens. Despite the development of a more accurate technique, an inferior method, i.e., the lever rule, is widely used in the scientific community to interpret raw dilatometry data. This paper introduces a sound mathematical approach to modeling the physical phenomena of phase transformations, named continuous sequential phase transformation (CSPT). CSPT is used in creating an algorithm called unit cell dilation (UCD) that is used for analyzing the continuous phase transformation of two microalloyed steels. Results show that the UCD algorithm generates quantitative data for the phase content of the steel that is in good agreement with metallographic observations. The source code for an implementation of the UCD algorithm is distributed under GPL-3.0 license and available for download at (https://github.com/Nassehk/Dilatometry-analysis.git).

36 MATERIALS SCIENCE↗

Computation of Domain-Averaged Shortwave Irradiance by a One-Dimensional Algorithm Incorporating Correlations between Optical Thickness and Direct Incident Radiation

A one-dimensional radiative transfer algorithm that accounts for correlations between the optical thickness and the incident direct solar radiation is developed to compute the domain-averaged shortwave irradiance profile. It divides the direct irradiance into four components and treats the direct irradiance in two separate, clear and cloudy columns to account for the fact that clouds attenuate the direct irradiance more than clear-sky. The horizontal inhomogeneity of clouds in the cloudy column is treated by the gamma weighted two-stream approximation, which assumes that the optical thickness of clouds follows a gamma distribution. The algorithm inputs the cloud fraction, cumulative cloud fraction as a function of height, and a parameter expressing the shape of the probability density function of the cloud optical thickness distribution in addition to inputs required for a two-stream radiative transfer model. These cloud property inputs can be obtained using ground- and satellite-based instruments. Therefore, the algorithm can treat realistic cloud overlap features and horizontal inhomogeneity of clouds in a framework of one- dimensional radiative transfer. Heating rates computed by the algorithm using cloud fields generated by cloud resolving models agree with those computed with a Monte Carlo model. If optical properties in computational layers that divide a vertically extensive cloud are correlated, the irradiance profile computed by the algorithm further improves.

Kato, S.↗