Results 11  20
of
1,636
A treebased algorithm for distributed mutual exclusion
 ACM Transactions on Computer Systems
, 1989
"... We present an algorithm for distributed mutual exclusion in a computer network of N nodes that communicate by messages rather than shared memory. The algorithm uses a spanning tree of the computer network, and the number of messages exchanged per critical section depends on the topology of this tree ..."
Abstract

Cited by 141 (0 self)
 Add to MetaCart
We present an algorithm for distributed mutual exclusion in a computer network of N nodes that communicate by messages rather than shared memory. The algorithm uses a spanning tree of the computer network, and the number of messages exchanged per critical section depends on the topology
Fast and Scalable Mutual Exclusion
 In Proceedings of the 13th International Symposium on Distributed Computing
, 1999
"... . We present an Nprocess 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 Nprocess 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
Deriving a Scalable Algorithm for Mutual Exclusion
 In Proceedings of the 12th International Symposium on Distributed Computing
, 1998
"... . This paper details the design of a scalable algorithm for the mutual exclusion problem. Starting by inserting a redundant assignment into Peterson's algorithm for two processes, we derive another algorithm that uses only local spins, i.e., a process busywaits only on locally accessible share ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. This paper details the design of a scalable algorithm for the mutual exclusion problem. Starting by inserting a redundant assignment into Peterson's algorithm for two processes, we derive another algorithm that uses only local spins, i.e., a process busywaits only on locally accessible
Proof of a RealTime MutualExclusion Algorithm
, 1992
"... Michael Fischer[2] has proposed a mutual exclusion algorithm that ingeniously exploits real time. We prove this algorithm using the timehonored technique of establishing an appropriate invariant. 1 Introduction Michael Fischer[2] has proposed a mutual exclusion algorithm in which real time is used ..."
Abstract
 Add to MetaCart
Michael Fischer[2] has proposed a mutual exclusion algorithm that ingeniously exploits real time. We prove this algorithm using the timehonored technique of establishing an appropriate invariant. 1 Introduction Michael Fischer[2] has proposed a mutual exclusion algorithm in which real time
Lower Bounds for Randomized Mutual Exclusion
 SIAM Journal on Computing
, 1993
"... We establish, for the first time, lower bounds for randomized mutualexclusion algorithms (with a readmodifywrite operation). Our main result is that a constant size sharedvariable cannot guarantee strong fairness, even if randomization is allowed. In fact, we prove a lower bound of\Omega\Gamma/4 ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We establish, for the first time, lower bounds for randomized mutualexclusion algorithms (with a readmodifywrite operation). Our main result is that a constant size sharedvariable cannot guarantee strong fairness, even if randomization is allowed. In fact, we prove a lower bound of
Nonatomic Mutual Exclusion with Local Spinning*
, 2003
"... Abstract We present an Nprocess localspin mutual exclusion algorithm, based on nonatomic reads and writes, in which each process performs \Theta (log N) remote memory references to enter and exit its critical section. This algorithm is derived from Yang and Anderson's atomic treebased local ..."
Abstract
 Add to MetaCart
Abstract We present an Nprocess localspin mutual exclusion algorithm, based on nonatomic reads and writes, in which each process performs \Theta (log N) remote memory references to enter and exit its critical section. This algorithm is derived from Yang and Anderson's atomic treebased local
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
algorithms have been proposed to manage the crisis. Mutual exclusion algorithms, the critical areas are divided between processes so that at any time only one process can enter the critical region. The rest must wait for the process to be critical. The algorithm for the selection process will be critical
Correctness of Mutual Exclusion Algorithms
, 2003
"... One way of characterizing nontokenbased mutual exclusion (m.e.) algorithms is in terms of the underlying information structure. The information structure for a given m.e. algorithm specifies which particular processes interact with which other processes before entering their critical sections, and ..."
Abstract
 Add to MetaCart
One way of characterizing nontokenbased mutual exclusion (m.e.) algorithms is in terms of the underlying information structure. The information structure for a given m.e. algorithm specifies which particular processes interact with which other processes before entering their critical sections
Results 11  20
of
1,636