Mutual exclusionIn this paper a new algorithm based on the centralized algorithm for mutual exclusion in distributed systems is proposed that instead of one coordinator uses two coordinator On separate sites (Bu
Token Ring Algorithm To Achieve Mutual Exclusion In Distributed System - A Centralized Approach Sandipan Basu Post Graduate Department of Computer Science, St. Xavier's College, University of Calcutta Kolkata-700016, INDIA.Sandipan Basu, "Token Ring Algorithm To Achieve Mutual Exclusion In Distributed ...
As the number of message exchanged is very crucial parameter for analysing the performance of any mutual exclusion algorithm the proposed algorithm reduces the number of messages exchanged less than 2*(N-1),where N is the number of sites in the system. The number of messages required to allow...
In this paper, the author analyses and studies the problems of distributed synchronization and mutual exclusion, and improves a token-based algorithm—Goscinski algorithm after evaluating a number of existing distributed mutual exclusion algorithm. In order to prove that the improved algorithm has better...
One of the major duties for process synchronization is mutual exclusion. This paper presents a new centralized fault tolerant distributed mutual exclusion algorithm based on Agrawala and El-Abbadi's algorithm. In new algorithm, once coordinator crashes, algorithm can recover lost data and return the ...
A new distributed mutual exclusion algorithm is proposed in this paper. This algorithm is a centralized token-based algorithm. Performance metrics are presented. Analysis shows that this algorithm outperforms existing algorithms and its performance is close to the lower bounds of these metrics.Min-You...