On diagnosability of large multiprocessor networks

Discrete Applied Mathematics

Volumn 156, Issue 18, 2008, Pages 3464-3474

  Ahlswede, R ^a   Aydinian, H ^a  

^a BIELEFELD UNIVERSITY   (Germany)

Author keywords

Diagnosability; PMC model; Sequential diagnosis; System level diagnosis

Indexed keywords

ELECTRIC FAULT CURRENTS; KETONES; LEARNING ALGORITHMS; MULTIPROCESSING SYSTEMS;

ARBITRARY TOPOLOGIES; ASSIGNMENT PROBLEMS; CUBE SYSTEMS; DIAGNOSABILITY; DIAGNOSIS ALGORITHMS; DIAGNOSIS PROBLEMS; FAULT DIAGNOSIS; FAULTY PROCESSORS; INTERCONNECTION SYSTEMS; MULTIPROCESSOR NETWORKS; MULTIPROCESSOR SYSTEMS; ONE STEPS; PMC MODEL; SEQUENTIAL DIAGNOSES; SEQUENTIAL DIAGNOSIS; SYSTEM-LEVEL DIAGNOSIS; T-DIAGNOSABLE; TEST RESULTS; THEORETICAL MODELS; WORST CASES;

SEQUENTIAL SWITCHING;

EID: 55349095787     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.02.001     Document Type: Article

References (16)

1. Ahlswede R., and Katona G.O.H. Contributions to the geometry of Hamming spaces. Discrete Math. 17 (1977) 1-22
2. Ahlswede R., and Koschnick K.U. Note on an extremal problem arising for unreliable networks in parallel computing. Discrete Math. 47 (1983) 137-152
3. Aslanian L.A. An isoperimetric problem and related extremal problems for discrete spaces. Probl. Kibernetiki 36 (1979) 85-127 (in Russian)
4. Barborak M., Malek M., and Dahbura A. The consensus problem in fault-tolerant computing. ACM Comput. Surveys 25 2 (1993) 171-220
5. Caruso A., Chessa S., Maestrini P., and Santi P. Diagnosability of regular systems. J. Algorithms 45 (2002) 126-143
6. Frankl P. A lower bound on the size of a complex generated by an antichain. Discrete Math. 76 1 (1989) 51-56
7. Harper L.H. Optimal numberings and isoperimetric problems on graphs. J. Combin. Theory 1 (1966) 385-395
8. Katona G.O.H. The Hamming sphere has minimum boundary. Studia Scient. Math. Hungarica 10 (1975) 131-140
9. Khanna S., and Fuchs W.K. A graph partitioning approach to sequential diagnosis. IEEE Trans. Comput. 46 1 (1996) 39-47
10. Kleitman D.J. On a problem of Yuzvinsky on separating the n-cube. Discrete Math. 60 (1986) 207-213
11. MacWilliams F.J., and Sloane N.J.A. The Theory of Error Correcting Codes (1977), North Holland Mathematical Library
12. Preparata F.P., Metze G., and Chien R.T. On the connection assignment problem of diagnosable systems. IEEE Trans. Comput. EC 16 12 (1967) 848-854
13. Raghavan V., and Tripathi A. Sequential diagnosability is co-NP complete. IEEE Trans. Comput. 40 5 (1991) 584-595
14. Russell J.D., and Kime C.R. System fault diagnosis: Closure and diagnosability with repair. IEEE Trans. Comput. C-24 (1975) 1078-1089
15. Santi P., and Chessa S. Reducing the number of sequential diagnosis iterations in hypercubes. IEEE Trans. Comput. 53 (2004) 89-92
16. Yamada T., Otsuka T., Watanabe A., and Ueno S. On sequential diagnosis of multiprocessor systems. Discrete Appl. Math. 146 (2005) 311-342