Parallel Routing Algorithms
Aleksei Korsakov and Helmut Weberpals
Research period: 1996-1997
The performance of a parallel computer depends on its processor nodes as well as on its processor network. The performance of the network, in turn, depends on its hardware parameters, bandwidth and latency, and on its routing scheme, the way in which messages are being steered through the network.
In order to evaluate routing algorithms experimentally we developed an object-oriented router which uses only the interconnection to its neighbours and implements routing and flow control in software. The test bed allows the network to be tested with respect to different communication patterns and routing algorithms. The experimental results are in favour of adaptive routing algorithms.