Sciweavers

PODC
1992
ACM
13 years 8 months ago
The Weakest Failure Detector for Solving Consensus
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In Chandra and Toueg [199...
Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toue...
SRDS
1996
IEEE
13 years 9 months ago
Fail-Aware Failure Detectors
In existing asynchronous distributed systems it is impossible to implement failure detectors which are perfect, i.e. they only suspect crashed processes and eventually suspect all...
Christof Fetzer, Flaviu Cristian
AC
1999
Springer
13 years 9 months ago
Consensus in Asynchronous Distributed Systems: A Concise Guided Tour
Abstract. It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is o...
Rachid Guerraoui, Michel Hurfin, Achour Most&eacut...
PODC
1999
ACM
13 years 9 months ago
On k-Set Consensus Problems in Asynchronous Systems
ÐIn this paper, we investigate the k-set consensus problem in asynchronous distributed systems. In this problem, each participating process begins the protocol with an input value...
Roberto De Prisco, Dahlia Malkhi, Michael K. Reite...
ICDCS
2003
IEEE
13 years 10 months ago
Elastic Vector Time
In recent years there has been an increasing demand to build ”soft” real-time applications on top of asynchronous distributed systems. Designing and implementing such applicat...
Christof Fetzer, Michel Raynal
DSN
2003
IEEE
13 years 10 months ago
Reliable Broadcast in a Computational Hybrid Model with Byzantine Faults, Crashes, and Recoveries
This paper presents a formal model for asynchronous distributed systems with servers that may exhibit Byzantine faults or crash and subsequently recover. The model is computationa...
Michael Backes, Christian Cachin