A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Arrangement graphs: a class of generalized star graphs
Information Processing Letters
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach
IEEE Transactions on Computers
Information Processing Letters
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Congestion-free embedding of 2 (n-k) spanning trees in an arrangement graph
Journal of Systems Architecture: the EUROMICRO Journal
Embedding of Cycles in Arrangement Graphs
IEEE Transactions on Computers
Embedding Hamiltonian Paths in Faulty Arrangement Graphs with the Backtracking Method
IEEE Transactions on Parallel and Distributed Systems
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
On Fault Identification in Diagnosable Systems
IEEE Transactions on Computers
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
Generalized matching networks and their properties
International Journal of Parallel, Emergent and Distributed Systems
Largest connected component of a star graph with faulty vertices
International Journal of Computer Mathematics
Conditional diagnosability of hypercubes under the comparison diagnosis model
Journal of Systems Architecture: the EUROMICRO Journal
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
Conditional diagnosability of alternating group networks
Information Processing Letters
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
| Hi-index | 0.07 |
The growing size of the multiprocessor system increases its vulnerability to component failures. It is crucial to locate and to replace the faulty processors to maintain a system's high reliability. The fault diagnosis is the process of identifying faulty processors in a system through testing. In this paper, we show that the largest connected component of the survival graph contains almost all of the remaining vertices in the (n,k)-arrangement graph A"n","k when the number of moved faulty vertices is up to twice or three times the traditional connectivity. Using this fault resiliency, we establish the conditional diagnosability of A"n","k under the comparison model, and prove that the conditional diagnosability of A"n","k is (3k-2)(n-k)-3 for k=4, n=k+2; and the conditional diagnosability of A"n","n"-"1 is 3n-7 for n=5.