(t, k)-Diagnosability of multiprocessor systems with applications to grids and tori

SIAM Journal on Computing

Volumn 37, Issue 4, 2007, Pages 1280-1298

  Chang, Guey Yun ^a   Chen, Gen Huey ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

(t, k) diagnosis; Diagnosability; Diagnosis; MM* model; Multiprocessor system; PMC model; Sequential diagnosis

Indexed keywords

CONTROL THEORY;

(T, K)-DIAGNOSIS; D DIMENSIONS; DIAGNOSABILITY; DIAGNOSIS; FAULTY PROCESSORS; LOWER BOUNDS; MM; MODEL; MULTI-PROCESSOR SYSTEMS; MULTIPROCESSOR SYSTEM; PMC MODEL; SEQUENTIAL DIAGNOSIS;

MULTIPROCESSING SYSTEMS;

EID: 49449086018     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/06065043X     Document Type: Article

References (32)

1. T. ARAKI AND Y. SHIBATA, (t,k)-diagnosable system: A generalization of the PMC models, IEEE Trans. Comput., 52 (2003), pp. 971-975.
2. T. ARAKI AND Y. SHIBATA, Diagnosability of butterfly networks under the comparison approach, IEICE Trans. Fundamentals of Electronics Communications and Computer Science, E85-A (2002), pp. 1152-1160.
3. J. R. ARMSTRONG AND F. G. GRAY, Fault diagnosis in a Boolean n-cube array of microprocessors, IEEE Trans. Comput., C-30 (1981), pp. 587-590.
4. M. C. AZIZOǦLU AND Ö. EǦECIOǦ LU, The bisection width and the isoperimetric number of arrays, Discrete Appl. Math., 138 (2004), pp. 3-12.
5. S. L. BEZRUKOV, S. K. DAS, AND R. ELSÄ SSER, An edge-isoperimetric problem for powers of the Petersen graph, Ann. Comb., 4 (2000), pp. 153-169.
6. S. L. BEZRUKOV AND R. ELSÄSSER, Edge-isoperimetric problems for Cartesian powers of regular graphs, Theoret. Comput. Sci., 307 (2003), pp. 473-492.
7. S. L. BEZRUKOV, On an equivalence in discrete extremal problems, Discrete Math., 203 (1999), pp. 9-22.
8. L. BHUYAN AND D. P. AGRAWAL, Generalized hypercube and hyperbus structures for a computer network, IEEE Trans. Comput., 33 (1984), pp. 323-333.
9. B. BOLLOBAS AND I. LEADER, An isoperimetric inequality on the discrete torus, SIAM J. Discrete Math., 3 (1990), pp. 32-37.
10. A. CARUSO, S. CHESSA, P. MAESTRINI, AND P. SANTI, Diagnosability of regular systems, J. Algorithms, 45 (2002), pp. 126-143.
11. C. P. CHANG, P. L. LAI, J. M. TAN, AND L. H. HSU, Diagnosability of t-connected networks and product networks under the comparison diagnosis model, IEEE Trans. Comput., 53 (2004), pp. 1582-1590.
12. G. Y. CHANG, G. H. CHEN, AND G. J. CHANG, (t, k)-diagnosis for matching composition networks, IEEE Trans. Comput., 55 (2006), pp. 88-92.
13. G. Y. CHANG, G. H. CHEN, AND G. J. CHANG, (t, k)-diagnosis for matching composition networks under the MM* model, IEEE Trans. Comput., 56 (2007), pp. 73-79.
14. 2.5) fault identification algorithm for diagnosable system, IEEE Trans. Comput., 33 (1984), pp. 486-492.
15. J. FAN, Diagnosability of the Möbius cubes, IEEE Trans. Parallel Distributed Systems, 9 (1998), pp. 923-927.
16. J. FAN, Diagnosability of crossed cubes under the comparison diagnosis model, IEEE Trans. Parallel Distributed Systems, 13 (2002), pp. 687-692.
17. A. D. FRIEDMAN AND L. SIMONCINI, System-level fault diagnosis, Comput. J., 13 (1980), pp. 47-53.
18. H. FUJIWARA AND K. KINOSHITA, On the computational complexity of system diagnosis, IEEE Trans. Comput., 27 (1978), pp. 881-885.
19. S. L. HAKIMI AND A. T. AMIN, Characterization of connection assignment, IEEE Trans. Comput., 23 (1974), pp. 86-88.
20. A. KAVLANPOUR, Sequential diagnosability of star graphs, Computers & Electrical Engineering, 22 (1996), pp. 37-44.
21. A. KAVIANPOUR AND K. H. KIM, Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy, IEEE Trans. Comput., 40 (1991), pp. 232-237.
22. S. KHANNA AND W. K. FUCHS, A linear time algorithm for sequential diagnosis in hypercubes, J. Parallel Distributed Computing, 26 (1995), pp. 38-53.
23. S. KHANNA AND W. K. FUCHS, A graph partitioning approach to sequential diagnosis, IEEE Trans. Comput., 46 (1997), pp. 39-47.
24. P. L. LAI, J. M. TAN, C. H. TSAI, AND L. H. HSU, The diagnosability of the matching composition network under the comparison diagnosis model, IEEE Trans. Comput., 53 (2004), pp. 1064-1069.
25. P. L. LAI, J. M. TAN, C. P. CHANG, AND L. H. HSU, Conditional diagnosability measures for large multiprocessor systems, IEEE Trans. Comput., 54 (2005), pp. 165-175.
26. I. LEADER, Discrete isoperimetric inequalities, in Probabilistic Combinatonics and Its Applications, Proc. Sympos. Appl. Math. 44, AMS, Providence, RI, 1991, pp. 57-80.
27. F. P. PREPARATA, G. METZE, AND R. T. CHIEN, On the connection assignment problem of diagnosable systems, IEEE Trans. Electronic Comput., EC-16 (1967), pp. 848-854.
28. P. SANTI AND S. CHESSA, Reducing the number of sequential diagnosis iterations in hypercubes, IEEE Trans. Comput., 43 (2004), pp. 89-92.
29. A. SENGUPTA AND A. T. DAHBURA, On self-diagnosable multiprocessor systems: Diagnosis by the comparison approach, IEEE Trans. Comput., 41 (1992), pp. 1386-1396.
30. D. WANG, Diagnosability of enhanced hypercubes, IEEE Trans. Comput., 43 (1994), pp. 1054-1061.
31. D. WANG, Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model, IEEE Trans. Comput., 48 (1999), pp. 1369-1374.
32. D. B. WEST, Introduction to Graph Theory, 2nd ed., Prentice Hall, Upper Saddle River, NJ, 2001.