Person
André Schiper
Related publications (192)
Quantitative Analysis of Consensus Algorithms
André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos
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 ...
2011Timing 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 ...
IEEE2011A Fault-Tolerant Token-Based Atomic Broadcast Algorithm
André Schiper, Nils Richard Ekwall
Many atomic broadcast algorithms have been published in the last 20 years. Token-based algorithms represent a large class of these algorithms. Interestingly, all the token-based atomic broadcast algorithms rely on a group membership service and none of the ...
2011Achieving high-throughput State Machine Replication in multi-core systems
André Schiper, Nuno Filipe de Sousa Santos
State machine replication is becoming an increasingly popular technique among online services to ensure fault-tolerance using commodity hardware. This has led to a renewed interest in its throughput, as these services have typically a large number of users ...
2011On 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 ...
2011Structured Derivation of Semi-Synchronous Algorithms
André Schiper, Martin Hutle, Zarko Milosevic, Fatemeh Borran, Hagit Albo Attiya
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, ...
2011Student mini-kernel project based on an FPGA board
André Schiper, Zarko Milosevic, Omid Shahmirzadi
The paper describes a mini-kernel project in the context of a Concurrent Programming course. The goal of the project is to implement Java monitors and interrupt handling. The platform for the project is an FPGA board developed initially at EPFL for Compute ...
Association for Computing Machinery2011On 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 Usa2011Tuning Paxos for high-throughput with batching and pipelining
André Schiper, Nuno Filipe de Sousa Santos
Paxos is probably the most popular state machine replication protocol. Two optimizations that can greatly improve its performance are batching and pipelining. Nevertheless, tuning these two optimizations to achieve optimal performance can be challenging, a ...
2011The impact of mobility on the time complexity for deterministic broadcasting in radio networks
André Schiper, David Cavin, Yoav Sasson
We study the time complexity for deterministic broadcasting algorithms in mobile radio networks. The broadcast operation consists of a source node successfully communicating its message to every other node. In multi-hop radio networks such as MANETs, the m ...
2011