Article

How fast can a very robust read be?

Authors:

Rachid Guerraoui,

Marko VukolićAuthors Info & Claims

PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

Pages 248 - 257

https://doi.org/10.1145/1146381.1146419

Published: 23 July 2006 Publication History

Abstract

This paper studies the time complexity of reading unauthenticated data from a distributed storage made of a set of failure-prone base objects. More specifically, we consider the abstraction of a robust read/write storage that provides wait-free access to unauthenticated data over a set of base storage objects with t possible failures, out of which at most b are arbitrary and the rest are simple crash failures.We prove a 2 communication round-trip lower bound for reading from a safe storage that uses at most 2t+2b base objects, independently of the number or round-trips needed by the writer. We then prove the lower bound tight by exhibiting a regular storage that uses 2t+b+1 base objects (optimal resilience) and features 2 communication round-trips for both read and write operations.

References

[1]

I. Abraham, G. V. Chockler, I. Keidar, and D. Malkhi. Byzantine disk paxos: optimal resilience with Byzantine shared memory. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 226--235. ACM Press, 2004. Full version to appear in Distributed Computing.

Digital Library

[2]

I. Abraham, G. V. Chockler, I. Keidar, and D. Malkhi. Wait-free regular storage from Byzantine components. Technical Report MIT-CSAIL-TR-2005-021, MIT, Cambridge, MA, USA, 2005.

[3]

H. Attiya, A. Bar-Noy, and D. Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124--142, 1995.

Digital Library

[4]

R. Bazzi and Y. Ding. Non-skipping timestamps for Byzantine data storage systems. In Proceedings of the 18th International Symposium on Distributed Computing, volume 3274/2004 of Lecture Nodes in Computer Science, pages 405--419, Oct 2004.

[5]

R. A. Bazzi and Y. Ding. Brief announcement: wait-free implementation of multiple-writers/multiple-readers atomic byzantine data storage systems. In M. K. Aguilera and J. Aspnes, editors, PODC, page 353. ACM, 2005.

Digital Library

[6]

C. Cachin and S. Tessaro. Optimal resilience for erasure-coded byzantine distributed storage. Technical Report RZ 3575, IBM Research, February 2005.

Digital Library

[7]

P. Dutta, R. Guerraoui, R. R. Levy, and M. Vukolić. How Fast can a Distributed Atomic Read be? Technical Report LPD-REPORT-2005-001, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland, 2005. Preliminary version appeared in Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, 2004.

Digital Library

[8]

G. Goodson, J. Wylie, G. Ganger, and M. Reiter. Efficient Byzantine-tolerant erasure-coded storage. In Proceedings of the International Conference on Dependable Systems and Networks, pages 135--144, 2004.

Digital Library

[9]

R. Guerraoui, R. R. Levy, and M. Vukolić. Lucky read/write access to robust atomic storage. Technical Report LPD-REPORT-2005-005, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland, 2005. Preliminary version appeared in Proceedings of the International Conference on Dependable Systems and Networks, 2006.

Digital Library

[10]

R. Guerraoui and M. Vukolić. How fast can a very robust read be? Technical Report LPD-REPORT-2006-008, Swiss Federal Institute of Technology (EPFL), School of Computer and Communication Sciences, Lausanne, Switzerland, May 2006.

[11]

M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124--149, January 1991.

Digital Library

[12]

P. Jayanti, T. D. Chandra, and S. Toueg. Fault-tolerant wait-free shared objects. Journal of the ACM, 45(3):451--500, 1998.

Digital Library

[13]

L. Lamport. On interprocess communication. Distributed computing, 1(1):77--101, May 1986.

[14]

L. Lamport, R. Shostak, and M. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, July 1982.

Digital Library

[15]

D. Malkhi and M. Reiter. A high-throughput secure reliable multicast protocol. Journal of Computer Security, 5(2):113--127, 1997.

Digital Library

[16]

D. Malkhi and M. Reiter. Byzantine quorum systems. Distrib. Comput., 11(4):203--213, 1998.

Digital Library

[17]

D. Malkhi and M. K. Reiter. An architecture for survivable coordination in large distributed systems. IEEE Transactions on Knowledge and Data Engineering, 12(2):187--202, 2000.

Digital Library

[18]

J.-P. Martin, L. Alvisi, and M. Dahlin. Minimal Byzantine storage. In Proceedings of the 16th International Conference on Distributed Computing, pages 311--325. Springer-Verlag, 2002.

Digital Library

[19]

M. K. Reiter. Secure agreement protocols: reliable and atomic group multicast in rampart. In Proceedings of the 2nd ACM Conference on Computer and communications security, pages 68--80. ACM Press, 1994.

Digital Library

[20]

R. L. Rivest, A. Shamir, and L. M. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120--126, 1978.

Digital Library

Cited By

