Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Resource sharing in distributed network becomes known as a major problem when systems have physical or virtual resources… 
2011
2011
Adaptation is a desirable requirement in a distributed system as it helps the system to perform efficiently under different… 
2008
2008
We present in this paper a fault tolerant permission-based k-mutual exclusion algorithm, which is an extension of Raymond's… 
2001
2001
This paper describes a distributed monitor construct implemented in Java. The monitor construct has been widely used for ensuring… 
2000
2000
The monitor concept has been widely used in a concurrent programming environment for implicitly ensuring mutual exclusion and… 
1998
1998
In this paper we present a performance comparison of token- and tree-based mutual exclusion algorithms. The effect of increasing… 
1996
1996
In this paper, we present a simple and efficient distributed mutual exclusion algorithm for a distributed computer system of N… 
1992
1992
Reliability and efficiency are two important characteristics of a good distributed mutual exclusion algorithm. Efficiency is…