scispace - formally typeset
Search or ask a question
Topic

Control reconfiguration

About: Control reconfiguration is a research topic. Over the lifetime, 22423 publications have been published within this topic receiving 334217 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: The construction of a crossed cube which has many of the properties of the hypercube, but has diameter only about half as large, is discussed, and it is shown that the CQ/sub n/ architecture can profitably emulate the ordinary hypercube.
Abstract: The construction of a crossed cube which has many of the properties of the hypercube, but has diameter only about half as large, is discussed. This network is self-routing, in the sense that there is a simple distributed routing algorithm which guarantees optimal paths between any pair of vertices. This fact, together with other properties such as regularity, symmetry, high connectivity, and a simple recursive structure, suggests that the crossed cube may be an attractive alternative to the ordinary hypercube for massively parallel architectures, SIMD algorithms, which utilize the architecture are developed, and it is shown that the CQ/sub n/ architecture can profitably emulate the ordinary hypercube. It is also shown that addition of simple switches can improve the capabilities of the system significantly. For instance, the dynamic reconfiguration capability allows hypercube algorithms to be executed on the proposed architecture. The use of these switches also improves the embedding properties of the system. >

398 citations

Journal ArticleDOI
TL;DR: A harmony search algorithm (HSA) is proposed to solve the network reconfiguration problem to get optimal switching combination in the network which results in minimum loss and is observed that the proposed method performed well compared to the other methods in terms of the quality of solution.
Abstract: Electrical distribution network reconfiguration is a complex combinatorial optimization process aimed at finding a radial operating structure that minimizes the system power loss while satisfying operating constraints. In this paper, a harmony search algorithm (HSA) is proposed to solve the network reconfiguration problem to get optimal switching combination in the network which results in minimum loss. The HSA is a recently developed algorithm which is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search which eliminates the need for derivative information. Simulations are carried out on 33- and 119-bus systems in order to validate the proposed algorithm. The results are compared with other approaches available in the literature. It is observed that the proposed method performed well compared to the other methods in terms of the quality of solution.

397 citations

Journal ArticleDOI
TL;DR: This paper describes a decentralized estimation procedure that allows each agent to track the algebraic connectivity of a time-varying graph and proposes a decentralized gradient controller for eachAgent to maintain global connectivity during motion.

397 citations

Journal ArticleDOI
TL;DR: Failures, faults, and errors in digital systems are examined, and measures of dependability, which dictate and evaluate fault-tolerance strategies for different classes of applications, are defined.
Abstract: The basic concepts of fault-tolerant computing are reviewed, focusing on hardware. Failures, faults, and errors in digital systems are examined, and measures of dependability, which dictate and evaluate fault-tolerance strategies for different classes of applications, are defined. The elements of fault-tolerance strategies are identified, and various strategies are reviewed. They are: error detection, masking, and correction; error detection and correction codes; self-checking logic; module replication for error detection and masking; protocol and timing checks; fault containment; reconfiguration and repair; and system recovery. >

396 citations

Journal ArticleDOI
01 Oct 1978
TL;DR: The core software in the FFMP will handle all fault detection, diagnosis, and recovery in such a way that applications programs do not need to be involved.
Abstract: FTMP is a digital computer architecture which has evolved over a ten-year period in connection with several life-critical aerospace applications. Most recently it has been proposed as a fault-tolerant central computer for civil transport aircraft applications. A working emulation has been operating for some time, and the first engineering prototype is scheduled to be completed in late 1979. FTMP is designed to have a failure rate due to random causes of the order of 10-10failures per hour, on ten-hour flights where no air-borne maintenance is available. The prefered maintenance interval is of the order of hundreds of flight hours, and the probability that maintenance will be required earlier than the preferred interval is desired to be at most a few percent. The design is based on independent processor-cache memory modules and common memory modules which communicate via redundant serial buses. All information processing and transmission is conducted in triplicate so that local voters in each module can correct errors. Modules can be retired and/or reassigned in any configuration. Reconfiguration is carried out routinely from second to second to search for latent faults in the voting and reconfiguration elements. Job assignments are all made on a floating basis, so that any processor triad is eligible to execute any job step. The core software in the FFMP will handle all fault detection, diagnosis, and recovery in such a way that applications programs do not need to be involved. Failure-rate models and numerical results are described for both permanent and intermittent faults. A dispatch probability model is also presented. Experience with an experimental emulation is described.

388 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
85% related
Software
130.5K papers, 2M citations
85% related
Wireless sensor network
142K papers, 2.4M citations
84% related
Network packet
159.7K papers, 2.2M citations
83% related
Optimization problem
96.4K papers, 2.1M citations
83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
2023784
20221,765
2021778
2020958
2019976
20181,060