메뉴 건너뛰기




Volumn 146, Issue 3, 2005, Pages 311-342

On sequential diagnosis of multiprocessor systems

Author keywords

Cube connected cycles; de Bruijn network; Degree of sequential diagnosability; Grid; Hypercube; K ary tree; Shuffle exchange network; System diagnosis; Torus

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; DIAGNOSIS; FAULT TOLERANT COMPUTER SYSTEMS; SET THEORY; TREES (MATHEMATICS);

EID: 12344326756     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.08.008     Document Type: Article
Times cited : (16)

References (14)
  • 2
    • 0001966949 scopus 로고
    • The cube-connected cycles network is a subgraph of the butterfly network
    • R. Feldmann, and W. Unger The cube-connected cycles network is a subgraph of the butterfly network Para. Process. Lett. 2 1 1992 13 19
    • (1992) Para. Process. Lett. , vol.2 , Issue.1 , pp. 13-19
    • Feldmann, R.1    Unger, W.2
  • 3
    • 84947657515 scopus 로고
    • Characterization of connection assignment of diagnosable systems
    • S.L. Hakimi, and A.T. Amin Characterization of connection assignment of diagnosable systems IEEE Trans. Comput. 23 1974 86 88
    • (1974) IEEE Trans. Comput. , vol.23 , pp. 86-88
    • Hakimi, S.L.1    Amin, A.T.2
  • 4
    • 0026838054 scopus 로고
    • A comparative evaluation of four basic system-level diagnosis strategies for hypercubes
    • A. Kavianpour, and K.H. Kim A comparative evaluation of four basic system-level diagnosis strategies for hypercubes IEEE Trans. Reliabil. 41 1992 26 37
    • (1992) IEEE Trans. Reliabil. , vol.41 , pp. 26-37
    • Kavianpour, A.1    Kim, K.H.2
  • 5
    • 0041456195 scopus 로고
    • A linear time algorithm for sequential diagnosis in hypercubes
    • S. Khanna, and W.K. Fuchs A linear time algorithm for sequential diagnosis in hypercubes J. Parallel and Distributed Comput. 26 1 1992 48 53
    • (1992) J. Parallel and Distributed Comput. , vol.26 , Issue.1 , pp. 48-53
    • Khanna, S.1    Fuchs, W.K.2
  • 6
    • 0031363806 scopus 로고    scopus 로고
    • A graph partitioning approach to sequential diagnosis
    • S. Khanna, and W.K. Fuchs A graph partitioning approach to sequential diagnosis IEEE Trans. Computers 46 1997 39 47
    • (1997) IEEE Trans. Computers , vol.46 , pp. 39-47
    • Khanna, S.1    Fuchs, W.K.2
  • 7
    • 38249038726 scopus 로고
    • On a problem of yuzvinsky on separating the n-cube
    • D.J. Kleitman On a problem of yuzvinsky on separating the n-cube Discrete Math. 60 1986 207 213
    • (1986) Discrete Math. , vol.60 , pp. 207-213
    • Kleitman, D.J.1
  • 8
    • 12344268613 scopus 로고    scopus 로고
    • Upper bounds for the degree of sequential diagnosability
    • IPSJ
    • T. Ohtsuka, S. Ueno, Upper bounds for the degree of sequential diagnosability, Technical Report 97-AL-59, IPSJ, 1997.
    • (1997) Technical Report , vol.97 AL-59
    • Ohtsuka, T.1    Ueno, S.2
  • 11
    • 0026156804 scopus 로고
    • Sequential diagnosis is co-NP complete
    • V. Raghavan, and A. Tripathi Sequential diagnosis is co-NP complete IEEE Trans. Comput. 40 1991 584 595
    • (1991) IEEE Trans. Comput. , vol.40 , pp. 584-595
    • Raghavan, V.1    Tripathi, A.2
  • 12
    • 0009584486 scopus 로고
    • Optimality of a VLSI decomposition scheme for the deBruijn graph
    • E.J. Schwabe Optimality of a VLSI decomposition scheme for the deBruijn graph Parallel Process. Lett. 3 3 1993 261 265
    • (1993) Parallel Process. Lett. , vol.3 , Issue.3 , pp. 261-265
    • Schwabe, E.J.1
  • 13
    • 2342660198 scopus 로고    scopus 로고
    • Bounds for the degree of sequential diagnosability for CCC's
    • IEICE
    • A. Watanabe, T. Yamada, S. Ueno, Bounds for the degree of sequential diagnosability for CCC's, Technical Report CAS99-96, IEICE, 1999.
    • (1999) Technical Report , vol.CAS99-96
    • Watanabe, A.1    Yamada, T.2    Ueno, S.3


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