Optimal Implementation of Wait-Free Binary Relations

. In this article we derive an algorithm for computing the "optimal" wait-free program on two processors that implements a given relation from the semantics of a small atomic read/write shared-memory parallel language. This algorithm is compared with the more general algorithm given in [8, 12] based on the participated set algorithm of [1]. An extension to this is given, where we add a test&set primitive to the previous language. This work is a natural follow up of [6]. 1 Introduction and Related Work The work reported here is concerned with the robust or fault-tolerant implementation of distributed programs. More precisely, we are interested in wait-free implementations on a distributed machine composed of two units communicating through a shared memory via atomic read/write registers (described in Section 2). This means that the processes executed on the two processors (say P and P 0 ) must be as loosely coupled as possible so that even if one fails to terminate, the other will c..