Abstract
Abstract This work introduces a new system-level diagnosis model and an algorithm based on this model: Hi-Comp (Hierarchical Comparison-based Adaptive Distributed System-Level Diagnosis algorithm). This algorithm allows the diagnosis of systems that can be represented by a complete graph. Hi-Comp is the first diagnosis algorithm that is, at the same time, hierarchical, distributed and comparison-based. The algorithm is not limited to crash fault diagnosis, because its tests are based on comparisons. To perform a test, a processor sends a task to two processors of the system that, after executing the task, send their outputs back to the tester. The tester compares the two outputs; if the comparison produces a match, the tester considers the tested processors fault-free; on the other hand, if the comparison produces a mismatch, the tester considers that at least one of the two tested processors is faulty, but can not determine which one. Considering a system of N nodes, it is proved that the algorithm’s diagnosability is (N-1) and the latency is log2N testing rounds. Furthermore, a formal proof of the maximum number of tests required per testing round is presented, which can be O(N3). Simulation results are also presented.
Highlights
The basic goal of system-level diagnosis is to determine the state of all units of a given system [1]
An algorithm based on this model is presented, the Hierarchical Comparison-Based Adaptive Distributed System-Level Diagnosis (Hi-Comp) algorithm
All fault-free nodes running Hi-Comp require, at most, log N testing rounds to achieve the complete diagnosis of the system
Summary
The basic goal of system-level diagnosis is to determine the state of all units of a given system [1]. A Generalized Model for Distributed Comparison-Based System Level Diagnosis with Timestamps performs event diagnosis This algorithm groups the units of the systems into sets of N/2 units called clusters. The comparison-based models, proposed initially by Malek [12], and by Chwa and Hakimi [13], have been considered to be a practical approach for fault diagnosis in distributed systems In these first comparison-based models, it was assumed that system tasks are duplicated on two distinct units in the system and their outputs are compared by a central observer. An algorithm based on this model is presented, the Hierarchical Comparison-Based Adaptive Distributed System-Level Diagnosis (Hi-Comp) algorithm This algorithm uses a similar hierarchical testing strategy as the one employed by Hi-ADSD with Timestamps.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
