Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Highly fault-tolerant hypercube multicomputer

Highly fault-tolerant hypercube multicomputer

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

  • Author(s): B. A. Izadi 1 ; F. Özgüner 2 ; A. Acan 3
    • View affiliations
    • Affiliations: 1: Dept. of Electrical and Computer Engineering, State University of New York, New Paltz
      2: Department of Electrical Engneering, Ohio State University, Columbus, USA
      3: Computer Engineering Dept., Eastern Mediterranean University, Gazi Magosa, TURKEY
  • Source: Volume 146, Issue 2, March 1999, p. 77 – 82
    DOI:  10.1049/ip-cdt:19990181 , Print ISSN 1350-2387, Online ISSN 1359-7027
IEE
Published

A strongly fault-tolerant design for a d-dimensional hypercube multiprocessor is presented and its reconfigurability examined. The augmented hypercube has a spare node connected to each node of a subcube of dimension i, and the spare nodes are also connected as a (d−i)-dimensional hypercube. By utilising the circuit-switched capabilities of the communication modules of the spare nodes, a large number of faulty nodes and faulty links can be tolerated. Both theoretical and experimental results are presented. Compared with other proposed schemes the approach can tolerate significantly more faulty nodes and faulty links with a low overhead and no performance degradation.

Inspec keywords: reconfigurable architectures; fault tolerant computing; hypercube networks; multiprocessing systems

Other keywords: low overhead; aucountsional hypercube multiprocessor; faulty links; faulty nodes; reconfigurability; fault-tolerant; performance degradation

Subjects: Multiprocessing systems; Multiprocessor interconnection; Parallel architecture; Performance evaluation and testing

References

    1. 1)
      • P. HAYES . A graph model for fault-tolerant computing systems. IEEE Trans. , 875 - 884
    2. 2)
      • C.Y. LEE . An algorithm for path connection and its applications. IRE Trans. , 346 - 365
    3. 3)
      • BANERJEE, P.: `Strategies for reconfiguring hypercubes under faults', Proceedings of the IEEE international symposium on Fault-tolerant computing, 1990, New Castle-upon-Tyne, UK, p. 210–217.
    4. 4)
      • IZADI, B., ÖZGÜNER, F.: `A highly fault-tolerant circuit-switched hypercube', Proceedings of IASTED international conference on Parallel and distributed systems, June 1997, Barcelona, Spain, p. 9–14.
    5. 5)
      • P. BANERJEE , J. RAHMEH , C. STUNKEL , V. NAIR , K. ROY , V. BALASUBRAMANIAN , J. ABRAHAM . Algorithm-based fault tolerance on a hypercube multiprocessor. IEEE Trans. , 1132 - 1145
    6. 6)
      • N. TZENG . A cube-connected cycles architecture with high reliability and improved performance. IEEE Trans. , 2 , 246 - 253
    7. 7)
      • S. LATIFI . Fault-tolerant hypercube multiprocessors. IEEE Trans. Reliab. , 3 , 361 - 368
    8. 8)
      • IZADI, B.: `Design of fault-tolerant distributed memory multiprocessors', 1995, PhD thesis, Ohio State University.
    9. 9)
      • C.J. COLBOURN . , The combinatorics of network reliability.
    10. 10)
      • BRUCK, J., CYPHER, R., HO, T.: `Efficient fault-tolerant mesh and hypercube architectures', Proceedings of the 22nd annual international symposium on Fault-tolerant computing, July 1992, Boston, Massachusetts, USA, p. 162–169.
    11. 11)
      • M. Alam , R. Melhem . An efficient modular spare allocation scheme and its application to fault tolerant binary hypercubes. IEEE Trans. Parallel Distrib. Syst. , 117 - 126
    12. 12)
      • P. BANERJEE , M. PEERCY . Design and evaluation of hardware strategies for reconfiguring hypercubes and meshes under faults. IEEE Trans. , 841 - 848
    13. 13)
      • IZADI, B., ÖZGÜNER, F.: `Spare allocation and reconfiguration in a fault tolerant hypercube with direct connect capability', Proceedings of the sixth conference on Distributed memory computing, April 1991, Portland, Oregon, USA, p. 711–714.
    14. 14)
      • ALAM, M., MELHEM, R.: `Channel multiplexing in modular fault tolerant multiprocessors', Proceedings of the IEEE international conference on Parallel processing, 1991, Bloomington, Illinois, USA, p. 1492–1496.
    15. 15)
      • S. DUTT , J.P. HAYES . Designing fault-tolerant systems using automorphisms. J. Parallel Distrib. Comput. , 12 , 249 - 268
    16. 16)
      • A. TUCKER . (1984) , Applied combinatorics.
    17. 17)
      • BRUCK, J., CYPHER, R., HO, T.: `Wildeard dimensions, coding theory and fault-tolerant meshes and hypercubes', Proceedings of the 23nd annual international symposium on Fault-tolerant computing, July 1993, Toulouse, France, p. 260–267.
    18. 18)
      • CHAU, C., LIESTMAN, A.L.: `A proposal for a fault-tolerant binary hypercubes architecture', Proceedings of the IEEE international symposium on Fault-tolerant computing, 1989, Chicago, Illinois, USA, p. 323–330.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_19990181
Loading

Related content

content/journals/10.1049/ip-cdt_19990181
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address