An adaptive routing tool for transputer-based architectures

A routing strategy is described, implemented for an object-oriented environment designed for a massively parallel architecture based on transputers, the MEIKO Computing Surface. The implemented routing algorithm belongs to the distance-vector family. The routing tool guarantees some pleasant properties: independence of topology, adaptability, nondeterministic behavior, and distribution of routing decision. The performance figures of the implementation are compared with the routing offered by CSSTools of MEIKO. The routing presented is adaptive and nondeterministic. It adapts both to traffic variation and to topology changes.<<ETX>>