A N algorithm for mutual exclusion in decentralized systems

  • Authors:
  • Mamoru Maekawa

  • Affiliations:
  • Department of Information Science, Faculty of Science, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku Tokyo, 113 Japan

  • Venue:
  • ACM Transactions on Computer Systems (TOCS)
  • Year:
  • 1985

Quantified Score

Hi-index 0.02

Visualization

Abstract

An algorithm is presented that uses only c√N messages to create mutual exclusion in a computernetwork, where N is the number of nodes and c a constant between 3 and 5. The algorithm issymmetric and allows fully parallel operation.