In this paper we present a performance comparison of token-and tree-based mutual exclusion algorithms. The effect of increasing the connectivity of the network topology on the performance of Raymond's algorithm, Chang et al.'s algorithm, Helay et al.'s algorithm, and Naimi et al.'s algorithm is studied. We find that Raymond's algorithm, which uses a static logical structure-based approach, has better performance than the rest of the above-mentioned algorithms, which are dynamic logical structure-based. When the network topology is near complete, the dynamic logical structure-based Algorithms have a better response time than Raymond's algorithm. At higher loads, Raymond's algorithm has very low message traffic.
展开▼