A performance comparison of token- and tree-based mutual exclusion algorithms on Chordal Rings

In this paper we present a performance comparison of token- and tree-based mutual exclusion algorithms. The effect of increasing the connectivity of the network topology on the performance of Raymond's algorithm, Changet al.'s algorithm, Helaryet al.'s algorithm, and Naimiet al.'...

Full description

Saved in:
Bibliographic Details
Published in:Journal of network and computer applications 1998-07, Vol.21 (3), p.187-201
Main Authors: Saxena, P.C., Gupta, Sangita
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Computer systems and distributed systems. User interface
Exact sciences and technology
Software
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we present a performance comparison of token- and tree-based mutual exclusion algorithms. The effect of increasing the connectivity of the network topology on the performance of Raymond's algorithm, Changet al.'s algorithm, Helaryet al.'s algorithm, and Naimiet al.'s algorithm is studied. We find that Raymond's algorithm, which uses a static logical structure-based approach, has better performance than the rest of the above-mentioned algorithms, which are dynamic logical structure-based. When the network topology is near complete, the dynamic logical structure-based algorithms have a better response time than Raymond's algorithm. At higher loads, Raymond's algorithm has very low message traffic.
ISSN:1084-8045
1095-8592
DOI:10.1006/jnca.1998.0072