Results 1  10
of
150
The Decidability of Distributed Decision Tasks
 In Proceedings of the twentyninth annual ACM symposium on Theory of computing
, 1997
"... ) Maurice Herlihy Computer Science Department Brown University, Providence RI 02912 herlihy@cs.brown.edu Sergio Rajsbaum y Instituto de Matem'aticas U.N.A.M., D.F. 04510, M'exico rajsbaum@servidor.unam.mx Abstract A task is a distributed coordination problem in which each proces ..."
Abstract

Cited by 14 (5 self)
 Add to MetaCart
) Maurice Herlihy Computer Science Department Brown University, Providence RI 02912 herlihy@cs.brown.edu Sergio Rajsbaum y Instituto de Matem'aticas U.N.A.M., D.F. 04510, M'exico rajsbaum@servidor.unam.mx Abstract A task is a distributed coordination problem in which each
In sequential...
"... Today’s column deals with the theory of computability in a distributed system. It features a tutorial on this topic by Maurice Herlihy, Sergio Rajsbaum, and Michel Raynal. The tutorial focuses on a canonical asynchronous computation model, where processes communicate by writing to and reading from s ..."
Abstract
 Add to MetaCart
Today’s column deals with the theory of computability in a distributed system. It features a tutorial on this topic by Maurice Herlihy, Sergio Rajsbaum, and Michel Raynal. The tutorial focuses on a canonical asynchronous computation model, where processes communicate by writing to and reading from
Topology Control and Routing in Ad hoc Networks: A Survey
 SIGACT News
, 2002
"... this article, we review some of the characteristic features of ad hoc networks, formulate problems and survey research work done in the area. We focus on two basic problem domains: topology control, the problem of computing and maintaining a connected topology among the network nodes, and routing. T ..."
Abstract

Cited by 166 (0 self)
 Add to MetaCart
this article, we review some of the characteristic features of ad hoc networks, formulate problems and survey research work done in the area. We focus on two basic problem domains: topology control, the problem of computing and maintaining a connected topology among the network nodes, and routing. This article is not intended to be a comprehensive survey on ad hoc networking. The choice of the problems discussed in this article are somewhat biased by the research interests of the author
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
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 algebraic and combinatorial topology, in which a task's possible input and output values are each associated with highdimensional geometric structures called simplicial complexes. We characterize computability in terms of the topological properties of these complexes. This characterization has a surprising geometric interpretation: a task is solvable if and only if the complex representing the task's allowable inputs can be mapped to the complex representing the task's allowable outputs by a function satisfying certain simple regularity properties. Our formalism thus replaces the "operational" notion of a waitfree decision task, expressed in terms of interleaved computations unfolding ...
Some perspectives on PODC
, 2003
"... Hagit Attiya and Sergio Raisbaum asked me quite some time... ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Hagit Attiya and Sergio Raisbaum asked me quite some time...
On the Cost of FaultTolerant Consensus When There Are No Faults  A Tutorial
, 2001
"... We consider the consensus problem in asynchronous models enriched with unreliable failure detectors or partial synchrony, where processes can crash or links may fail by losing messages. ..."
Abstract

Cited by 68 (8 self)
 Add to MetaCart
We consider the consensus problem in asynchronous models enriched with unreliable failure detectors or partial synchrony, where processes can crash or links may fail by losing messages.
A Semantic View On Distributed Computability And Complexity
 In Proceedings of the 3rd Theory and Formal Methods Section Workshop. Imperial
, 1996
"... This paper intends to give a semantical perspective on the recent work by Herlihy, Shavit and Rajsbaum on computability and complexity results for tresilient and waitfree protocols for distributed systems. It is an extended abstract a of a talk given at the Imperial College Workshop, Oxford, Chr ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
This paper intends to give a semantical perspective on the recent work by Herlihy, Shavit and Rajsbaum on computability and complexity results for tresilient and waitfree protocols for distributed systems. It is an extended abstract a of a talk given at the Imperial College Workshop, Oxford
Communication Networks]: Distributed Systems; C.4 [Performance of Systems]: Fault Tolerance
"... In a tutorial at PODC 2002, Keidar and Rajsbaum [3] asked, among other questions, what are the weakest requirements on systems that allow to implement the different classes of failure detectors. In this brief announcement we explore the minimal system requirements to implement unreliable failure det ..."
Abstract
 Add to MetaCart
In a tutorial at PODC 2002, Keidar and Rajsbaum [3] asked, among other questions, what are the weakest requirements on systems that allow to implement the different classes of failure detectors. In this brief announcement we explore the minimal system requirements to implement unreliable failure
A Layered Analysis of Consensus
 SIAM J. Comput
, 2002
"... Abstract. This paper introduces a simple notion of layering as a tool for analyzingwellbehaved runs of a given model of distributed computation. Using layering, a modelindependent analysis of the consensus problem is performed and then applied to provinglower bounds and impossibility results for c ..."
Abstract

Cited by 32 (8 self)
 Add to MetaCart
Abstract. This paper introduces a simple notion of layering as a tool for analyzingwellbehaved runs of a given model of distributed computation. Using layering, a modelindependent analysis of the consensus problem is performed and then applied to provinglower bounds and impossibility results for consensus in a number of familiar and less familiar models. The proofs are simpler and more direct than existingones, and they expose a unified structure to the difficulty of reachingconsensus. In particular, the proofs for the classical synchronous and asynchronous models now follow the same outline. A new notion of connectivity amongstates in runs of a consensus protocol, called potence connectivity, is introduced. This notion is more general than previous notions of connectivity used for this purpose and plays a key role in the uniform analysis of consensus.
Randomized Protocols for Asynchronous Consensus
 Distributed Computing
, 2002
"... The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to solve the consensus problem in a natural model of an asynchronous distributed system if even a single process can fail. Since its publication, two decades of work on faulttolerant asynchronous consensus algor ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to solve the consensus problem in a natural model of an asynchronous distributed system if even a single process can fail. Since its publication, two decades of work on faulttolerant asynchronous consensus algorithms have evaded this impossibility result by using extended models that provide (a) randomization, (b) additional timing assumptions, (c) failure detectors, or (d) stronger synchronization mechanisms than are available in the basic model. Concentrating on the first of these approaches, we illustrate the history and structure of randomized asynchronous consensus protocols by giving detailed descriptions of several such protocols.
Results 1  10
of
150