Mutual Exclusion Algorithms for Distributed Systems: A Comprehensive Survey

  • Unique Paper ID: 170242
  • Volume: 11
  • Issue: 6
  • PageNo: 3251-3255
  • 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.

Cite This Article

  • ISSN: 2349-6002
  • Volume: 11
  • Issue: 6
  • PageNo: 3251-3255

Mutual Exclusion Algorithms for Distributed Systems: A Comprehensive Survey

Related Articles