Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Information Processing Letters
Efficient Algorithms to Implement Unreliable Failure Detectors in Partially Synchronous Systems
Proceedings of the 13th International Symposium on Distributed Computing
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Chasing the Weakest System Model for Implementing Ω and Consensus
IEEE Transactions on Dependable and Secure Computing
Algorithms for extracting timeliness graphs
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
| Hi-index | 0.00 |
In asynchronous message-passing distributed systems prone to process crashes, a communication link is said δ-timely if the communication delay on this link is bounded by some constant δ. We study here in which way processes may approximate and find structural properties based on δ-timeliness (e.g., find δ-timely paths between processes or build a ring between correct processes using only δ-timely links). To that end, we define a notion of approximation of predicates. Then, with help of such approximations, we give a general algorithm that enables to choose and eventually agree on one of these predicates. Finally, applying this approach to δ-timeliness, we give conditions and algorithms to approximate δ-timeliness and dynamically find structural properties using δ-timeliness.