An Efficient Routing Algorithm for an Injured Mesh Embedded Hypercube Interconnection Network

Kini, Gopalakrishna N and Kumar, Sathish M and Mruthyunjaya, H.S (2009) An Efficient Routing Algorithm for an Injured Mesh Embedded Hypercube Interconnection Network. In: International Conference on Electronic Design and Signal Processing, Dec 10-12, 2009., Manipal Institute of Technology, Manipal, India.

[img] PDF
2 ICEDSP 2009.pdf - Published Version
Restricted to Registered users only

Download (205kB) | Request a copy

Abstract

This paper describes a fault-tolerant communication scheme that facilitates optimal routing in mesh embedded hypercube interconnection networks subject to node failures in parallel computing. It is shown that by only using feasible paths routing can be substantially simplified. An efficient routing algorithm has been proposed that uses local information from every processor can route a message from a source node to the destination in presence of fault free or of single/multiple faulty nodes in mesh embedded hypercube interconnection networks

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Fault list, Fault tolerance, Embedded network, Mesh embedded hypercube network, routing
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Depositing User: MIT Library
Date Deposited: 20 Dec 2014 10:19
Last Modified: 20 Dec 2014 10:19
URI: http://eprints.manipal.edu/id/eprint/141328

Actions (login required)

View Item View Item