Modified Scheme for the Up*/Down* Routing Algorithm
GE Jian-fang · Mini-micro Systems · 2004
Network of workstations(NOWs) are rapidly emerging as a cost-effective alternative to parallel computers. Many NOWs are arranged as a swith-based network with irregular topology, which makes routing and deadlock avoidance quite complicated. The up*/down* routing is broadly used in irregular networks. However, this strategy assigns direction to the operation links radomly, and it follows that most minimal paths are forbidden. Proposed a new methodology to assing direction based on the greedy alogrithm. The methodology can reduce the percentage of prohibited turns, and made a better traffic balancing. The simulation result indicate that the new routing algorithm based on the new methodology can improve the performance of the network signficantly.