Distributed implementation of multi-rendezvous in LOTOS using the orthogonal communication structure in Linda

We argue that the programming simplicity and message passing complexity of implementing LOTOS multi-rendezvous largely depends on the underlying communication structure. The programming simplicity and low complexity of our algorithm are due to our viewing the multi-rendezvous problem as a distributed mutual exclusion problem. Using the parallel programming environment of Linda, we present an efficient algorithm to easily implement multi-rendezvous in LOTOS. The orthogonal communication structure in Linda allows us to separate synchronization concerns in multi-rendezvous from concerns in interprocess communication in an implementation. The concept, of Table Space in Linda and the associated in, out, and rd primitives for managing the tuple space lead to an elegant programming style for distributed implementation of multi-rendezvous