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

Real-time fault-tolerant hypercube multicomputer

Real-time 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.

© IEE
Published

A real-time fault-tolerant design for a d-dimensional hypercube multiprocessor with two modes of operation is presented and its reconfigurability is examined. The augmented hypercube, at stage one, 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. At stage two, the process is repeated by assigning one spare node to each (d−i−j)-dimensional spare subcube of stage one. Two modes of operations are considered, one under heavy computation or hard deadline and the other under light computation or soft deadline. By utilising the capabilities of wave-switching communication modules of the spare nodes, faulty nodes and faulty links can be tolerated. Both theoretical and experimental results are presented. Compared with other proposed schemes, the proposed approach can tolerate significantly more faulty components with a low overhead and no performance degradation.

Inspec keywords: hypercube networks; fault tolerant computing; real-time systems

Other keywords: reconfigurability; faulty nodes; real-time fault-tolerant design; hypercube multiprocessor; faulty links; real-time fault-tolerant hypercube multicomputer; wave-switching communication modules

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

References

    1. 1)
      • Banerjee, P.: `Strategies for reconfiguring hypercubes under faults', Proceedings of the IEEE International symposium on fault tolerant computing, 1990, p. 210–217.
    2. 2)
      • Duato, J., Lopez, P., Yalamanchili, S.: `Deadlock- and livelock-free routing protocols for wave switching', Proceedings of the 11th International parallel processing symposium, April 1997, p. 570–577.
    3. 3)
      • R. Libeskind-Hadas , N. Shrivastava , R. Melhem , C. Liu . Optimal reconfiguration algorithms for real-time fault-tolerant processor arrays. IEEE Trans. Parallel Distrib. Syst. , 498 - 510
    4. 4)
      • Bruck, J., Cypher, R., Ho, C.T.: `Efficient fault-tolerant mesh and hypercube architectures', Proceedings of the 22nd Annual international symposium on Fault tolerant computing, 1992, p. 162–169.
    5. 5)
      • Bruck, J., Cypher, R., Ho, C.T.: `Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes', Proceedings of the 23rd Annual international symposium on Fault tolerant computing, 1993, p. 260–267.
    6. 6)
      • 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
    7. 7)
      • Y. Saad , M.H. Schultz . Topological properties of hypercubes. IEEE Trans. Comput. , 867 - 872
    8. 8)
      • 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, 1991, p. 711–714.
    9. 9)
      • Alam, M., Melhem, R.: `Channel multiplexing in modular fault tolerant multiprocessors', Proceedings of the IEEE International conference on Parallel processing, 1991, p. I492–I496.
    10. 10)
      • J. Dongarra , D. Walker . The quest for petascale computing. IEEE Comput. Sci. Eng. , 32 - 39
    11. 11)
      • Izadi, B.: `Design of fault-tolerant distributed memory multiprocessors', 1995, PhD, The Ohio State University.
    12. 12)
      • P. Banerjee , M. Peercy . Design and evaluation of hardware strategies for recon-figuring hypercubes and meshes under faults. IEEE Trans. Comput. , 841 - 848
    13. 13)
      • A. Tucker . (1994) Applied combinatorics.
    14. 14)
      • P. Banerjee , J. Rahmeh , C. Stunkel , V. Nair , K. Roy , V. Balasubramanian , J. Abraham . Algorithm-based fault tolerance on a hypercube multiprocessor. IEEE Trans. Comput. , 1132 - 1145
    15. 15)
      • C.Y. Lee . An algorithm for path connection and its applications. IRE Trans. Electron. Comput. , 346 - 365
    16. 16)
      • Chau, S.C., Liestman, A.L.: `A proposal for a fault-tolerant binary hypercubes architecture', Proceedings of the IEEE International symposium on fault tolerant computing, 1989, p. 323–330.
    17. 17)
      • B. Izadi , B. Özgüner , A. Acan . Highly fault-tolerant hypercube multicomputer. IEE Proc., Comput. Digit. Tech. , 77 - 82
    18. 18)
      • S. Dutt , J.P. Hayes . Designing fault-tolerant systems using automorphisms. J. Parallel Distrib. Comput. , 249 - 268
    19. 19)
      • J.P. Hayes . A graph model for fault-tolerant computing systems. IEEE Trans. Comput. , 875 - 884
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_20020720
Loading

Related content

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