Skip to search formSkip to main contentSkip to account menu
Optimal Bounds for the Predecessor Problem and Related Problems
TLDR
The lower bounds are proved for a large class of problems, including both static and dynamic predecessor problems, in a much stronger communication game model, but they apply to the cell probe and RAM models.
View via Publisher
Non-blocking binary search trees
This paper describes the first complete implementation of a non-blocking binary search tree in an asynchronous shared-memory system using single-word compare-and-swap operations. The implementation…
View on ACM
Optimal bounds for the predecessor problem
TLDR
The upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed efficiently stored set are obtained and apply to the cell probe and RAM models and to both static and dynamic predecessor problems.
View on ACM
SNZI: scalable NonZero indicators
We introduce the SNZI shared object, which is related to traditional shared counters, but has weaker semantics. We also introduce a resettable version of SNZI called SNZI-R. We present…
View on ACM
A general technique for non-blocking trees
TLDR
A general technique for obtaining provably correct, non-blocking implementations of a large class of tree data structures where pointers are directed from parents to children and an experimental performance analysis demonstrates that the Java implementation of a chromatic tree rivals, and often significantly outperforms, other leading concurrent dictionaries.
View on ACM
On the space complexity of randomized synchronization
TLDR
It is shown that, using historyless objects, V(=n) object instances are necessary to solve n-process consensus, and this lower bound holds even if the objects have unbounded size and the termination requirement is nondeterministic solo termination, a property strictly weaker than randomized wait-freedom.
View on ACM
Relations between concurrent-write models of parallel computation
TLDR
By fixing the number of processors and parametrizing theNumber of shared memory cells, tight separation results between the models are obtained, thereby partially answering open questions of Vishkin [V].
View on ACM
Hundreds of impossibility results for distributed computing
Abstract.We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered…
View on Springer
On the Inherent Sequentiality of Concurrent Objects
We present $\Omega(n)$ lower bounds on the worst case time to perform a single instance of an operation in any nonblocking implementation of a large class of concurrent data structures shared by n…
View PDF
Obstruction-Free Algorithms Can Be Practically Wait-Free
TLDR
This work presents a transformation that converts any obstruction-free algorithm into one that is wait-free when analyzed in the unknown-bound semisynchronous model, implying that, for all practical purposes, obstruction- free implementations can provide progress guarantees equivalent to wait-freedom.
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License