Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic communication pattern. The communication pattern graph is mapped onto the topology of multiprocessor structures so that the corresponding application can be executed. To increase the reliability of parallel applications, fault-tolerant embedding is necessary. In this paper, w...

In this paper, we consider an injured star graph with some faulty links and nodes. We show that even with fe n 3 faulty links a Hamiltonian cycle still can be found in an nstar, and that with fv n 3 faulty nodes a ring containing at most 4fv nodes less than that in a Hamiltonian cycle can be found (i.e., containing at leastn! 4fv nodes). In general, in an n-star with fe faulty links and fv faul...

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...