Byzantine consensus in asynchronous message-passing systems: a survey
Consensus is a classical distributed systems problem with both theoretical and practical
interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the …
interest. Asynchronous Byzantine consensus is currently at the core of some solutions for the …
[BOOK][B] Fault-tolerant message-passing distributed systems: an algorithmic approach
M Raynal - 2018 - books.google.com
This book presents the most important fault-tolerant distributed programming abstractions
and their associated distributed algorithms, in particular in terms of reliable communication …
and their associated distributed algorithms, in particular in terms of reliable communication …
Sigfree: A signature-free buffer overflow attack blocker
We propose SigFree, an online signature-free out-of-the-box application-layer method for
blocking code-injection buffer overflow attack messages targeting at various Internet …
blocking code-injection buffer overflow attack messages targeting at various Internet …
Communication-efficient leader election and consensus with limited link synchrony
We study the degree of synchrony required to implement the leader election failure detector
Ω and to solve consensus in partially synchronous systems. We show that in a system with n …
Ω and to solve consensus in partially synchronous systems. We show that in a system with n …
Travelling through wormholes: a new look at distributed systems models
PE Veríssimo - ACM SIGACT News, 2006 - dl.acm.org
The evolution of distributed computing and applications has put new challenges on models,
architectures and systems. To name just one,'reconciling uncertainty with predictability'is …
architectures and systems. To name just one,'reconciling uncertainty with predictability'is …
[BOOK][B] Communication and agreement abstractions for fault-tolerant asynchronous distributed systems
M Raynal - 2022 - books.google.com
Understanding distributed computing is not an easy task. This is due to the many facets of
uncertainty one has to cope with and master in order to produce correct distributed software …
uncertainty one has to cope with and master in order to produce correct distributed software …
A short introduction to failure detectors for asynchronous distributed systems
M Reynal - ACM SIGACT News, 2005 - dl.acm.org
Since the first version of Chandra and Toueg's seminal paper titled" Unreliable failure
detectors for reliable distributed systems" in 1991, the failure detector concept has been …
detectors for reliable distributed systems" in 1991, the failure detector concept has been …
From static distributed systems to dynamic systems
A noteworthy advance in distributed computing is due to the recent development of peer-to-
peer systems. These systems are essentially dynamic in the sense that no process can get a …
peer systems. These systems are essentially dynamic in the sense that no process can get a …
Accelerating large-scale HPC Applications using FPGAs
R Dimond, S Racaniere, O Pell - 2011 IEEE 20th Symposium …, 2011 - ieeexplore.ieee.org
Field Programmable Gate Arrays (FPGAs) are conventionally considered as' glue-logic'.
However, modern FPGAs are extremely competitive compared to state-of-the-art CPUs for …
However, modern FPGAs are extremely competitive compared to state-of-the-art CPUs for …
On the possibility of consensus in asynchronous systems with finite average response times
It has long been known that the consensus problem cannot be solved deterministically in
completely asynchronous distributed systems, ie, systems (1) without assumptions on …
completely asynchronous distributed systems, ie, systems (1) without assumptions on …