Name
Abstract | ||
|---|---|---|
In this paper, we show how to build synchronized clocks of arbitrary size atop of existing small-sized clocks, despite arbitrary faults. Our solution is both self-stabilizing and Byzantine fault-tolerant, and needs merely single-bit channels. It involves a reduction to Byzantine fault-tolerant consensus, which allows different consensus algorithms to be plugged in for matching the actual clock sizes and resilience requirements best. We demonstrate the practicability of our approach by means of an FPGA implementation and its experimental evaluation. To also address the cases where deterministic algorithms hit fundamental limits, we provide a novel randomized self-stabilizing Byzantine consensus algorithm that works very well also in these settings, along with its correctness proof and stabilization time analysis. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/DSD.2013.97 | DSD |
Keywords | Field | DocType |
byzantine fault-tolerant,deterministic algorithm,byzantine consensus algorithm,global time,actual clock size,arbitrary size,arbitrary fault,correctness proof,different consensus algorithm,efficient construction,arbitrary faults,fpga implementation,byzantine fault-tolerant consensus,consensus,clock synchronization,fault tolerance,self stabilization,system on chip | System on a chip,Computer science,Field-programmable gate array,Communication channel,Self-stabilization,Real-time computing,Fault tolerance,Clock synchronization,Global time,Quantum Byzantine agreement,Distributed computing | Conference |
Citations | PageRank | References |
3 | 0.39 | 20 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christoph Lenzen | 1 | 584 | 40.61 |
| Matthias Függer | 2 | 167 | 21.14 |
| Markus Hofstätter | 3 | 3 | 0.39 |
| Ulrich Schmid | 4 | 127 | 17.24 |