PROPERTIES OF c-CORRECTABILITY IN SELF-DIAGNOSING SYSTEMS
نویسنده
چکیده
YONINA ROSEN Department of Electrical Engineering University of Delaware Newark, DE 19716 We propose a distributed disabling algorithm for a multiprocessing system in which each processor or unit is prevented from doing computation when it fails some number of tests by other units. The goal is to disable all faulty units and to enable all fault-free units. Specifically, a unit is disabled iff it fails d or more tests by enabled units (d-disabling rule). A multiprocessor system is c-correctable using the ddisabling ntle iff all faulty units are permanently disabled and all fault-free units are permanently enabled after a finite number of applications of the disabling rule, provided there are no more than c faulty units. This models an unattended system where the removal of faulty units is done locally by simple and reliable circuitry. We give a sufficient condition for c-correctability in general systems and a necessary and sufficient condition in general systems where c <d. Then, we give necessary and sufficient conditions for c-correctability of two types of systems, (1) complete digraphs and (2) a new class of systems called segmented systems.
منابع مشابه
Two Remarks on Self-Correctability versus Random-Self-Reducibility
We examine the relationship between two types of probabilistic self-reductions that play crucial roles in the theory of interactive proof systems, program-checking, and program-testing: selfcorrectors and random-self-reductions. It is well known [4] that if a function is random-selfreducible, then it is also self-correctable; indeed all known self-correctors use some form of random-self-reducib...
متن کاملTwo Remarks on Self-Correctability versus Random-Self-Reducibility
We examine the relationship between two types of probabilistic self-reductions that playcrucial roles in the theory of interactive proof systems, program-checking, and program-testing: self-correctors and random-self-reductions. It is well known [4] that if a functionis random-self-reducible, then it is also self-correctable; indeed all known self-correctors usesome form of ...
متن کاملOn Coherence, Random-self-reducibility, and Self-correction1
We address two questions about self-reducibility the power of adaptiveness in examiners that take advice and the relationship between random-self-reducibility and self-correctability. We rst show that adaptive examiners are more powerful than nonadaptive examiners, even if the nonadaptive ones are nonuniform: There exists a coherent function that is not nonadaptively coherent, even via nonadapt...
متن کاملAn Information-Theoretic Treatment of Random-Self-Reducibility (Extended Abstract)
We initiate the study of random-self-reducibility from an information-theoretic point of view. Speciically, we formally deene the notion of a random-self-reduction that, with respect to a given ensemble of distributions, leaks a limited number bits, i.e., produces target instances y1; : : : ; yk in such a manner that each yi has limited mutual information with the input x. We argue that this no...
متن کاملSelf-Starting Control Chart and Post Signal Diagnostics for Monitoring Project Earned Value Management Indices
Earned value management (EVM) is a well-known approach in a project control system which uses some indices to track schedule and cost performance of a project. In this paper, a new statistical framework based on self-starting monitoring and change point estimation is proposed to monitor correlated EVM indices which are usually auto-correlated over time and non-normally distributed. Also, a new ...
متن کامل