Publications by Martin Hutle | EPFL Graph Search

Related publications (13)

Structured Derivation of Semi-Synchronous Algorithms

André Schiper, Martin Hutle, Zarko Milosevic, Fatemeh Borran

The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, ...

2011

Swift Algorithms for Repeated Consensus

André Schiper, Martin Hutle, Nuno Filipe de Sousa Santos, Fatemeh Borran

We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no timeout expires, i.e., the algorithm execution proceeds with the actual spe ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2010

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for \emph{the algorithms we analyzed}, in most cases, the decentralized ...

IEEE2011

Tolerating permanent and transient value faults

André Schiper, Martin Hutle, Zarko Milosevic

Transmission faults allow us to reason about permanent and transient value faults in a uniform way. However, all existing solutions to consensus in this model are either in the synchronous system, or require strong conditions for termination, that exclude ...

Springer Verlag2014

On the Reduction of Atomic Broadcast to Consensus with Byzantine Faults

André Schiper, Martin Hutle, Zarko Milosevic

We investigate the reduction of atomic broadcast to consensus in systems with Byzantine faults. Among the several definitions of Byzantine consensus that differ only by their validity property, we identify those equivalent to atomic broadcast. Finally, we ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

In search of lost time

Martin Hutle

Dwork, Lynch, and Stockmeyer [3] and Lamport [4] showed that, in order to solve Consensus in a distributed system, it is sufficient that the system behaves well during a finite period of time. In sharp contrast, Chandra. Hadzilacos, and Toueg [6] proved th ...

2010

Latency-aware Leader Election

André Schiper, Martin Hutle, Nuno Filipe de Sousa Santos

Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the problem of electing a leader that is eventually not only correct (as aptured by the fa ...

ACM2009

Consensus when all processes may be Byzantine for some time

Martin Hutle, Martin Biely

Among all classes of faults, Byzantine faults form the most general modeling of value faults. Traditionally, in the Byzantine fault model, faults are statically attributed to a set of up to t processes. This, however, implies that in this model a process a ...

2011

Quantitative Analysis of Consensus Algorithms

André Schiper, Martin Hutle, Nuno Filipe de Sousa Santos, Fatemeh Borran

Consensus is one of the key problems in fault-tolerant distributed computing. Although the solvability of consensus is now a well-understood problem, comparing different algorithms in terms of efficiency is still an open problem. In this paper, we address ...

2012

Chasing the Weakest System Model for Implementing Omega and Consensus

Martin Hutle

Aguilera et al. and Malkhi et al. presented two system models, which are weaker than all previously proposed models where the eventual leader election oracle Omega can be implemented, and thus, consensus can also be solved. The former model assumes unicast ...

2009

Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency

André Schiper, Martin Hutle, Zarko Milosevic

The paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes authenticated Byzantine faults, where messages can be signed by the sending process (with the assumption tha ...

Springer-Verlag2009

Communication Predicates: A High-Level Abstraction for Coping with Transient and Dynamic Faults

André Schiper, Martin Hutle

IEEE2007

Tolerating Corrupted Communication

André Schiper, Martin Hutle, Martin Biely

ACM2007