Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{170242,
        author = {Aditya Gagre and Prathmesh Kadam and Sarthak Shinde and Aditya Sonavane},
        title = {Mutual Exclusion Algorithms for Distributed  Systems: A Comprehensive Survey},
        journal = {International Journal of Innovative Research in Technology},
        year = {2024},
        volume = {11},
        number = {6},
        pages = {3251-3255},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=170242},
        abstract = {While mutual exclusion is a basic problem in distributed systems, multiple processes need to coordinate to guarantee that at any time there is one and stays one process utilizing a fundamental segment. The need to address mutual exclusion efficiently and at scale is becoming ever more critical as distributed systems increasingly find a place in the modern computing environment. The survey focuses on how various distributed systems mutual exclusion algorithms have been tailored to exhibit their performance and scalability, and how they can be adapted to particular application contexts. In addition, we identify challenges faced by distributed systems and research directions for improvement of such mechanisms.},
        keywords = {distributed systems, mutual exclusion, synchronization, performance analysis, scalability, algorithms.},
        month = {November},
        }