Fork sequential consistency is blocking

Authors:
Christian Cachin;Idit Keidar;Alexander Shraer
Affiliations:
IBM Research, Zurich Research Laboratory, CH-8803 Rüschlikon, Switzerland;Department of Electrical Engineering, Technion, Haifa 32000, Israel;Department of Electrical Engineering, Technion, Haifa 32000, Israel
Venue:
Information Processing Letters
Year:
2009

Citing 11
Cited 4

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Sequential consistency versus linearizability

ACM Transactions on Computer Systems (TOCS)
Reaching Agreement in the Presence of Faults

Journal of the ACM (JACM)
Distributed Algorithms

Distributed Algorithms
Building secure file systems out of byzantine storage

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Secure untrusted data repository (SUNDR)

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Efficient fork-linearizable access to untrusted shared memory

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs

IEEE Transactions on Computers
Lock-free consistency control for web 2.0 applications

Proceedings of the 17th international conference on World Wide Web
On consistency of encrypted files

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Trusting the cloud

ACM SIGACT News
Abortable Fork-Linearizable Storage

OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Venus: verification for untrusted cloud storage

Proceedings of the 2010 ACM workshop on Cloud computing security workshop
Fail-Aware Untrusted Storage

SIAM Journal on Computing

Quantified Score

Hi-index	0.89

Visualization

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.