Fault-tolerant algorithms for tick-generation in asynchronous logic: robust pulse generation

DOI10.1145/2560561MaRDI QIDQ5501934zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

metastabilityself-stabilizationclock synchronizationByzantine faultslinear convergence timemulti-synchronous GALS

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 2061537 (Why is no real title available?)
• A lower bound for the time to assure interactive consistency
• An upper and lower bound for clock synchronization
• Closed form bounds for clock synchronization under simple uncertainty assumptions
• Easy impossibility proofs for distributed consensus problems
• Fast self-stabilizing Byzantine tolerant digital clock synchronization
• General theory of metastable operation
• Lower bounds for randomized consensus under a weak adversary
• Optimal gradient clock synchronization in dynamic networks
• Reaching Agreement in the Presence of Faults
• Reaching approximate agreement in the presence of faults
• Reconciling fault-tolerant distributed computing and systems-on-chip
• Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
• Self-stabilizing Byzantine agreement
• Self-stabilizing clock synchronization in the presence of Byzantine faults
• The Byzantine generals strike again
• The Theta-Model: achieving synchrony without clocks
• Tight bounds for clock synchronization

Cited in

(5)

• HEX: scaling honeycombs is easier than scaling clock trees
• Reconciling fault-tolerant distributed computing and systems-on-chip
• Self-stabilizing Byzantine clock synchronization with optimal precision
• 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)