Skip to main content
Article thumbnail
Location of Repository

An Experimental Comparison of Lock-based Distributed Mutual Exclusion Algorithms

By I. Introduction

Abstract

Abstract—The message complexity of two lock-based distributed mutual exclusion algorithms are compared in simulation. The number of messages per critical section invocation is measured in a simulated system as a function of the number of processes N and as a function of the critical section contention load L. Both algorithms perform as expected, with Ricart and Agrawala’s algorithm exhibiting 2*(N-1) behavior, and Maekawa’s algorithm showing a K ∗ N dependence, where K is a weak function of load L

Topics: T
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.8184
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://deneb.cs.kent.edu/~mikh... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.