메뉴 건너뛰기




Volumn 46, Issue 6, 2000, Pages 519-527

The diagnosability of hypercubes with arbitrarily missing links

Author keywords

Diagnosability; Diagnosis; Fault tolerance; Graph theory; Hypercubes; Link failure; Multiprocessor networks

Indexed keywords


EID: 0347316223     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(99)00015-6     Document Type: Article
Times cited : (23)

References (17)
  • 1
    • 0019599993 scopus 로고
    • Fault diagnosis in a Boolean n cube array of microprocessors
    • J.R. Armstrong, F.G. Gray, Fault diagnosis in a Boolean n cube array of microprocessors, IEEE Trans. Comput. C-30 (8) (1981) 587-590.
    • (1981) IEEE Trans. Comput. , vol.C-30 , Issue.8 , pp. 587-590
    • Armstrong, J.R.1    Gray, F.G.2
  • 2
    • 0016962991 scopus 로고
    • A theory of diagnosability of digital systems
    • F. Barsi, F. Grandoni, P. Maestrini, A theory of diagnosability of digital systems, IEEE Trans. Comput. C-25 (1976) 585-593.
    • (1976) IEEE Trans. Comput. , vol.C-25 , pp. 585-593
    • Barsi, F.1    Grandoni, F.2    Maestrini, P.3
  • 4
    • 84947657515 scopus 로고
    • Characterization of the connection assignment of diagnosable systems
    • S.L. Hakimi, A.T. Amin, Characterization of the connection assignment of diagnosable systems, IEEE Trans. Comput. C-23 (1) (1974) 86-88.
    • (1974) IEEE Trans. Comput. , vol.C-23 , Issue.1 , pp. 86-88
    • Hakimi, S.L.1    Amin, A.T.2
  • 6
  • 7
    • 0026108253 scopus 로고
    • Diagnosabilities of Hypercube under the pessimistic one-step diagnosis straegy
    • A. Kavianpour, K.H. Kim, Diagnosabilities of Hypercube under the pessimistic one-step diagnosis straegy, IEEE Trans. Comput. 40 (2) (1991) 232-237.
    • (1991) IEEE Trans. Comput. , vol.40 , Issue.2 , pp. 232-237
    • Kavianpour, A.1    Kim, K.H.2
  • 9
    • 0018033232 scopus 로고
    • An efficient fault diagnosis algorithm for symmetric multiple processor architectures
    • G.G.L. Meyer, G.M. Masson, An efficient fault diagnosis algorithm for symmetric multiple processor architectures, IEEE Trans. Comput. C-27 (1978) 1059-1063.
    • (1978) IEEE Trans. Comput. , vol.C-27 , pp. 1059-1063
    • Meyer, G.G.L.1    Masson, G.M.2
  • 10
    • 0022808977 scopus 로고
    • An algorithm for determining the fault diagnosability of a system
    • J. Narasimhan, K. Nakajima, An algorithm for determining the fault diagnosability of a system, IEEE Trans. Comput. C-35 (11) (1986) 1004-1008.
    • (1986) IEEE Trans. Comput. , vol.C-35 , Issue.11 , pp. 1004-1008
    • Narasimhan, J.1    Nakajima, K.2
  • 11
    • 84938017623 scopus 로고
    • On the connection assignment problem of diagnosable systems
    • F.P. Preparata, G. Metze, R.T. Chien, On the connection assignment problem of diagnosable systems, IEEE Trans. Electron. Comput. EC-16 (12) (1967) 848-854.
    • (1967) IEEE Trans. Electron. Comput. , vol.EC-16 , Issue.12 , pp. 848-854
    • Preparata, F.P.1    Metze, G.2    Chien, R.T.3
  • 12
    • 0026108312 scopus 로고
    • Improved diagnosability algorithms
    • V. Raghavan, A.R. Tripathi, Improved diagnosability algorithms, IEEE Trans. Comput. 40 (2) (1991) 143-153.
    • (1991) IEEE Trans. Comput. , vol.40 , Issue.2 , pp. 143-153
    • Raghavan, V.1    Tripathi, A.R.2
  • 13
    • 0021793126 scopus 로고
    • The cosmic cube
    • C.L. Seitz, The cosmic cube, Commun. ACM 28 (1) (1985) 22-23.
    • (1985) Commun. ACM , vol.28 , Issue.1 , pp. 22-23
    • Seitz, C.L.1
  • 14
    • 0021542893 scopus 로고
    • A polynomial time algorithm for fault diagnosability
    • IEEE Computer Society, October
    • G.F. Sullivan, A polynomial time algorithm for fault diagnosability, in: Proc. 25th Annu. Symp. Foundations Comput. Sei., IEEE Computer Society, October 1984, pp. 148-156.
    • (1984) Proc. 25th Annu. Symp. Foundations Comput. Sei. , pp. 148-156
    • Sullivan, G.F.1
  • 15
    • 0001135783 scopus 로고
    • Diagnosability of enhanced hypercubes
    • D. Wang, Diagnosability of enhanced hypercubes, IEEE Trans. Comput. 43 (9) (1994) 1054-1061.
    • (1994) IEEE Trans. Comput. , vol.43 , Issue.9 , pp. 1054-1061
    • Wang, D.1
  • 16
    • 0001270387 scopus 로고
    • Congruent graphs and the connectivity of graphs
    • H. Whitney, Congruent graphs and the connectivity of graphs, Am. J. Math. 54 (1932) 150-168.
    • (1932) Am. J. Math. , vol.54 , pp. 150-168
    • Whitney, H.1
  • 17
    • 0031065864 scopus 로고    scopus 로고
    • Minimum assignment of test links for hypercubes with lower fault bounds
    • D. Wang, Z. Wang, Minimum assignment of test links for hypercubes with lower fault bounds, J. Parallel Distributed Comput. 40 (2) (1997) 185-193.
    • (1997) J. Parallel Distributed Comput. , vol.40 , Issue.2 , pp. 185-193
    • Wang, D.1    Wang, Z.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.