Tseng LZhou NDumas CBantikyan TPalmieri RAgrawal KShun J(2023)Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and WriteProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591086(479-488)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3558481.3591086
Sheffi GPetrank EScheideler CSpear M(2020)Functional FaultsProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400261(453-463)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400261
Cogo VBessani A(2019)Enabling the Efficient, Dependable Cloud-Based Storage of Human Genomes2019 38th International Symposium on Reliable Distributed Systems Workshops (SRDSW)10.1109/SRDSW49218.2019.00011(19-24)Online publication date: Oct-2019
https://doi.org/10.1109/SRDSW49218.2019.00011
Show More Cited By

Index Terms

How fast can a very robust read be?

Recommendations

How fast can a distributed atomic read be?
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing

This paper addresses the problem of designing an efficient implementation of a basic atomic read-write data structure over an asynchronous message-passing system. In particular, we consider time-efficient implementations of this abstraction in the case ...
SOML Read: Rethinking the Read Operation Granularity of 3D NAND SSDs
ASPLOS '19: Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems

NAND-based solid-state disks (SSDs) are known for their superior random read/write performance due to the high degrees of multi-chip parallelism they exhibit. Currently, as the chip density increases dramatically, fewer 3D NAND chips are needed to build ...
Reconstruct versus read-modify writes in RAID

RAID5 (Redundant Arrays of Independent Disk level 5) is a popular paradigm, which uses parity to protect against single disk failures. A major shortcoming of RAID5 is the small write penalty, i.e., the cost of updating parity when a data block is ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '06: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing

July 2006

230 pages

ISBN:1595933840

DOI:10.1145/1146381

General Chair:
Eric Ruppert
York U., Canada
,
Program Chair:
Dahlia Malkhi
Microsoft Research, USA & Hebrew University, Israel

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 July 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

PODC06

Sponsor:

PODC06: ACM Symposium on Principles of Distributed Computing 2006

July 23 - 26, 2006

Colorado, Denver, USA

Acceptance Rates

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
426
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tseng LZhou NDumas CBantikyan TPalmieri RAgrawal KShun J(2023)Distributed Multi-writer Multi-reader Atomic Register with Optimistically Fast Read and WriteProceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3558481.3591086(479-488)Online publication date: 17-Jun-2023
https://dl.acm.org/doi/10.1145/3558481.3591086
Sheffi GPetrank EScheideler CSpear M(2020)Functional FaultsProceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3350755.3400261(453-463)Online publication date: 6-Jul-2020
https://dl.acm.org/doi/10.1145/3350755.3400261
Cogo VBessani A(2019)Enabling the Efficient, Dependable Cloud-Based Storage of Human Genomes2019 38th International Symposium on Reliable Distributed Systems Workshops (SRDSW)10.1109/SRDSW49218.2019.00011(19-24)Online publication date: Oct-2019
https://doi.org/10.1109/SRDSW49218.2019.00011
Mostéfaoui APetrolia MRaynal MJard C(2017)Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing SystemsTheory of Computing Systems10.1007/s00224-016-9699-860:4(677-694)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1007/s00224-016-9699-8
Viotti PVukolić M(2016)Consistency in Non-Transactional Distributed Storage SystemsACM Computing Surveys10.1145/292696549:1(1-34)Online publication date: 29-Jun-2016
https://dl.acm.org/doi/10.1145/2926965
Cachin CDobre DVukolić M(2014)Separating Data and Control: Asynchronous BFT Storage with 2t + 1 Data ReplicasStabilization, Safety, and Security of Distributed Systems10.1007/978-3-319-11764-5_1(1-17)Online publication date: 2014
https://doi.org/10.1007/978-3-319-11764-5_1
Vukolić M(2012)Quorum Systems: With Applications to Storage and ConsensusSynthesis Lectures on Distributed Computing Theory10.2200/S00402ED1V01Y201202DCT0093:1(1-146)Online publication date: 15-Feb-2012
https://doi.org/10.2200/S00402ED1V01Y201202DCT009
Dobre DGuerraoui RMajuntke MSuri NVukolić MGavoille CFraigniaud P(2011)The complexity of robust atomic storageProceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1993806.1993816(59-68)Online publication date: 6-Jun-2011
https://dl.acm.org/doi/10.1145/1993806.1993816
Raynal M(2010)Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed SystemsSynthesis Lectures on Distributed Computing Theory10.2200/S00236ED1V01Y201004DCT0021:1(1-273)Online publication date: Jan-2010
https://doi.org/10.2200/S00236ED1V01Y201004DCT002
Guerraoui RVukolić M(2010)Refined quorum systemsDistributed Computing10.1007/s00446-010-0103-723:1(1-42)Online publication date: 1-Sep-2010
https://dl.acm.org/doi/10.1007/s00446-010-0103-7
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents