The authors describe a synchronous protocol to implement a rendezvous between two processes executing in a distributed pool of processors. The protocol requires two profoundly unrealistic preconditions: that messages are neither lost nor corrupted and that messages are delivered in send order. The protocol is resilient to duplicates. The protocol buffers all messages except one on the sending side. To avoid deadlocks, the protocol assumes a static number of processes and a static number of receive buffers in each processor. Each processor-process pair requires a preallocated buffer on each processor in the pool. In the authors’ model, each process provides protocol services for every other process, thereby “avoiding unnecessary context switches.” The protocol uses four context switches to achieve rendezvous.