Three-Round Adaptive Diagnosis in Twisted Cubes
In this paper, we propose a scheme to solve the problem of adaptive fault diagnosis in n-dimensional twisted cubes in at most three test rounds, provided that the number of faulty vertices is at most n for n ≥ 9. First, each vertex tests one specific neighbour and is tested by another specific neighbour to provide a basic syndrome in two rounds in our scheme. Then, we assign other necessary tests to diagnose the vertices that cannot be identified according to the previous syndrome in one more round. The scheme is optimal for at most three rounds since the adaptive diagnosis needs at least three rounds to complete.
KeywordsInterconnection networks twisted cubes hypercubes adaptive diagnosis Hamiltonian distributed systems multiprocessors
Unable to display preview. Download preview PDF.
- 3.Nakajima, K.: A new approach to system diagnosis, pp. 697–706 (September 1981)Google Scholar
- 9.West, D.B.: Introduction to Graph Theory. Prentice Hall (2001)Google Scholar
- 11.Araki, T.: Optimal adaptive fault diagnosis of cubic hamiltonian graphs, pp. 162–167 (May 2004)Google Scholar