Data Structures and Algorithms

   

Fault Tolerant Hierarchical Interconnection Network for Parallel Computers (FTH)

Authors: Rajashree Sukla, Chinmaya Kumar Nayak

In this paper we introduce a new interconnection network Fault Tolerant Hierarchical Interconnection network for parallel Computers denoted by FTH(k, 1).This network has fault tolerant hierarchical structure which overcomes the fault tolerant properties of Extended hypercube(EH).This network has low diameter, constant degree connectivity and low message traffic density in comparisons with other hypercube type networks like extended hypercube and hypercube. In this network we proposed the fault tolerant algorithm for node fault and also we introduce the hamiltonian Circuit for the proposed network FTH(k,2).

Comments: 8 Pages.

Download: PDF

Submission history

[v1] 2016-01-09 22:32:00

Unique-IP document downloads: 34 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus