An efficient algorithm for mutual exclusion using queue migration in computer networks

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.<
>