| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428713 | Information Processing Letters | 2009 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
