Mutual exclusion

Known as: Mutually-exclusive, Mutex lock, Mutual exclusion rule 
In computer science, mutual exclusion is a property of concurrency control, which is instituted for the purpose of preventing race conditions; it is… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1938-2017
010020019382016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1999
Highly Cited
1999
Many planning domains require a richer notion of time in which actions can overlap and have di erent durations. The key to fast… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper is concerned with synchornization under read/write atomicity in shared memory multi-processors. We present a new… (More)
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In this paper we describe restartable atomic sequences, an optimistic mechanism for implementing simple atomic operations (such… (More)
  • figure 1
  • figure 3
  • table 2
  • table 4
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We present an algorithm for distributed mutual exclusion in a computer network of N nodes that communicate by messages rather… (More)
  • figure 1
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A new solution to the mutual exclusion problem is presented that, in the absence of contention, requires only seven memory… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The concept of an information structure is introduced as a unifying principle behind several of the numerous algorithms that have… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
The theory developed in Part I is used to state the mutual exclusion problem and several additional fairness and failure… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1985
Highly Cited
1985
A distributed algorithm is presented that realizes mutual exclusion among N nodes in a computer network. The algorithm requires… (More)
Is this relevant?
Highly Cited
1981
Highly Cited
1981
An algorithm is proposed that creates mutual exclusion in a computer network whose nodes communicate only by messages and do not… (More)
  • figure 1
Is this relevant?