Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1998
Highly Cited
1998
Latent Semantic Analysis (LSA) is a theory and method for extracting and representing the contextual‐usage meaning of words by… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Abstract Mutual exclusion scheduling is the problem of scheduling unit-time tasks non-preemptively on m processors subject to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The authors study a class of specifications, called generalized mutual exclusion constraints, for discrete event systems modeled… Expand
  • figure 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this paper, we present an efficient and fault-tolerant algorithm for generating quorums to solve the distributed mutual… Expand
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A theoretical basis for Petri net synthesis methods is provided that can be used to model systems with shared resources, and to… Expand
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… Expand
  • 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… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
An algorithm is presented that uses only <italic>c√N</italic> messages to create mutual exclusion in a computernetwork, where… Expand
  • figure 1
  • figure 2
  • figure 2
  • figure 3
  • table I
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… Expand
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… Expand
  • figure 1
Is this relevant?