A log (N) distributed mutual exclusion algorithm based on path reversal

Mohamed Naïmi

doi:10.1006/jpdc.1996.0041

A log (N) distributed mutual exclusion algorithm based on path reversal

1996-04-01

86

PRE

AI

DOI：10.1006/jpdc.1996.0041

Original

Original request for help

Save

Abstract

En 中文

In this paper, we present a distributed algorithm for mutual exclusion based on path reversal, The algorithm does not use logical clocks to serialize the concurrent events, and all the variables are bounded. When a process invokes a critical section, it sends a request to the tail of a queue. A dynamical rooted tree gives the path to this tail, The algorithm requires only O(log(n)) messages on average, where n is the number of processes in the network. The performance analysis of the algorithm is based on generating formal power series. (C) 1996 Academic Press, Inc.

Keywords:

COMPUTER-NETWORKS

SYSTEMS

A log (N) distributed mutual exclusion algorithm based on path reversal

Abstract

Journal

Organization

Cited Papers