High Level Communication Mechanisms for Distributed Parallel Computers from an Adaptive Message Routing

High level communication primitives play an important role in the implementation of distributed applications on parallel computers. This paper shows how these primitives may be developed from an efficient routing algorithm. The routing algorithm used here has many positive characteristics including deadlock-freedom, guaranteed message arrival, and automatic local congestion reduction. The experimental results show that the routing algorithm is effective to support process to process communication on a parallel computer. The goal is the implementation of a virtual communication level which allows the implementation of topology independent parallel applications.