Subscribe Now Subscribe Today
Science Alert
Curve Top
Journal of Applied Sciences
  Year: 2004 | Volume: 4 | Issue: 4 | Page No.: 568-574
DOI: 10.3923/jas.2004.568.574
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Adaptive Wormhole Routing in Mesh-Hypercube Network

Bassam Al-Mahadeen and Mahmoud Omari

The aim of this research was the development of wormhole routing algorithms for the Mesh Hypercube (MH) network. MH has been introduced as a new interconnection network for parallel systems. The basic structure for this network is a combination of both mesh and hypercube networks. It combines the attractive features of both the hypercube and the mesh, while at the same time overcoming their disadvantages. Attractive features of the MH are high connectivity, simple message routing, fault-tolerance, scalability, constant node degree and small diameter and average distance. This research introduced two wormhole routing algorithms for unicast and multicast communication. These algorithms are based on labeling the nodes in the network to prevent deadlock and livelock problems. Messages are allowed to travel in ascending order or descending order of labels only to prevent any cyclic dependencies between nodes. The algorithms are shown to be deadlock-free and livelock-free.
PDF References Citation Report Citation
  •    Simulation and Analysis of Multicast Routing Algorithm for 2-D Mesh Network on Chip
How to cite this article:

Bassam Al-Mahadeen and Mahmoud Omari , 2004. Adaptive Wormhole Routing in Mesh-Hypercube Network. Journal of Applied Sciences, 4: 568-574.

DOI: 10.3923/jas.2004.568.574






Curve Bottom