메뉴 건너뛰기




Volumn 172, Issue 3-4, 2005, Pages 309-333

An efficient reconfiguration scheme for fault-tolerant meshes

Author keywords

Fault tolerance; Local and global reconfigurations; Meshes; Node replacement; Performance evaluation; Reconfiguration algorithms; Reconfiguration schemes; Spare allocation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES; RESOURCE ALLOCATION; TOPOLOGY; VLSI CIRCUITS;

EID: 18544370554     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2004.05.003     Document Type: Article
Times cited : (18)

References (21)
  • 1
    • 0024104959 scopus 로고
    • Interstitial redundancy: An area efficient fault-tolerant scheme for large area VLSI processor arrays
    • A. Singh Interstitial redundancy: an area efficient fault-tolerant scheme for large area VLSI processor arrays IEEE Trans. Comput. 37 11 1988 1398 1410
    • (1988) IEEE Trans. Comput. , vol.37 , Issue.11 , pp. 1398-1410
    • Singh, A.1
  • 2
    • 0029406232 scopus 로고
    • Routing in modular fault-tolerant multiprocessor systems
    • M. Alam, and R. Melhem Routing in modular fault-tolerant multiprocessor systems IEEE Trans. Parallel Distrib. Syst. 6 11 1995 1206 1220
    • (1995) IEEE Trans. Parallel Distrib. Syst. , vol.6 , Issue.11 , pp. 1206-1220
    • Alam, M.1    Melhem, R.2
  • 3
    • 0029714852 scopus 로고    scopus 로고
    • Spare processor allocation for fault tolerance in torus-based multicomputers
    • M. Bae, B. Bose, Spare processor allocation for fault tolerance in torus-based multicomputers, in: Proc. 26th Int'l Symp. on Fault-Tolerant Computing, 1996, pp. 282-290
    • (1996) Proc. 26th Int'l Symp. on Fault-tolerant Computing , pp. 282-290
    • Bae, M.1    Bose, B.2
  • 4
    • 0011362566 scopus 로고
    • Channel multiplexing in modular fault tolerant multiprocessors
    • M. Alam, R. Melhem, Channel multiplexing in modular fault tolerant multiprocessors, in: Proc. 1991 Int'l Conf. on Parallel Processing, vol. I, 1991, pp. 492-496
    • (1991) Proc. 1991 Int'l Conf. on Parallel Processing , vol.1 , pp. 492-496
    • Alam, M.1    Melhem, R.2
  • 5
    • 0025889226 scopus 로고
    • An efficient modular spare allocation scheme and its application to fault tolerant binary hypercubes
    • M. Alam, and R. Melhem An efficient modular spare allocation scheme and its application to fault tolerant binary hypercubes IEEE Trans. Parallel Distrib. Syst. 2 1 1991 117 126
    • (1991) IEEE Trans. Parallel Distrib. Syst. , vol.2 , Issue.1 , pp. 117-126
    • Alam, M.1    Melhem, R.2
  • 6
    • 0035202596 scopus 로고    scopus 로고
    • Built-in self-reconfiguring systems for fault tolerant mesh-connected processor arrays by direct spare replacement
    • October
    • I. Takanami, Built-in self-reconfiguring systems for fault tolerant mesh-connected processor arrays by direct spare replacement, in: Proc. 2001 IEEE Int'l Symp. on Defect and Fault Tolerance in VLSI Systems, October 2001, pp. 134-142
    • (2001) Proc. 2001 IEEE Int'l Symp. on Defect and Fault Tolerance in VLSI Systems , pp. 134-142
    • Takanami, I.1
  • 8
    • 0028464805 scopus 로고
    • Design and evaluation of hardware strategies for reconfiguring hypercubes and meshes under faults
    • P. Banerjee, and M. Peercy Design and evaluation of hardware strategies for reconfiguring hypercubes and meshes under faults IEEE Trans. Comput. 43 7 1994 841 848
    • (1994) IEEE Trans. Comput. , vol.43 , Issue.7 , pp. 841-848
    • Banerjee, P.1    Peercy, M.2
  • 11
    • 0027837834 scopus 로고
    • Fast polylog-time reconfiguration of structurally fault-tolerant multiprocessors
    • S. Dutt Fast polylog-time reconfiguration of structurally fault-tolerant multiprocessors IEEE Symp. Parallel Distrib. Process. 1993 161 169
    • (1993) IEEE Symp. Parallel Distrib. Process. , pp. 161-169
    • Dutt, S.1
  • 12
    • 0026188277 scopus 로고
    • Designing fault-tolerant systems using automorphisms
    • S. Dutt, and J.P. Hayes Designing fault-tolerant systems using automorphisms J. Parallel Distrib. Comput. 12 1991 249 268
    • (1991) J. Parallel Distrib. Comput. , vol.12 , pp. 249-268
    • Dutt, S.1    Hayes, J.P.2
  • 13
    • 0034187233 scopus 로고    scopus 로고
    • Fault-tolerant processor arrays using additional bypass linking allocated by graph-node coloring
    • N. Tsuda Fault-tolerant processor arrays using additional bypass linking allocated by graph-node coloring IEEE Trans. Comput. 49 5 2000 431 442
    • (2000) IEEE Trans. Comput. , vol.49 , Issue.5 , pp. 431-442
    • Tsuda, N.1
  • 14
    • 0031117709 scopus 로고    scopus 로고
    • Systematic design of fault-tolerant multiprocessors with shared buses
    • H. Ku, and J. Hayes Systematic design of fault-tolerant multiprocessors with shared buses IEEE Trans. Comput. 46 4 1997 439 455
    • (1997) IEEE Trans. Comput. , vol.46 , Issue.4 , pp. 439-455
    • Ku, H.1    Hayes, J.2
  • 17
    • 0034204957 scopus 로고    scopus 로고
    • Fault-tolerant processor arrrays based on 1(1/2)-track switches with flexible spare distribution
    • T. Horita, and I. Takanami Fault-tolerant processor arrrays based on 1(1/2)-track switches with flexible spare distribution IEEE Trans. Comput. 49 6 2000 542 552
    • (2000) IEEE Trans. Comput. , vol.49 , Issue.6 , pp. 542-552
    • Horita, T.1    Takanami, I.2
  • 18
    • 0011320485 scopus 로고
    • Spare allocation and reconfiguration in a fault tolerant hypercube with direct connect capability
    • B.A. Izadi, F. Ozguner, Spare allocation and reconfiguration in a fault tolerant hypercube with direct connect capability, in: Proc. 6th Distributed Memory Computing Conference, 1991, pp. 711-714
    • (1991) Proc. 6th Distributed Memory Computing Conference , pp. 711-714
    • Izadi, B.A.1    Ozguner, F.2
  • 21
    • 0000452250 scopus 로고
    • Graphs with circulant adjacency matrices
    • B. Elspas, and J. Turner Graphs with circulant adjacency matrices J. Comb. Theory 9 1970 297 307
    • (1970) J. Comb. Theory , Issue.9 , pp. 297-307
    • Elspas, B.1    Turner, J.2


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