The traditional mutual exclusion problem in distributed systems occurs when only one process should access a shared resource. The mutual exclusion algorithm performance is calculated by the number of messages exchange per critical section execution called Message complexity and the delay between successive executions of the critical section, known as Synchronization delay. For designing mutual exclusion algorithm, one has to compromise either for the message complexity or for the synchronization delay. Hence a comparative study based on these two metrics is performed. An organized approach is essential to solve Mutual exclusion problem. This study will provide a suitable context for technical and clear assessment of existing algorithms.

1. L. Lamport, "Time, clocks, and the ordering of events in a distributed system," Communications of the ACM, vol. 21, no. 7, pp. 558-565, 1978.
2. Velaquez, M. G, 1993, A Survey of Distributed Mutual Exclusion Algorithms. Technical Report. Colorado State University.
3. I. Suzuki and T. Kasami. , "A distributed mutual exclusion algorithm," ACM Transactions on Computer Systems, vol. 3, no. 4, pp. 344-349, 1985.
4. K. Raymond, " A tree based algorithm for distributed mutual exclusion," ACM transactions on computer system, pp. 61-77, February 1989
5. Trehel and M. Naimi, " A distributed algorithm for mutual exclusion based on data structures and fault tolerance. ," in IEEE 6th International Conference on Computers and Communications, 1987
6. Leila Omrani, Z. R. "A new function-based framework for classification and evaluation of mutual exclusion algorithms in distributed system," International Journal of Computer Science and Security (IJCSS), Vol - 5 , no. 2, pp. 168-297, 2011.
7. P. Chaudhuri and T. Edward, "An O(?n) Distributed Mutual Exclusion Algorithm Using Queue Migration," Journal of Universal Computer Science, vol. 12, no. 2, pp. 140-159, 2006
8. G. Ricart and A. K. Agrawala, "An optimal algorithm for mutual exclusion in computer networks," Communications of the ACM, vol. 24, no. 1, pp. 9-17, 1981
9. M. Maekawa, "A ?(N )algorithm for mutual exclusion in decentralized systems," ACM Transactions on Computer Systems, vol. 3, no. 2, pp. 145-159, 1985.
10. M. Singhal, "A dynamic information-structure mutual exclusion algorithm for distributed systems," IEEE Transactions on Parallel and Distributed systems, vol. 3, no. 1, January 1992.
11. S. Lodha, and A. Kshemkalyani, " A fair distributed mutual exclusion algorithm," IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 6, June 2000. .
12. S. Paydar, M. Naghibzadeh and A. Yavari,"A hybrid distributed mutual exclusion algorithm", in IEEE - International Conference on Engineering and Technology, 2006.
13. H. Kakugawa, S. Kamei, and T. Masuzawa, "A token-based distributed group mutual exclusion algorithm with quorums," Parallel and Distributed Systems, IEEE Transactions, vol. 19, no. 9, pp. 1153- 1166, 2008.
14. H. Taheri, P. Neamatollahi, and M. Naghibzadeh, "A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology," Information Processing Letters, pp. 841-847, 2011
15. H. Taheri, P. Neamatollahi, and M. Naghibzadeh, "Info-based approach in distributed mutual exclusion algorithms," Journal of Parallel and Distributed Computing, vol. 72, no. 5, pp. 650-655, May 2012.
16. K. Raymond, "A distributed algorithm for multiple entries to a critical section," Information Processing Letters, February 1989.
17. P. Srimani and R. Reddy, "Another distributed algorithm for multiple entries to a critical section," Information Processing Letters, vol. 41, no. 1, pp. 51-57, Januaury 1992.
18. H. Kakugawa; S. Fujita; M. Yamashita and AE, T. , "Availability of k-Coterie," IEEE Transactions on Computers, vol. 42, no. 5, pp. 553-558, May 1993.
19. P. Chaudhuri and T. Edward, "An algorithm for k-mutual exclusion in decentralized systems," Computer Communications, vol. 31, no. 14, 2008.
20. Kshemkalyani,A. and Singhal,M. 2008. Distributed Computing: Principles, Algorithms, and Systems. pp 305-348
21. M. Bouillaguet, L. Arantes, and P. Sens, "Fault tolerant k-mutual exclusion algorithm using failure detector," in International Symposium on Parallel and Distributed Computing, 2007. .
22. P. Saxena and J. Rai, " A survey of permission-based distributed mutual exclusion algorithms," Computer Standards & Interfaces, vol. 25, no. 2, pp. 159-181, May 2003.
23. Abhishek Swaroop and Awadhesh Kumar Singh, " A Study of Token Based Algorithms for Distributed Mutual Exclusion," International Review on Computers & Software;Jul2007, Vol. 2 Issue 4, pp 302,July 2007

Distributed Mutual Exclusion Mutual Exclusion Critical Section (cs) Synchronization Delay (sd) Message Com-plexity.