Results 1 
8 of
8
Sharedmemory mutual exclusion: Major research trends since
 Distributed Computing
, 1986
"... * Exclusion: At most one process executes its critical section at any time. ..."
Abstract

Cited by 47 (6 self)
 Add to MetaCart
* Exclusion: At most one process executes its critical section at any time.
An Improved Lower Bound for the Time Complexity of Mutual Exclusion (Extended Abstract)
 IN PROCEEDINGS OF THE 20TH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING
, 2001
"... We establish a lower bound of 23 N= log log N) remote memory references for Nprocess mutual exclusion algorithms based on reads, writes, or comparison primitives such as testandset and compareand swap. Our bound improves an earlier lower bound of 32 log N= log log log N) established by Cyph ..."
Abstract

Cited by 40 (11 self)
 Add to MetaCart
We establish a lower bound of 23 N= log log N) remote memory references for Nprocess mutual exclusion algorithms based on reads, writes, or comparison primitives such as testandset and compareand swap. Our bound improves an earlier lower bound of 32 log N= log log log N) established by Cypher. Our lower bound is of importance for two reasons. First, it almost matches the (log N) time complexity of the bestknown algorithms based on reads, writes, or comparison primitives. Second, our lower bound suggests that it is likely that, from an asymptotic standpoint, comparison primitives are no better than reads and writes when implementing localspin mutual exclusion algorithms. Thus, comparison primitives may not be the best choice to provide in hardware if one is interested in scalable synchronization.
A time complexity bound for adaptive mutual exclusion
 In Proceedings of the 15th International Symposium on Distributed Computing
, 2001
"... ..."
WaitFree Consensus with Infinite Arrivals
 In Proceedings of the 34th ACM Symposium on Theory of Computing
, 2002
"... A randomized algorithm is given that solves the waitfree consensus problem for a sharedmemory model with in nitely many processes. The algorithm is based on a weak shared coin algorithm that uses weighted voting to achieve a majority outcome with at least constant probability that cannot be disgui ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
A randomized algorithm is given that solves the waitfree consensus problem for a sharedmemory model with in nitely many processes. The algorithm is based on a weak shared coin algorithm that uses weighted voting to achieve a majority outcome with at least constant probability that cannot be disguised even if a strong adversary is allowed to destroy in nitely many votes. The number of operations performed by process i is a polynomial function of i. Additional algorithms are given for solving consensus more eciently in models with an unknown upper bound b on concurrency or an unknown upper bound n on the number of active processes; under either of these restrictions, it is also shown that the problem can be solved even with in nitely many anonymous processes by pre xing each instance of the shared coin with a naming algorithm that breaks symmetry with high probability. For many of these algorithms, matching lower bounds are proved that show that their perprocess work is nearly optimal as a function of i, b, or n. The case of n active processes gives an algorithm for anonymous, adaptive consensus that requires only O(n log n) perprocess work, which is within a constant factor of the best previously known nonadaptive algorithm for a strong adversary. Finally, it is shown that standard universal constructions based on consensus continue to work with in nitely many processes with only slight modi cations. This shows that in in nite distributed systems, as in nite ones, with randomness all things are possible.
Nonatomic Mutual Exclusion with Local Spinning (Extended Abstract)
, 2002
"... 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 localspin al ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
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 localspin algorithm in a way that preserves its time complexity. No atomic read/write algorithm with better asymptotic worstcase time complexity (under the remotememoryreferences measure) is currently known. This suggests that atomic memory is not fundamentally required if one is interested in worstcase time complexity. The same cannot be said if one is interested in fastpath algorithms (in which contentionfree time complexity is required to be O(1)) or adaptive algorithms (in which time complexity is required to be proportional to the number of contending processes). We show that such algorithms fundamentally require memory accesses to be atomic. In particular, we show that for any Nprocess nonatomic algorithm, there exists a singleprocess execution in which the lone competing process executes \Omega (log N / log log N) remote operations to enter its critical section. Moreover, these operations must access \Omega (plog N / log log N) distinct variables, which implies that fast and adaptive algorithms are impossible even if caching techniques are used to avoid accessing the processorstomemory interconnection network.
Lamport on Mutual Exclusion: 27 Years of Planting Seeds
 In 20th ACM Symposium on Principles of Distributed Computing
, 2001
"... Mutual exclusion is a topic that Leslie Lamport has returned to many times throughout his career. This article, which is being written in celebration of Lamport's sixtieth birthday, is an attempt to survey some of his many contributions to research on this topic. ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Mutual exclusion is a topic that Leslie Lamport has returned to many times throughout his career. This article, which is being written in celebration of Lamport's sixtieth birthday, is an attempt to survey some of his many contributions to research on this topic.
Time Complexity Bounds for Sharedmemory Mutual Exclusion
, 2001
"... The primary goal of my work is to close the gap between lower and upper bounds on the time complexity of the mutual exclusion problem in sharedmemory multiprocessor systems. Mutual exclusion algorithms are used to resolve conicting accesses to shared resources by asynchronous, concurrent process ..."
Abstract
 Add to MetaCart
The primary goal of my work is to close the gap between lower and upper bounds on the time complexity of the mutual exclusion problem in sharedmemory multiprocessor systems. Mutual exclusion algorithms are used to resolve conicting accesses to shared resources by asynchronous, concurrent processes. The problem of designing such an algorithm is widely regarded as the preeminent \classic" problem in concurrent programming. In this proposal, the time complexity of a mutual exclusion algorithm is dened as the number of remote memory references generated by a process to enter and exit its critical section. Under this measure, constanttime algorithms are known that use primitives such as fetchandadd and fetchandstore. However, it has been shown that no such constanttime algorithm is possible that uses reads, writes, and comparison primitives. My dissertation aims to provide optimal time bounds for algorithms based on such primitives. 1
Appendix A
, 61
"... or AED 512 color graphics terminal arch2rad  convert Architrion text file to RADIANCE description calc  calculator cnt  index counter dayfact  compute illuminance and daylight factor on workplane ev  evaluate expressions falsecolor  make a false color RADIANCE picture findglare  locate glare ..."
Abstract
 Add to MetaCart
or AED 512 color graphics terminal arch2rad  convert Architrion text file to RADIANCE description calc  calculator cnt  index counter dayfact  compute illuminance and daylight factor on workplane ev  evaluate expressions falsecolor  make a false color RADIANCE picture findglare  locate glare sources in a RADIANCE scene genbox  generate a RADIANCE description of a box genprism  generate a RADIANCE description of a prism genrev  generate a RADIANCE description of surface of revolution gensky  generate a RADIANCE description of the sky gensurf  generate a RADIANCE description of a functional surface genworm  generate a RADIANCE description of a functional worm getbbox  compute bounding box for RADIANCE scene getinfo  get header information from a RADIANCE file glare  perform glare and visual comfort calculations glarendx  calculate glare index ies2rad  convert IES luminaire data to RADIANCE description lam  laminate lines of multiple files lampcolor  compute spectral r