Adaptive Algorithms for Wormhole-Routed Single-Port Mesh-Hypercube Network
In this research, adaptive wormhole routing algorithms are proposed. The algorithms presented for both unicast and multicast communication for single-port Mesh Hypercube (MH) network. MH introduced as a new interconnection network for parallel systems. The basic structure for it is a blend of both mesh and hypercube networks. It combines the desirable features of both the hypercube and the mesh, while at the same time overcoming their disadvantages. The proposed algorithms are based on node labeling technique, which is shown to prevent deadlock problem without requiring virtual channels. The multicast routing algorithm efficiency affected by the order in which the destinations are visited. The presented algorithm capable of ordering m destinations in a multicast message in O(m log m) time complexity. Both unicast and multicast routing algorithms make use of the node labeling technique to route the messages through the network without creating cycle, and hence, avoid any cyclic dependencies between nodes that may create deadlock.
Keywords: Wormhole, Adaptive, Routing, Multi-path, Single-port, Mesh-Hypercube
Download Full-Text
ABOUT THE AUTHOR
Mahmoud Omari
Applied Science University
Mahmoud Omari
Applied Science University