Fork Sequential Consistency is Blocking
classification
💻 cs.DC
keywords
consistencysequentialforkhandpreserveserveraccessalways
read the original abstract
We consider an untrusted server storing shared data on behalf of clients. We show that no storage access protocol can on the one hand preserve sequential consistency and wait-freedom when the server is correct, and on the other hand always preserve fork sequential consistency.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.