Brief announcement: a shared disk on distributed storage

Authors:
Stefan Vijzelaar;Herbert Bos;Wan Fokkink
Affiliations:
Vrije Universiteit Amsterdam, Amsterdam, Netherlands;Vrije Universiteit Amsterdam, Amsterdam, Netherlands;Vrije Universiteit Amsterdam, Amsterdam, Netherlands
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 9
Cited 0

Linearizability: a correctness condition for concurrent objects

ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimal multi-writer multi-reader atomic register

PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Deconstructing paxos

ACM SIGACT News
FAB: building distributed enterprise disk arrays from commodity components

ASPLOS XI Proceedings of the 11th international conference on Architectural support for programming languages and operating systems
Bounded time-stamps

Distributed Computing
The complexity of obstruction-free implementations

Journal of the ACM (JACM)
Randomized wait-free consensus using an atomicity assumption

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A shared disk implementation on distributed storage requires consistent behavior of disk operations. Deterministic consensus on such behavior is impossible when even a single storage node can fail. Atomic registers show how consistency can be achieved without reaching consensus, but suffer from a crash consistency problem. The presented shared disk algorithm, based on atomic registers and probabilistic consensus, can survive multiple storage node failures, as long as a majority of nodes respond.