skip to main content
10.1145/1835698.1835718acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
short-paper

Brief announcement: a shared disk on distributed storage

Published: 25 July 2010 Publication History

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.

References

[1]
Marcos K. Aguilera and Svend Frolund. Strict linearizability and the power of aborting. Technical Report HPL-2003-241, HP Laboratories Palo Alto, 2003.
[2]
Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124--142, January 1995.
[3]
Hagit Attiya, Rachid Guerraoui, Danny Hendler, and Petr Kuznetsov. The complexity of obstruction-free implementations. J. ACM, 56(4):1--33, 2009.
[4]
Romain Boichat, Partha Dutta, Svend Frølund, and Rachid Guerraoui. Deconstructing paxos. SIGACT News, 34(1):47--67, 2003.
[5]
Ling Cheung. Randomized wait-free consensus using an atomicity assumption. In Proceedings OPODIS 2005, pages 36--45, 2005.
[6]
Michael J. Fischer, Nancy A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty processor. Journal of the ACM, 32(2):374--382, April 1985.
[7]
Maurice P. Herlihy and Jeannette M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463--492, 1990.
[8]
Amos Israeli and Ming Li. Bounded time-stamps. Distributed Computing, 6(4):205--209, 1993.
[9]
Amos Israeli and Amnon Shaham. Optimal multi-writer multi-reader atomic register. In Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, pages 71--82. ACM, 1992.
[10]
Leslie Lamport. On interprocess communication. Distributed Computing, 1(2):77--101, 1986.
[11]
Yasushi Saito, Svend Frolund, Alistair Veitch, Arif Merchant, and Susan Spence. Fab: building distributed enterprise disk arrays from commodity components. In ASPLOS-XI: Proceedings of the 11th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 48--58. ACM, 2004.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
July 2010
494 pages
ISBN:9781605588889
DOI:10.1145/1835698

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. atomic registers
  2. consistency
  3. probabilistic consensus
  4. redundancy
  5. shared disk semantics
  6. storage
  7. strict linearizability

Qualifiers

  • Short-paper

Conference

PODC '10
Sponsor:

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 108
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)1
Reflects downloads up to 06 Nov 2024

Other Metrics

Citations

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media