Results 1  10
of
1,847,307
A simple constructive computability theorem for waitfree computation
 In: Proceedings of the 1994 ACM Symposium on Theory of Computing 243–252
, 1994
"... I ..."
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
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
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
is proved. In contrast, there exists a nonwaitfree algorithm that solves this problem in constant time. This implies an (log n) time separation between the waitfree and nonwaitfree computation models. On the positive side, we present an O(log n) time waitfree approximate agreement algorithm
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
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
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
? ) 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
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
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
Results 1  10
of
1,847,307