The Community for Technology Leaders
Green Image
<p>A nonsymmetric deadlock-free mutual exclusion algorithm for computer networks is presented. The algorithm requires O(m) messages to synchronize m modes in a lightly loaded system, and the performance approaches a constant k dependent on m as the workload increases. In a medium to heavily loaded system, it outperforms other proposed algorithms and its performance is independent of network topology.</p>
mutual exclusion; queue migration; computer networks; nonsymmetric deadlock-free mutual exclusion algorithm; lightly loaded system; performance; network topology; computer networks; network operating systems; performance evaluation; queueing theory
G.-C. Yang, V. Kumar, J. Place, "An Efficient Algorithm for Mutual Exclusion Using Queue Migration in Computer Networks", IEEE Transactions on Knowledge & Data Engineering, vol. 3, no. , pp. 380-384, September 1991, doi:10.1109/69.91048
89 ms
(Ver 3.3 (11022016))