Results 1  10
of
1,284,099
WaitFree Synchronization
 ACM Transactions on Programming Languages and Systems
, 1993
"... A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another lie ..."
Abstract

Cited by 873 (28 self)
 Add to MetaCart
A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another
Are WaitFree Algorithms Fast?
, 1991
"... The time complexity of waitfree algorithms in "normal" executions, where no failures occur and processes operate at approximately the same speed, is considered. A lower bound of log n on the time complexity of any waitfree algorithm that achieves approximate agreement among n processes i ..."
Abstract

Cited by 39 (11 self)
 Add to MetaCart
The time complexity of waitfree algorithms in "normal" executions, where no failures occur and processes operate at approximately the same speed, is considered. A lower bound of log n on the time complexity of any waitfree algorithm that achieves approximate agreement among n processes
Robust waitfree hierarchies
 Journal of the ACM
, 1997
"... Abstract. The problem of implementing a shared object of one type from shared objects of other types has been extensively researched. Recent focus has mostly been on waitfree implementations, which permit every process to complete its operations on implemented objects, regardless of the speeds of o ..."
Abstract

Cited by 35 (0 self)
 Add to MetaCart
Abstract. The problem of implementing a shared object of one type from shared objects of other types has been extensively researched. Recent focus has mostly been on waitfree implementations, which permit every process to complete its operations on implemented objects, regardless of the speeds
WaitFree Consensus
, 1992
"... Consensus is a decision problem in which n processors, each starting with a value not known to the others, must collectively agree on a single value. If the initial values are equal, the processors must agree on that common value ..."
Abstract
 Add to MetaCart
Consensus is a decision problem in which n processors, each starting with a value not known to the others, must collectively agree on a single value. If the initial values are equal, the processors must agree on that common value
Notes on WaitFree Spans
, 1998
"... simplicial complexes and maps. The topological spaces that arise in the study of faulttolerant computation in asynchronous distributed systems are given by discrete data, such as configurations of input values for the processes. These spaces can be described using simplicial complexes. In this sub ..."
Abstract
 Add to MetaCart
simplicial complexes and maps. The topological spaces that arise in the study of faulttolerant computation in asynchronous distributed systems are given by discrete data, such as configurations of input values for the processes. These spaces can be described using simplicial complexes. In this subsection we give a host of definitions. Abstractly, a simplicial complex is a family K of nonempty finite sets that satisfies the following hereditary property : if X 2 K and X 0 is a nonempty subset of X , then X 0 2 K. A subset L ` K is a subcomplex if L is a simplicial complex, which simply means that L itself satisfies the hereditary property. Given any set K of nonempty finite sets, one may form a simplicial complex K by adding any missing sets required by the hereditary property: K = fX 0 : ; 6= X 0 ` X for some X 2 Kg : The complex K formed in this fashion is said to be generated by the set K. An element X 2 K is called a simplex , and the elements of X are its vertice...
The Topological Structure of Asynchronous Computability
 JOURNAL OF THE ACM
, 1996
"... We give necessary and sufficient combinatorial conditions characterizing the tasks that can be solved by asynchronous processes, of which all but one can fail, that communicate by reading and writing a shared memory. We introduce a new formalism for tasks, based on notions from classical algebra ..."
Abstract

Cited by 157 (12 self)
 Add to MetaCart
the "operational" notion of a waitfree decision task, expressed in terms of interleaved computations unfolding ...
ZooKeeper: Waitfree Coordination for Internetscale Systems
 In USENIX Annual Technical Conference
"... In this paper, we describe ZooKeeper, a service for coordinating processes of distributed applications. Since ZooKeeper is part of critical infrastructure, ZooKeeper aims to provide a simple and high performance kernel for building more complex coordination primitives at the client. It incorporates ..."
Abstract

Cited by 204 (7 self)
 Add to MetaCart
elements from group messaging, shared registers, and distributed lock services in a replicated, centralized service. The interface exposed by ZooKeeper has the waitfree aspects of shared registers with an eventdriven mechanism similar to cache invalidations of distributed file systems to provide a
Computable Obstructions to Waitfree Computability
 Distributed Computing
, 2000
"... Effectively computable obstructions are associated to a distributed decision task (I; O; \Delta) in the asynchronous, waitfree, readwrite sharedmemory model. The key new ingredient of this work is the association of a simplicial complex T , the task complex , to the inputoutput relation \De ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Effectively computable obstructions are associated to a distributed decision task (I; O; \Delta) in the asynchronous, waitfree, readwrite sharedmemory model. The key new ingredient of this work is the association of a simplicial complex T , the task complex , to the inputoutput relation
Locality and Checkability in Waitfree Computing
"... Abstract. This paper studies several notions of locality that are inherent to the specification of distributed tasks and independent of the computing environment, and investigates the ability of a shared memory waitfree system to solve tasks satisfying various forms of locality. First, we define a ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
Abstract. This paper studies several notions of locality that are inherent to the specification of distributed tasks and independent of the computing environment, and investigates the ability of a shared memory waitfree system to solve tasks satisfying various forms of locality. First, we define
Results 1  10
of
1,284,099