ScholarLens Back to search
2002•Unpublished venueRequires access

A new token based distributed mutual exclusion algorithm

Kia Makki, Niki Pissinou, Yelena Yesha

Open publisher page 0 citations

Abstract

The authors present a new token based distributed mutual exclusion algorithm for a distributed computer system of N sites. The proposed algorithm is based on timestamps and the theory of finite projective planes. It also makes use of a "Token Queue" which is part of the token and contains a list of all sites which are requesting the token. The algorithm is deadlock free, free from starvation, and requires no message exchange in the best case, and 4/spl radic/N - 2 message exchanges in the worst case per critical section execution.

About this research paper

What this paper is about

The authors present a new token based distributed mutual exclusion algorithm for a distributed computer system of N sites. The proposed algorithm is based on timestamps and the theory of finite projective planes. It also makes use of a "Token Queue" which is part of the token and contains a list of all sites which are requesting the token. The algorithm is deadlock free, free from starvation, and requires no message exchange in the best case, and 4/spl radic/N - 2 message exchanges in the worst case per critical section execution.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The authors present a new token based distributed mutual exclusion algorithm for a distributed computer system of N sites. The proposed algorithm is based on timestamps and the theory of finite projective planes. It also makes use of a "Token Queue" which is part of the token and contains a list of all sites which are requesting the token. The algorithm is deadlock free, free from starvation, and requires no message exchange in the best case, and 4/spl radic/N - 2 message exchanges in the worst case per critical section execution.

Key concepts: Suzuki-Kasami algorithm, Mutual exclusion, Security token, Critical section, Computer science, Token passing, Deadlock, Deadlock prevention algorithms

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A new token based distributed mutual exclusion algorithm — Research Paper | ScholarLens