This paper investigates self-organizing binary majority consensus disturbed by 1 faulty nodes with random and persistent failure. We study consensus in ordered and random 2 networks with noise, message loss, and delays. Using computer simulations, we show that: 3 (a) explicit randomization by noise, message loss, and topology can increase robustness 4 towards faulty nodes, (b) commonly-used fau...

In this paper we present how to reconfigure dynamically a complete binary tree in faulty hypercubes. First, we use a dynamic algorithm to reconfigure a complete binary tree of height h (h≥0) in an (h+1)-dimensional faulty hypercube. If there is a faulty node in the hypercube, both the dilation and congestion are 2 after reconfiguration. If there are two faulty nodes in the hypercube, both the d...

This paper proposes a method to diagnose the multiple faults in the linear analog circuits. Test equation establishes the relationship between the measured responses and faulty excitations due to faulty elements. The QR factorization is applied to identify ambiguity groups in the test verification matrix. The suspicious faulty excitations of the minimum size are determined. Faulty parameters ar...

In this paper, we present a scheme where a (d 1)-dimensional subcube is allocated in a faulty d-dimensional circuit-switched hypercube in the presence of up to 2 1) faulty nodes. The scheme is then extended to allocate a (d 1)-dimensional subcube in the presence of a combination of faulty nodes and faulty links. Theoretical proofs and simulation results are presented to analyze the performance ...

Recently, research on parallel processing systems is very active, and many complex topologies have been proposed. A burnt pancake graph is one such topology. In this paper, we prove that a faulty burnt pancake graph with degree n has a fault-free Hamiltonian cycle if the number of faulty elements is no more than n − 2, and it has a fault-free Hamiltonian path between any pair of non-faulty node...

We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is strongly hamiltonianlaceable if the number of faulty elements is one or less. When the number of faulty elements is two, it has a fault-free cycle of length at least mn−2 unless both faulty elements are contained in the sa...

In this paper, we investigate the star graph Sn with faulty vertices and/or edges from the graph theoretic point of view. We show that between every pair of vertices with different colors in a bicoloring of Sn, n ≥ 4, there is a fault-free path of length at least n!− 2fv − 1, and there is a path of length at least n!− 2fv − 2 joining a pair of vertices with the same color, when the number of fa...