Results 1  10
of
159,032
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 849 (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
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
On the Inherent Weakness of Conditional Synchronization Primitives
 In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing
, 2004
"... The “waitfree hierarchy ” classifies multiprocessor synchronization primitives according to their power to solve consensus. The classification is based on assigning a number n to each synchronization primitive, where n is the maximal number of processes for which deterministic waitfree consensus c ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
The “waitfree hierarchy ” classifies multiprocessor synchronization primitives according to their power to solve consensus. The classification is based on assigning a number n to each synchronization primitive, where n is the maximal number of processes for which deterministic waitfree consensus
Randomized WaitFree Naming
 IN ISAAC'94, LNCS NO
, 1994
"... We present new distributed randomized naming protocols improving previous results in renaming and unique processor identity protocols. They are waitfree (which implies maximal faulttolerance) and allow stronger adversaries. They also have low complexity. We give the first waitfree protocol achi ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
achieving optimal key space range. (This is impossible for deterministic waitfree methods, so we use randomization.) We also introduce a novel waitfree object, a testandset object which upon invocation succeeds with probability less than 1, and we give a low complexity implementation of such objects.
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...
Randomized waitfree consensus using an atomicity assumption
, 2005
"... Abstract. We present a randomized algorithm for asynchronous waitfree consensus using multiwriter multireader shared registers. This algorithm is based on earlier work by Chor, Israeli and Li (CIL) and is correct under the assumption that processes can perform a random choice and a write operat ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Abstract. We present a randomized algorithm for asynchronous waitfree consensus using multiwriter multireader shared registers. This algorithm is based on earlier work by Chor, Israeli and Li (CIL) and is correct under the assumption that processes can perform a random choice and a write
Randomized WaitFree Consensus using An Atomicity
"... Abstract. We present a randomized algorithm for asynchronous waitfree consensus using multiwriter multireader shared registers. This algorithm is based on earlier work by Chor, Israeli and Li (CIL) and is correct under the assumption that processes can perform a random choice and a write operati ..."
Abstract
 Add to MetaCart
Abstract. We present a randomized algorithm for asynchronous waitfree consensus using multiwriter multireader shared registers. This algorithm is based on earlier work by Chor, Israeli and Li (CIL) and is correct under the assumption that processes can perform a random choice and a write
The Dynamics of WaitFree Distributed Computations
, 1996
"... ion The basic idea here is to look only at the input/output relations that a given program induces. This is the ordinary denotational view on the semantics of the program (CC92). Formally we define an abstract domain of denotations of programs as D = (fPg \Theta ZZ ? ) 2 [ (fP 0 g \Theta ZZ ? ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
ion The basic idea here is to look only at the input/output relations that a given program induces. This is the ordinary denotational view on the semantics of the program (CC92). Formally we define an abstract domain of denotations of programs as D = (fPg \Theta ZZ ? ) 2 [ (fP 0 g \Theta ZZ ? ) 2 Note the slight difference with a standard (relational) denotational semantics. Instead of computing relations between pairs of values computed by P and Q, we look at solo executions of P and solo executions of Q, i.e. we compute relations between values of P or relations between values of Q. Let us be more formal now. Let p I (fR; Sg; ae) = (P; ae(u)) pO (fR; Sg; ae) = (P; ae(x)) q I (fR; Sg; ae) = (P 0 ; ae(v)) q O (fR; Sg; ae) = (P 0 ; ae(y)) Then the abstraction ff from the transition systems defining the semantics of our E. Goubault 6 language (forming a lattice T with the inclusion of transition systems as order) to the domain D (which is a lattice with the inclusion of r...
Waitfree Byzantine Consensus
 Information Processing Letters
, 2002
"... this paper. A consensus protocol must have some degree of faulttolerance (otherwise the problem is trivial). Among the attributes of a fault are: (1) the entity suering the fault, e.g., the memory itself, or a process that accesses the memory, and (2) the type of the fault, e.g., crash (entity sto ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
advantage of waitfree protocols is that the progress of each participating process is independent of that of the other processes. In particular, a process can progress even if all other processes crash. Thus, a waitfree protocol with n processes tolerates up to n 1 crash failures
Using Sticky Bits for WaitFree Synchronization
"... In this paper we consider implementation of atomic waitfree objects in the context of a sharedmemory multiprocessor. We introduce a new primitive object, the "StickyBit", and show its universality by proving that any safe implementation of a sequential object can be transformed into ..."
Abstract
 Add to MetaCart
into a waitfree atomic one using only Sticky Bits and safe registers. The Sticky Bit may be viewed as a memoryoriented version of consensus. In particular, the results of this paper imply "universality of consensus" in the sense that given an algorithm to achieve nprocessor consensus, we
Results 1  10
of
159,032