Reconciling fault-tolerant distributed computing and systems-on-chip
From MaRDI portal
Publication:424907
DOI10.1007/S00446-011-0151-7zbMATH Open1284.68071OpenAlexW2167308418MaRDI QIDQ424907FDOQ424907
Matthias Függer, Ulrich Schmid
Publication date: 7 June 2012
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-011-0151-7
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Cites Work
- Title not available (Why is that?)
- General theory of metastable operation
- Impossibility of distributed consensus with one faulty process
- Optimal precision in the presence of uncertainty
- On the possibility and impossibility of achieving clock synchronization
- Compiling communicating processes into delay-insensitive VLSI circuits
- On the existence of delay-insensitive fair arbiters: Trace theory and its limitations
- Buridan's principle
- The Theta-Model: achieving synchrony without clocks
- A theory of clock synchronization (extended abstract)
- Distributed order scheduling and its application to multi-core dram controllers
- Optimal and efficient clock synchronization under drifting clocks
- Title not available (Why is that?)
- Optimal Clock Synchronization under Different Delay Assumptions
- Consensus algorithms with one-bit messages
- A formal approach to designing delay-insensitive circuits
Cited In (10)
- Optimal fault-tolerant computing on multiprocessor systems
- On fault-tolerant structure, distributed fault-diagnosis, reconfiguration, and recovery of the array processors
- HEX: scaling honeycombs is easier than scaling clock trees
- Self-stabilizing Byzantine clock synchronization with optimal precision
- Fault-tolerant algorithms for tick-generation in asynchronous logic
- On specifications and proofs of timed circuits
- Title not available (Why is that?)
- Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms
- Fire!
- Rigorously modeling self-stabilizing fault-tolerant circuits: an ultra-robust clocking scheme for systems-on-chip
Uses Software
This page was built for publication: Reconciling fault-tolerant distributed computing and systems-on-chip
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424907)