PERFORMANCE ENHANCEMENT IN IRREGULAR NETWORK USING MULTIPLE ROOT

Irregular network is one of cheaper option for high-parallel performance computing from chip level to large workstation. Irregular networks provide wire flexibility as well as scalable system. But Irregular network always have problem of deadlock in routing and channel utilization. Different solution has been already proposed such as Prefix Routing [1], Up/Down Routing [1], L-turn routing [2], cut Through Switching [9],Wormhole switching [3]. But all these algorithms have different performance in different networks means their performance is depended on network topology and root that is selected during routing in directional routing and prefix routing. In this paper we have proposed a methodology by which we can select a better root for spanning tree, some solution to improve over all utilization of channel for Up/down algorithms and prefix Routing [1].

DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING

We propose a deadlock-free routing scheme in irregular networks using prefix routing. Prefix routing is a special type of routing with a compact routing table associated with each node (processor). Basically, each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a prefix of the label of the destination node. Node and channel labeling in an irregular network is done through constructing a spanning tree. The routing process follows a two-phase process of going up and then down along the spanning tree, with a possible cross channel (shortcut) between two branches of the tree between two phases. We show that the proposed routing scheme is deadlock- and livelock-free. We also compare prefix routing with the existing up*/down* routing which has been widely used in irregular networks. Possible extensions are also discussed.