Publication
Quantitative Analysis of Consensus Algorithms
Related publications (33)
Language Model Decoding as Likelihood–Utility Alignment
Boi Faltings, Robert West, Maxime Jean Julien Peyrard, Martin Josifoski, Valentin Hartmann, Debjit Paul, Jiheng Wei, Frano Rajic
A critical component of a successful language generation pipeline is the decoding algorithm. However, the general principles that should guide the choice of a decoding algorithm re- main unclear. Previous works only compare decoding algorithms in narrow sc ...
2023Automated Design: A Journey Across Modelling, Optimization, and Education
Machine intelligence greatly impacts almost all domains of our societies. It is profoundly changing the field of mechanical engineering with new technical possibilities and processes. The education of future engineers also needs to adapt in terms of techni ...
EPFL2021The Impact of RDMA on Agreement
Rachid Guerraoui, Mihail Igor Zablotchi, Naama Ben David
Remote Direct Memory Access (RDMA) is becoming widely available in data centers. This technology allows a process to directly read and write the memory of a remote host, with a mechanism to control access permissions. In this paper, we study the fundamenta ...
2019LPN in Cryptography
The security of public-key cryptography relies on well-studied hard problems, problems for which we do not have efficient algorithms. Factorization and discrete logarithm are the two most known and used hard problems. Unfortunately, they can be easily solv ...
EPFL2017Optimal polynomial blow up range for critical wave maps
We prove that the critical Wave Maps equation with target and origin ℝ admits energy class blow up solutions of the form [ u(t, r) = Q(\lambda(t)r) + \epsilon(t, r) ] where is the ground state harmonic map and $\lambda ...
EPFL2015Abstractions for Solving Consensus and Related Problems with Byzantine Faults
We become increasingly dependent on online services; therefore, their availability and correct behavior become increasingly important. Software replication is a popular technique for ensuring that computer systems continue to provide a correct service even ...
EPFL2013Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms
André Schiper, Pamela Isabel Delgado Borda, Zarko Milosevic, Martin Biely
We introduce Disal, a new framework that simplifies turning pseudocode of fault tolerant distributed algorithms into efficient executable code. Without proper tool support, even small amounts of pseudocode normally ends up in several thousands of lines of ...
2013Bounded Tamper Resilience: How to go beyond the Algebraic Barrier
Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain a ...
2013Quantitative 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 ...
IEEE2011