A lower bound to the distribution of computation for sequential decoding.
Sequential decoding algorithm with memoryless channel, obtaining lower bound to distribution of computation and limiting factor
SEQUENTIAL ANALYSIS↗
SEARCH · Engineering Papers
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.
A Hierarchical and Distributed Approach for Mapping Large Applications to Heterogeneous Grids using Genetic Algorithms
In this paper, we propose a distributed approach for mapping a single large application to a heterogeneous grid environment. To minimize the execution time of the parallel application, we distribute the mapping overhead to the available nodes of the grid. This approach not only provides a fast mapping of tasks to resources but is also scalable. We adopt a hierarchical grid model and accomplish the job of mapping tasks to this topology using a scheduler tree. Results show that our three-phase algorithm provides high quality mappings, and is fast and scalable.
Sanyal, Soumya↗
A Parallel Rendering Algorithm for MIMD Architectures
Applications such as animation and scientific visualization demand high performance rendering of complex three dimensional scenes. To deliver the necessary rendering rates, highly parallel hardware architectures are required. The challenge is then to design algorithms and software which effectively use the hardware parallelism. A rendering algorithm targeted to distributed memory MIMD architectures is described. For maximum performance, the algorithm exploits both object-level and pixel-level parallelism. The behavior of the algorithm is examined both analytically and experimentally. Its performance for large numbers of processors is found to be limited primarily by communication overheads. An experimental implementation for the Intel iPSC/860 shows increasing performance from 1 to 128 processors across a wide range of scene complexities. It is shown that minimal modifications to the algorithm will adapt it for use on shared memory architectures as well.
Crockett, Thomas W.↗
Garbage Collection in a Distributed Object-Oriented System
An algorithm is described in this paper for garbage collection in distributed systems with object sharing across processor boundaries. The algorithm allows local garbage collection at each node in the system to proceed independently of local collection at the other nodes. It requires no global synchronization or knowledge of the global state of the system and exhibits the capability of graceful degradation. The concept of a specialized dump node is proposed to facilitate the collection of inaccessible circular structures. An experimental evaluation of the algorithm is also described. The algorithm is compared with a corresponding scheme that requires global synchronization. The results show that the algorithm works well in distributed processing environments even when the locality of object references is low.
Gupta, Aloke↗
Algorithm for Constructing Contour Plots
General computer algorithm developed for construction of contour plots. algorithm accepts as input data values at set of points irregularly distributed over plane. Algorithm based on interpolation scheme: points in plane connected by straight-line segments to form set of triangles. Program written in FORTRAN IV.
Johnson, W.↗
Exact and fast calculation of the X-ray pair distribution function
A fast and exact algorithm to calculate the powder pair distribution function (PDF) for the case of periodic structures is presented. The new algorithm calculates the PDF by a detour via reciprocal space. The calculated normalized total powder diffraction pattern is transferred into the PDF via the sine Fourier transform. The calculation of the PDF via the powder pattern avoids the conventional simplification of X-ray and electron atomic form factors. It is thus exact for these types of radiation, as is the conventional calculation for the case of neutron diffraction. The new algorithm further improves the calculation speed. Additional advantages are the improved detection of errors in the primary data, the handling of preferred orientation, the ease of treatment of magnetic scattering and a large improvement to accommodate more complex instrumental resolution functions.
36 MATERIALS SCIENCE↗
A Novel Multiagent Resource Sharing Algorithm for Control of Advanced Energy Systems
This paper implements a novel resource sharing control strategy on a fuel cell–gas turbine hybrid power system at the National Energy Technology Laboratory’s Hybrid Performance Facility (Hyper). In a fuel cell–gas turbine hybrid power system, the simultaneous interaction of the gas turbine and the fuel cell creates a tightly coupled environment characterized by conflicting dynamics. In this paper, a model-free control approach is applied to solve the tightly coupled control problem posed by this challenging environment. Specifically, this control problem is presented as a resource sharing problem that can be solved using a resource sharing algorithm that is defined based on the distribution construction concept. This algorithm creates computational agents and solves the problem through the distribution and redistribution of shared resources defined as blocks. Furthermore, two agents were created; the first agent (agent 1) controls the gas turbine speed by adjusting the electric load, and the second agent (agent 2) controls the cathode mass flow through the fuel cell using the cold-air bypass valve. A parametric study was performed over the course of 15 experimental tests for both agents 1 and 2 through an evaluation of the responses based on setpoint changes. The algorithm was shown to have behavior comparable to a previously implemented multi-input multioutput state-space controller, which was designed through a model-based control approach. The resource sharing algorithm was able to find stable performance during run-time operations without any prior system knowledge identification on the power plant and without creating models used in traditional control strategies.
25 ENERGY STORAGE↗
An observer-based compensator for distributed delays
This paper presents an algorithm for compensating delays that are distributed between the sensor(s), controller and actuator(s) within a control loop. This observer-based algorithm is specially suited to compensation of network-induced delays in integrated communication and control systems. The robustness of the algorithm relative to plant model uncertainties has been examined.
Luck, Rogelio↗
PaKman: A Scalable Algorithm for Generating Genomic Contigs on Distributed Memory Machines
Not Available
42 ENGINEERING↗
The ATAMM procedure model for concurrent processing of large grained control and signal processing algorithms
An overview is presented of a model for describing data and control flow associated with the execution of large-grained, decision-free algorithms in a special distributed computer environment. The ATAMM (Algorithm-To-Architecture Mapping Model) model provides a basis for relating an algorithm to its execution in a dataflow multicomputer environment. The ATAMM model features a marked graph Petri net description of the algorithm behavior with regard to both data and control flow. The model provides an analytical basis for calculating performance bounds on throughput characteristics which are demonstrated here.
Stoughton, John W.↗
Self-Assembling Microgrids for Resilient Distribution Systems of the Future: Implementation in a Commercial DERMS Platform
Microgrids have long provided resilience to critical facilities such as hospitals and military installations, and they are now increasingly being looked at as a building block for future grids to support the energy resilience needs of the grid of the future. State-of-the-art technologies, such as blackstart algorithms using renewable distributed energy resources (DERs) to effectively and seamlessly form microgrids, have been produced by national labs over the years. Their adoption by the utility industry would be critical to reap the most benefits toward energy and climate resilience, and the pathway is via commercialization of these self-assembling microgrid algorithms by integrating them in a commercial product platform. This project brings a national labs team (LLNL, LANL) together with a vendor (Smarter Grid Solutions) to perform proof-of-concept integration of the algorithms into the vendor’s commercial Distributed Energy Resources Management System (DERMS). The project provides a strong pathway to commercialization of the algorithms thereby promoting adoption of resilient microgrid technology by utilities to offer resilience benefits to all customers and especially to disadvantaged and underserved communities.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Distributed optimization for multi-commodity urban traffic control
A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.
Augmented Lagrangian↗
Voltage regulation in distribution grids: A survey
Environmental and sustainability concerns have caused a recent surge in the penetration of distributed energy resources into the power grid. This may lead to voltage violations in the distribution systems making voltage regulation more relevant than ever. Owing to this and rapid advancements in sensing, communication, and computation technologies, the literature on voltage control techniques is growing at a rapid pace in distribution networks. In particular, there is a paradigm shift from traditional offline centralized approaches to distributed ones leveraging increased and varied types of actuators, real-time sensing, fast and efficient computations, and an overall distributed situational awareness. This paper reviews state-of-the-art voltage control algorithms, summarizes the underlying methods, and classifies their coordination mechanisms into local, centralized, distributed, and decentralized. The underlying solution methodologies are further classified into two categories, open-loop and feedback-based. Two specific example workflows are provided to illustrate these solutions for voltage regulation.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Distributed Saturation
The Saturation algorithm for symbolic state-space generation, has been a recent break-through in the exhaustive veri cation of complex systems, in particular globally-asyn- chronous/locally-synchronous systems. The algorithm uses a very compact Multiway Decision Diagram (MDD) encoding for states and the fastest symbolic exploration algo- rithm to date. The distributed version of Saturation uses the overall memory available on a network of workstations (NOW) to efficiently spread the memory load during the highly irregular exploration. A crucial factor in limiting the memory consumption during the symbolic state-space generation is the ability to perform garbage collection to free up the memory occupied by dead nodes. However, garbage collection over a NOW requires a nontrivial communication overhead. In addition, operation cache policies become critical while analyzing large-scale systems using the symbolic approach. In this technical report, we develop a garbage collection scheme and several operation cache policies to help on solving extremely complex systems. Experiments show that our schemes improve the performance of the original distributed implementation, SmArTNow, in terms of time and memory efficiency.
Chung, Ming-Ying↗
Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies
Here, in this article, we present a finite-time stopping criterion for consensus algorithms in networks with dynamic communication topology. Prior state of the art has established convergence to the consensus value; however, the asymptotic convergence of these algorithms poses a challenge in practical settings where the response from agents is required in finite time. To this end, we propose a maximum-minimum protocol that propagates the global maximum and minimum values of agent states (while running the consensus algorithm) in the network. This article focuses on establishing that the global maximum and minimum values are strictly monotonic even for a dynamic topology, and they can be used to distributively ascertain the closeness to convergence in finite time. We rigorously show that each node can have access to the global maximum and minimum by running the proposed maximum-minimum protocol to realize a finite-time stopping criterion for the otherwise asymptotic consensus algorithm. The practical utility of the algorithm is illustrated through experiments where each agent is instantiated by a NodeJS socket.io server.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Evaluating Retrieval Algorithm Climate Stability: Estimating 3D Optical Thickness Bias Distributions by Cloud Type
Detecting climate trends on large spatiotemporal scales requires accurate, stable measurements and stable retrieval algorithms. We strive to estimate how time-variant retrieval algorithm biases may impact trend detection. Here we focus on the 3D cloud optical thickness (τc) bias, which is among the largest in passive cloud retrieval algorithms. If this bias is time dependent, a possibility with potential decadal changes in cloud morphology, it may obscure genuine trends in τc. Although previous studies have evaluated the cloud- and sun-view geometry-dependent 3D τc bias on small spatial scales, before our current study none have evaluated the stability of this well-known bias on climate-relevant large spatiotemporal scales. These studies must estimate large scale distributions of the 3D τc bias by cloud type and estimate how cloud type amount may change between two climate states. We employ a novel approach to estimate large scale distributions of 3D τc using a proxy of the bias that quantifies the departure of clouds from satisfying the 1D radiative transfer assumption used in passive τc retrievals. This existing globally-distributed proxy is an angular consistency metric that was developed using fused Moderate-Resolution Imaging Spectroradiometer (MODIS) and Multi-angle Imaging Spectroradiometer (MISR) measurements. Calculating the 3D τc bias and the proxy, for known cloud fields enables us to establish statistical relationships between these two quantities, which can be used to calculate large-scale distributions of the 3D τc bias. This approach limits the number of 3D radiative transfer simulations required to only those needed to estimate a statistical relationship between the 3D τc bias for known cloud fields and a proxy of the bias. It is likely that future studies will be needed to evaluate retrieval algorithm bias stability for other geophysical variables as the community develops climate data records from satellite observations and their retrievals. This must be done in addition to monitoring and correcting measurement errors and uncertainties and understanding their impact on retrieved essential climate variables.
Yolanda Shea↗
Taylor-Expansion-Based Robust Power Flow in Unbalanced Distribution Systems: A Hybrid Data-Aided Method
Traditional power flow methods often adopt certain assumptions designed for passive balanced distribution systems, thus lacking practicality for unbalanced operation. moreover, their computation accuracy and efficiency are heavily subject to unknown errors and bad data in measurements or prediction data of distributed energy resources (ders). to address these issues, this paper proposes a hybrid data-aided robust power flow algorithm in unbalanced distribution systems, which combines taylor series expansion knowledge with a data-driven regression technique. the proposed method initiates a linearization power flow model to derive an explicitly analytical solution by modified taylor expansion. to mitigate the approximation loss that surges due to the der integration and bad data, we further develop a data-aided robust support vector regression approach to estimate the errors efficiently. comparative analysis in the 13-bus and 123-bus ieee unbalanced feeders shows that the proposed hybrid algorithm achieves superior computational efficiency, with guaranteed accuracy and robustness against outliers.
data-driven↗