论文信息 - Fork sequential consistency is blocking

Fork sequential consistency is blocking

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.

Idit Keidar | Alexander Shraer | Christian Cachin

[1] Dennis Shasha,et al. Secure Untrusted Data Repository (SUNDR) , 2004, OSDI.

[2] Hagit Attiya,et al. Sequential consistency versus linearizability , 1994, TOCS.

[3] Dennis Shasha,et al. Building secure file systems out of byzantine storage , 2002, PODC '02.

[4] Maurice Herlihy,et al. Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[5] Leslie Lamport,et al. How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[6] Abhi Shelat,et al. Efficient fork-linearizable access to untrusted shared memory , 2007, PODC '07.

[7] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.

[8] Haixun Wang,et al. Lock-free consistency control for web 2.0 applications , 2008, WWW.

[9] Michael K. Reiter,et al. On Consistency of Encrypted Files , 2006, DISC.

[10] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.

[11] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.