Fault Diagnosability of Arrangement Graphs

Details Fault Diagnosability of Arrangement Graphs Fault Diagnosability of Arrangement Graphs

2012-04-18

arxiv.org/abs/1204.4018v1

Mathematics

Combinatorics

21 pages, 2 figures, 37 refrences

Scientific paper

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. This paper shows that the largest connected component of the survival graph contains almost all 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. Based on this fault resiliency, we establishes that the conditional diagnosability of $A_{n,k}$ under the comparison model. We prove that for $k\geq 4$, $n\geq k+2$, the conditional diagnosability of $A_{n,k}$ is $(3k-2)(n-k)-3$; the conditional diagnosability of $A_{n,n-1}$ is $3n-7$ for $n\geq 5$.

Affiliated with

Also associated with

No associations

Rating

Fault Diagnosability of Arrangement Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fault Diagnosability of Arrangement Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fault Diagnosability of Arrangement Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-411404