Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
M Raynal, J Stainer - Proceedings of the 2013 ACM symposium on …, 2013 - dl.acm.org
A message adversary is a daemon that suppresses messages in round-based message-
passing synchronous systems in which no process crashes. A property imposed on a …
passing synchronous systems in which no process crashes. A property imposed on a …
Increasing the power of the iterated immediate snapshot model with failure detectors
M Raynal, J Stainer - International Colloquium on Structural Information …, 2012 - Springer
The base distributed asynchronous read/write computation model is made up of n
asynchronous processes which communicate by reading and writing atomic registers only …
asynchronous processes which communicate by reading and writing atomic registers only …
Partial synchrony based on set timeliness
We introduce a new model of partial synchrony for read-write shared memory systems. This
model is based on the notion of set timeliness--a natural and straightforward generalization …
model is based on the notion of set timeliness--a natural and straightforward generalization …
Asynchronous failure detectors
Failure detectors-oracles that provide information about process crashes-are an important
abstraction for crash tolerance in distributed systems. Although current failure-detector …
abstraction for crash tolerance in distributed systems. Although current failure-detector …
The generalized loneliness detector and weak system models for k-set agreement
This paper presents two weak partially synchronous system models M anti (nk) and M sink
(nk), which are just strong enough for solving k-set agreement: We introduce the generalized …
(nk), which are just strong enough for solving k-set agreement: We introduce the generalized …
[PDF][PDF] Round-based synchrony weakened by message adversaries vs asynchrony enriched with failure detectors
M Raynal, J Stainer - Proc. 33rd ACM Symposium on Principles of … - core.ac.uk
A message adversary is a daemon that suppresses messages in round-based message-
passing synchronous systems in which no process crashes. A property imposed on a …
passing synchronous systems in which no process crashes. A property imposed on a …
A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling
A fundamental research theme in distributed computing is the comparison of systems in
terms of their ability to solve basic problems such as consensus that cannot be solved in …
terms of their ability to solve basic problems such as consensus that cannot be solved in …
Computability Abstractions for Fault-tolerant Asynchronous Distributed Computing
J Stainer - 2015 - inria.hal.science
This thesis studies computability in systems composed of multiple computers exchanging
messages or sharing memory. The considered models take into account the possible failure …
messages or sharing memory. The considered models take into account the possible failure …
[BOOK][B] A prescription for partial synchrony
S Sastry - 2011 - search.proquest.com
Algorithms in message-passing distributed systems often require partial synchrony to
tolerate crash failures. Informally, partial synchrony refers to systems where timing bounds …
tolerate crash failures. Informally, partial synchrony refers to systems where timing bounds …
Brief announcement: failure detectors encapsulate fairness
Fairness is a measure of the number of steps a process takes relative to other processes
and/or messages in transit. We argue that failure detectors encapsulate fairness. As …
and/or messages in transit. We argue that failure detectors encapsulate fairness. As …