Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,184,860 papers from all fields of science
Search
Sign In
Create Free Account
Raymond's algorithm
Raymond's Algorithm is a lock based algorithm for mutual exclusion on a distributed system. It imposes a logical structure (a K-ary tree) on…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Critical section
FIFO (computing and electronics)
K-ary tree
Lamport's bakery algorithm
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A Distributed Algorithm for Power Management in Mobile Ad-Hoc Networks
Bita Amirshahi
,
A. Barsky
2015
Corpus ID: 42782562
Resource sharing in distributed network becomes known as a major problem when systems have physical or virtual resources…
Expand
2011
2011
Adaptive Distributed Mutual Exclusion by Dynamic Topology Switching
Sushanta Karmakar
,
Arobinda Gupta
International Journal of Foundations of Computer…
2011
Corpus ID: 28891593
Adaptation is a desirable requirement in a distributed system as it helps the system to perform efficiently under different…
Expand
2008
2008
Fault Tolerant K-Mutual Exclusion Algorithm Using Failure Detector
Mathieu Bouillaguet
,
L. Arantes
,
Pierre Sens
International Symposium on Parallel and…
2008
Corpus ID: 17118930
We present in this paper a fault tolerant permission-based k-mutual exclusion algorithm, which is an extension of Raymond's…
Expand
2001
2001
Analysis and evaluation of a distributed monitor construct in java
Nick K. C. Cheung
,
Jiannong Cao
,
A. Chan
Proceedings, International Parallel and…
2001
Corpus ID: 7838518
This paper describes a distributed monitor construct implemented in Java. The monitor construct has been widely used for ensuring…
Expand
2000
2000
JDM: Building Distributed Synchronization Support into Java
Jiannong Cao
,
Nick K. C. Cheung
,
A. Chan
J. Interconnect. Networks
2000
Corpus ID: 27524641
The monitor concept has been widely used in a concurrent programming environment for implicitly ensuring mutual exclusion and…
Expand
1998
1998
A performance comparison of token- and tree-based mutual exclusion algorithms on Chordal Rings
P. C. Saxena
,
Sangita Gupta
Journal of Network and Computer Applications
1998
Corpus ID: 45528788
In this paper we present a performance comparison of token- and tree-based mutual exclusion algorithms. The effect of increasing…
Expand
1996
1996
An efficient distributed mutual exclusion algorithm
N. Pissinou
,
K. Makki
,
E. Park
,
Z. Hu
,
W. Wong
Proceedings of the ICPP Workshop on Challenges…
1996
Corpus ID: 40567474
In this paper, we present a simple and efficient distributed mutual exclusion algorithm for a distributed computer system of N…
Expand
1992
1992
An improved reliable distributed mutual exclusion algorithm
S. Jayaprakash
,
C. Muthukrishnan
[Proceedings] Singapore ICCS/ISITA `92
1992
Corpus ID: 61848383
Reliability and efficiency are two important characteristics of a good distributed mutual exclusion algorithm. Efficiency is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE