[zz] References on Mutual Excuslion

• E. W. Dijkstra: "Solution of a problem in concurrent programming control", CACM, vol.5, No. 9, p 569. 1966.  The first paper on mutual exclusion. The algorithm in this paper is not starvation free. 
• D. E. Knuth: "Additional comments on a problem in concurrent programming control", CACM, vol.9, No. 5, pp. 321-322. 1966.  The first starvation free algorithm is shown. 
• E. W. Dijkstra: "The Structure of the 'THE'- Multiprograming System": CACM, vol.11, No. 9, pp. 341-346. 1968.  P-V Semaphores are shown in the appendix of this paper. 
• L. Lamport: "A New Solution of Dijkstra's Concurrent Programming Program", CACM, vol. 17, No. 8, pp.453-455. 1974.  The bakery algorithm is shown in this paper. The first FCFS (First Come, First Serve). and The first mutual excusion algorithm for distributed systems. 
• G. L. Peterson, M. J. Fischer: "ECONOMICAL SOLUTIONS FOR THE CRITICAL SECTION PROBLEM IN A DISTRIBUTED SYSTEM", ACM Annual proceedings of Theory of Computing, pp.91-97, 1977.  The first tournament algorithm is shown in this paper. It means, it is the first O(log n) algorithm.(as far as I know.). 
• G.Ricart, A. K. Agrawala: "An Optimal Algorithm for Mutual Excusion in Computer Networks", CACM, Vol.24, No. 1., pp. 9-17. 1981.  require 2*(n-1) messages. for distributed systems. broadcast based. 
• I. Suzuki, T. Kasami: "A Distributed Mutual Exclusion Algorithm", ACM Transactions on Computer Systems, Vol.3, No. 4, pp.344-349. 1985.  requires N messages, for distributed systems. token based. 
• M. Maekawa: "A sqrt(N) algorithm for mutual exclusion in decentralized systems", ACM Transactions on Computer Systems, Vol.3, No. 2, pp.145-159. 1985.  requires sqrt(N) messages, for distributed systems. 
• L. Lamport: "A Fast Mutual Exclusion Algorithm", ACM Transactions on Computer Systems, vol. 5, No. 1, pp.1-11. 1987.  Absence of contention, requires only seven memory accesses. 
• Kerry Raymond: "A Tree-Based Algorithm for Distributed Mutual Exclusion", ACM Transactions on Computer Systems, vol. 7, No. 1, pp.61-77. 1989.requires O(log N) messages, for distributed systems, token based. 
• M. Naimi and M. Trehel: "An improvement of the log(n) distributed algorithm for mutual exclusion", Proc. IEEE Intl. Conf. on Distributed Computer Systems, pp.371-375, Berlin, Germany, 21-25 September 1987. 
• M. L. Neilsen and M. Mizuno: "A dag-based algorithm for distributed mutual exclusion", 11th IEEE International Conference on Distributed Computer Systems, pp.354-360, Dallas USA, 1991. 
• Ahmed HOUSNI, Michel TREHEL: "A NEW DISTRIBUTED MUTUAL EXCLUSION ALGORITHM FOR TWO GROUPS", ACM SAC2001, 2001.   
• Nirmit Desai and Frank Mueller: "A Log(n) Multi-Mode Locking Protocol for Distributed Systems", Proceedings of the International Parallel and Distributed Processing Symposium, 2003. 
  peer to peer, O(log n)
   
• S.D.Lin, Q. Lian, M. Chen, Z. Zhang: "A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems",IPTPS04