HEX: scaling honeycombs is easier than scaling clock trees

DOI10.1016/j.jcss.2016.03.001zbMath1345.68012OpenAlexW2298920868MaRDI QIDQ269518

Danny Dolev, Martin Perner, Matthias Függer, Ulrich Schmid, Christoph Lenzen

Publication date: 18 April 2016

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2016.03.001

zbMATH Keywords

VLSI circuitsself-stabilizationByzantine fault-toleranceclock distributionclock synchronizationcomputer systemsdependable computing simulationsGALS architecturesskew analysis

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)

Related Items (1)

On specifications and proofs of timed circuits

Cites Work

• Reconciling fault-tolerant distributed computing and systems-on-chip
• 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
• Self-stabilizing systems in spite of distributed control
• Logic Synthesis for Asynchronous Controllers and Interfaces
• Fault-tolerant algorithms for tick-generation in asynchronous logic

This page was built for publication: HEX: scaling honeycombs is easier than scaling clock trees