Transformations of Mutual Exclusion Algorithms from the Cache-Coherent Model to the Distributed Shared Memory Model

We present two transformations that convert a class of local-spin mutual exclusion algorithms on the cache-coherent model to local-spin mutual exclusion algorithms on the distributed shared memory model without increasing their time complexity. The first transformation uses registers and test-and-set objects, and does not increase the number of busy-waiting periods. The second transformation uses only registers, but contains two busy-waiting periods for each busy-waiting period of the input algorithm. The class of mutual exclusion algorithms that are applicable to the transformations was carefully defined, and formally prove the correctness of the transformations