Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
DOI10.1145/2560561zbMATH Open1321.68556OpenAlexW2110142332WikidataQ130884244 ScholiaQ130884244MaRDI QIDQ5501934FDOQ5501934
Authors: Danny Dolev, Matthias Függer, Ulrich Schmid, Christoph Lenzen 
Publication date: 14 August 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2560561
Recommendations
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
- scientific article; zbMATH DE number 7075887
- Reconciling fault-tolerant distributed computing and systems-on-chip
- Principles of Distributed Systems
- Self-stabilizing clock synchronization in the presence of Byzantine faults
metastabilityself-stabilizationclock synchronizationByzantine faultslinear convergence timemulti-synchronous GALS
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Closed form bounds for clock synchronization under simple uncertainty assumptions
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
- Tight bounds for clock synchronization
- General theory of metastable operation
- Reconciling fault-tolerant distributed computing and systems-on-chip
- Reaching Agreement in the Presence of Faults
- The Byzantine generals strike again
- A lower bound for the time to assure interactive consistency
- Reaching approximate agreement in the presence of faults
- Easy impossibility proofs for distributed consensus problems
- The Theta-Model: achieving synchrony without clocks
- Fast self-stabilizing Byzantine tolerant digital clock synchronization
- Self-stabilizing clock synchronization in the presence of Byzantine faults
- Self-stabilizing Byzantine agreement
- Optimal gradient clock synchronization in dynamic networks
- An upper and lower bound for clock synchronization
- Title not available (Why is that?)
- Lower bounds for randomized consensus under a weak adversary
Cited In (5)
- HEX: scaling honeycombs is easier than scaling clock trees
- Self-stabilizing Byzantine clock synchronization with optimal precision
- Reconciling fault-tolerant distributed computing and systems-on-chip
- On specifications and proofs of timed circuits
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
This page was built for publication: Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501934)
