ON THE CORRECTNESS OF GOSCINSKIS ALGORITHM

In this paper, the correctness of the mutual exclusion algorithm propo sed by Goscinski (J. Parallel Distribut. Comput. 9(7), 77-82 (1990)), hereafter G, is discussed and its features are compared with other tok en-based algorithms already published. In particular, we show that G w orks correctly only using a communication system that guarantees a tot al ordering of messages, otherwise it is incorrect. We further give a modified version of G, hereafter BCC, and show that BCC is actually a simple modification of the Suzuki-Kasami algorithm (ACM Trans. Comput. Systems 3(5), 344-349 (1985)). (C) 1995 Academic Press, Inc