Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,136
Mutual Exclusion Revisited
"... A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come first-served algorithm immune to various faults. The algorithms are based on a scheme similar to the Morris's solution of the mutual exc ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come first-served algorithm immune to various faults. The algorithms are based on a scheme similar to the Morris's solution of the mutual
Fair group mutual exclusion
, 2003
"... In the group mutual exclusion problem [6], which general-izes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If two processes are in the Critical Section at the ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
In the group mutual exclusion problem [6], which general-izes mutual exclusion [2], a process chooses a session when it requests entry to the Critical Section. A group mutual exclusion algorithm must ensure that the mutual exclusion property holds: If two processes are in the Critical Section
Group Mutual Exclusion in Token
"... other three algorithms. Received month date, year; revised month date, year 1. INTRODUCTION The mutual exclusion and concurrency are among thefundamental problems of distributed systems. The mutual exclusion ensures an exclusive access to a sharedresource (also known as sessions [3]) among a set of ..."
Abstract
- Add to MetaCart
other three algorithms. Received month date, year; revised month date, year 1. INTRODUCTION The mutual exclusion and concurrency are among thefundamental problems of distributed systems. The mutual exclusion ensures an exclusive access to a sharedresource (also known as sessions [3]) among a set
Asynchronous Group Mutual Exclusion
- Distributed Computing
, 1998
"... Mutual exclusion and concurrency are two fundamental and essentially opposite features in distributed systems. However, in some applications such as Computer Supported Cooperative Work (CSCW) we have found it necessary to impose mutual exclusion on dierent groups of processes in accessing a reso ..."
Abstract
-
Cited by 37 (1 self)
- Add to MetaCart
Mutual exclusion and concurrency are two fundamental and essentially opposite features in distributed systems. However, in some applications such as Computer Supported Cooperative Work (CSCW) we have found it necessary to impose mutual exclusion on dierent groups of processes in accessing a
The Communication Requirements of Mutual Exclusion
- In Proceedings of the Seventh Annual Symposium on Parallel Algorithms and Architectures
, 1995
"... This paper examines the amount of communication that is required for performing mutual exclusion. It is assumed that n processors communicate via accesses to a shared memory that is physically distributed among the processors. We consider the possibility of creating a scalable mutual exclusion proto ..."
Abstract
-
Cited by 36 (0 self)
- Add to MetaCart
This paper examines the amount of communication that is required for performing mutual exclusion. It is assumed that n processors communicate via accesses to a shared memory that is physically distributed among the processors. We consider the possibility of creating a scalable mutual exclusion
Survey of Mutual Exclusion Algorithms
"... Abstract−Distributed systems are composed of several computers connected together to share software and hardware resources are shared. Obviously, the interaction process is resource sharing. Resources where they are likely to interfere with a process called the critical region. Mutual exclusion algo ..."
Abstract
- Add to MetaCart
Abstract−Distributed systems are composed of several computers connected together to share software and hardware resources are shared. Obviously, the interaction process is resource sharing. Resources where they are likely to interfere with a process called the critical region. Mutual exclusion
Temporal Planning with Mutual Exclusion Reasoning
- IJCAI-99
, 1999
"... Many planning domains require a richer notion of time in which actions can overlap and have different durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. Th ..."
Abstract
-
Cited by 150 (4 self)
- Add to MetaCart
Many planning domains require a richer notion of time in which actions can overlap and have different durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning
Fast and Scalable Mutual Exclusion
- In Proceedings of the 13th International Symposium on Distributed Computing
, 1999
"... . We present an N-process algorithm for mutual exclusion under read/write atomicity that has O(1) time complexity in the absence of contention and \Theta(log N) time complexity under contention, where "time" is measured by counting remote memory references. This is the first such algor ..."
Abstract
-
Cited by 18 (2 self)
- Add to MetaCart
. We present an N-process algorithm for mutual exclusion under read/write atomicity that has O(1) time complexity in the absence of contention and \Theta(log N) time complexity under contention, where "time" is measured by counting remote memory references. This is the first
Timing-Based Mutual Exclusion
- Proceedings of the Thirteenth IEEE Real-Time Systems Symposium
, 1992
"... Known asynchronous n-process deadlock-free mutual exclusion algorithms require O(n) read/write registers and O(n) operations to access the critical region, rendering them impractical for large scale applications. Burns and Lynch have shown that n registers are necessary for solving this problem, in ..."
Abstract
-
Cited by 24 (2 self)
- Add to MetaCart
Known asynchronous n-process deadlock-free mutual exclusion algorithms require O(n) read/write registers and O(n) operations to access the critical region, rendering them impractical for large scale applications. Burns and Lynch have shown that n registers are necessary for solving this problem
Results 1 - 10
of
4,136
