Efficiency of Lee´s routing algorithm on a transputer network

The authors present research into how efficient Lee´s routing algorithm could be on general-purpose parallel hardware such as a network of transputers. Several different versions of the software architecture for a transputer network were examined to assess how best to implement a parallel version of Lee´s algorithm. The simulations done show that the parallel versions are faster than the sequential version only if a great number of transputers are used and the small speedup obtained makes the tested methods not very cost effective