Sequential diagnosability of star graphs

Computers and Electrical Engineering

Volumn 22, Issue 1, 1996, Pages 37-44

  Kavianpour, Alireza ^a,b  

^a University Center   (United States)

^b DeVry Institute of Technology   (United States)

Author keywords

Diagnosability; Fault bound; Multi computer system; N star; Repair; Sequential diagnosis; System level diagnosis; Testing

Indexed keywords

COMPUTER SYSTEMS; COMPUTER TESTING; GRAPH THEORY; ITERATIVE METHODS; PROBABILITY; REPAIR;

DIAGNOSABILITY; FAULTY PROCESSORS; MEAN TIME TO FAILURE; MULTICOMPUTER SYSTEM; SEQUENTIAL DIAGNOSIS; SYSTEM LEVEL DIAGNOSIS;

COMPUTER AIDED DIAGNOSIS;

EID: 0029755875     PISSN: 00457906     EISSN: None     Source Type: Journal    
DOI: 10.1016/0045-7906(95)00028-3     Document Type: Article

References (16)

1. F. P. Preparata, G . Metze and R. T. Chien, On the connection assignment problem of diagnosable systems. IEEE Trans. Elec. Computers EC-16, 848-854 (1967).
2. P. Ciompi and L. Simoncini, Analysis and optimal design of self-diagnosable systems with repair. IEEE Trans. Computers C-28, 362-365 (1979).
3. A. Kavianpour and K. H. Kim, Diagnosabilities of hypercubes under two efficient processor-level diagnosis strategies. IEEE Trans. Computers C-40, 232-237 (1991).
4. A. Kavianpour and K. H. Kim, A comparative evaluation of four basic system-level diagnosis strategy for hypercubes. IEEE Trans. Reliability 41, 26-37 (1992).
5. A. Kavianpour, System-level diagnosis strategies for n - star multiprocessor systems. Int. Conf. Parallel Processing, 297-300 (1993).
6. U. Manber, System diagnosis with repair. IEEE Trans. Computers C-29, 934-937 (1980).
7. F. P. Preparata, Some results on sequentially diagnosable systems. Proc. Hawaii Int. Conf. System and Sci., 623-629 (1968).
8. A. Kavianpour and A. D. Friedman, Efficient design of easily diagnosable systems. Proc. 3rd U.S.A.-Japan Computer Conf., pp. 251-257 (1978).
9. S. B. Akers, D. Harel and B. Krishnamurthy, The star graph: an attractive alternative to the n-cube. Int. Conf. Parallel Processing, pp. 393-400 (1987).
10. K. Qui, H. Meijer and S. G. Akl, Decomposing a star graph into disjoint cycles. Inf. Processing Lett. 39, 125-129 (1991).
11. S. Latifi and N. Bagherzadeh, The clustered-star graph: a new topology for large interconnection networks. Int. Parallel Processing Symp., pp. 514-518 (1993).
12. S. L. Hakimi and A. T. Amin, Characterization of connection assignment of diagnosable systems. IEEE Trans. Computers C-23, 86-88 (1974).
13. M. Nigam, S. Sahni and B. Krishnamurthy, Embedding Hamiltonians and hypercubes in star interconnection graphs. Int. Conf. Parallel Processing, pp. 340-343 (1990).
14. C. Kime, System diagnosis. In Fault-Tolerant Computing: Theory and Techniques (Edited by D. K. Pradhan). Prentice-Hall, Englewood Cliffs, New Jersey (1985).
15. J. D. Russell and C. R. Kime, System fault diagnosis: closure and diagnosability with repair. IEEE Trans. Computers C-24, 1078-1089 (1980).
16. S. Huang, J. Xu and T. Chen, Characterization and design of sequentially t-diagnosable systems. Fault-Tolerant Computing, pp. 554-559 (1989).