tutorial

Open access

Paxos Quorum Leases: Fast Reads Without Sacrificing Writes

Authors:

David G. Andersen,

Michael KaminskyAuthors Info & Claims

SOCC '14: Proceedings of the ACM Symposium on Cloud Computing

Pages 1 - 13

https://doi.org/10.1145/2670979.2671001

Published: 03 November 2014 Publication History

Abstract

This paper describes quorum leases, a new technique that allows Paxos-based systems to perform reads with high throughput and low latency. Quorum leases do not sacrifice consistency and have only a small impact on system availability and write latency. Quorum leases allow a majority of replicas to perform strongly consistent local reads, which substantially reduces read latency at those replicas (e.g., by two orders of magnitude in wide-area scenarios). Previous techniques for performing local reads in Paxos systems either (a) sacrifice consistency; (b) allow only one replica to read locally; or (c) decrease the availability of the system and increase the latency of all updates by requiring all replicas to be notified synchronously. We describe the design of quorum leases and evaluate their benefits compared to previous approaches through an implementation running in five geo-distributed Amazon EC2 datacenters.

References

[1]

M. Abd-El-Malek, G. R. Ganger, G. R. Goodson, M. K. Reiter, and J. J. Wylie. Fault-scalable byzantine fault-tolerant services. In Proc. 20th ACM Symposium on Operating Systems Principles (SOSP), pages 59--74, Brighton, UK, Oct. 2005.

Digital Library

[2]

A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, Jon, J. Howell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer. FARSITE: Federated, Available, and Reliable Storage for an Incompletely Trusted Environment. In Proc. 5th USENIX OSDI, pages 1--14, Boston, MA, Dec. 2002.

Digital Library

[3]

J. Baker, C. Bond, J. C. Corbett, J. Furman, A. Khorlin, J. Larson, J.-M. Leon, Y. Li, A. Lloyd, and V. Yushprakh. Megastore: Providing scalable, highly available storage for interactive services. In Proc. of the Conference on Innovative Data system Research (CIDR), pages 223--234, 2011.

[4]

M. Burrows. The Chubby lock service for loosely-coupled distributed systems. In Proc. 7th USENIX OSDI, Seattle, WA, Nov. 2006.

Digital Library

[5]

M. Castro and B. Liskov. Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398--461, Nov. 2002.

Digital Library

[6]

T. D. Chandra, R. Griesemer, and J. Redstone. Paxos made live: an engineering perspective. In Proc. 26th ACM Symposium on Principles of Distributed Computing, PODC '07, pages 398--407, New York, NY, USA, 2007. ACM.

Digital Library

[7]

B. Cooper, A. Silberstein, E. Tam, R. Ramakrishnan, and R. Sears. Benchmarking cloud serving systems with YCSB. In Proc. 1st ACM Symposium on Cloud Computing (SOCC), Indianapolis, IN, June 2010.

Digital Library

[8]

J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. Furman, S. Ghemawat, A. Gubarev, C. Heiser, P. Hochschild, W. Hsieh, S. Kanthak, E. Kogan, H. Li, A. Lloyd, S. Melnik, D. Mwaura, D. Nagle, S. Quinlan, R. Rao, L. Rolig, Y. Saito, M. Szymaniak, C. Taylor, R. Wang, and D. Woodford. Spanner: Google's globally-distributed database. In Proc. 10th USENIX OSDI. USENIX, 2012.

Digital Library

[9]

J. Cowling, D. Myers, B. Liskov, R. Rodrigues, and L. Shrira. Hq replication: A hybrid quorum protocol for byzantine fault tolerance. In Proc. 7th USENIX OSDI, pages 177--190, Seattle, WA, Nov. 2006.

Digital Library

[10]

M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32 (2):374--382, Apr. 1985. ISSN 0004-5411.

Digital Library

[11]

C. Gray and D. Cheriton. Leases: an efficient fault-tolerant mechanism for distributed file cache consistency. In Proceedings of the twelfth ACM symposium on Operating systems principles, SOSP '89, pages 202--210, New York, NY, USA, 1989. ACM.

Digital Library

[12]

J. Hendricks, S. Sinnamohideen, G. Ganger, and M. Reiter. Zzyzx: Scalable fault tolerance through byzantine locking. In Dependable Systems and Networks (DSN), 2010 IEEE/IFIP International Conference on, pages 363--372, June 2010.

[13]

J. Howard, M. Kazar, S. Menees, D. Nichols, M. Satyanarayanan, R. Sidebotham, and M. West. Scale and Performance in a Distributed File System. ACM Transactions on Computer Systems, 6(1), Feb. 1988.

Digital Library

[14]

P. Hunt, M. Konar, F. P. Junqueira, and B. Reed. ZooKeeper: wait-free coordination for internet-scale systems. In Proc. USENIX ATC, USENIXATC'10, Berkeley, CA, USA, 2010. USENIX Association.

Digital Library

[15]

F. Hupfeld, B. Kolbeck, J. Stender, M. Högqvist, T. Cortes, J. Marti, and J. Malo. Fatlease: scalable fault-tolerant lease negotiation with paxos. In Proceedings of the 17th international symposium on High performance distributed computing, HPDC '08, pages 1--10, 2008.

Digital Library

[16]

R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: speculative byzantine fault tolerance. In Proc. 21st ACM Symposium on Operating Systems Principles (SOSP), pages 45--58, Stevenson, WA, Oct. 2007.

Digital Library

[17]

T. Kraska, G. Pang, M. J. Franklin, S. Madden, and A. Fekete. MDCC: Multi-data center consistency. In Proc. 8th ACM European Conference on Computer Systems (EuroSys), Apr. 2013.

Digital Library

[18]

L. Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2):133--169, 1998. ISSN 0734-2071.

Digital Library

[19]

L. Lamport. Paxos made simple. ACM SIGACT News, 32(4), Dec. 2001.

[20]

L. Lamport. Fast Paxos. http://research.microsoft.com/apps/pubs/default.aspx?id=64624, 2006.

[21]

Y. Mao, F. P. Junqueira, and K. Marzullo. Mencius: building efficient replicated state machines for WANs. In Proc. 8th USENIX OSDI, pages 369--384, San Diego, CA, Dec. 2008.

Digital Library

[22]

I. Moraru, D. G. Andersen, and M. Kaminsky. There is more consensus in egalitarian parliaments. In Proc. 24th ACM Symposium on Operating Systems Principles (SOSP), Farmington, PA, Nov. 2013.

Digital Library

[23]

I. Moraru, D. G. Andersen, and M. Kaminsky. Quorum leases code base. https://github.com/efficient/qlease, Oct. 2014.

[24]

M. Trencseni, A. Gazso, and H. Reinhardt. PaxosLease: Diskless Paxos for Leases. http://arxiv.org/pdf/1209.4187.pdf, 2012.

[25]

J. Yin, L. Alvisi, M. Dahlin, and C. Lin. Volume leases for consistency in large-scale systems. IEEE Trans. on Knowl. and Data Eng., 11(4):563--576, July 1999.

Digital Library

Cited By

Dong HLiu S(2024)Asynchronous Consensus Quorum Read: Pioneering Read Optimization for Asynchronous Consensus ProtocolsElectronics10.3390/electronics1303048113:3(481)Online publication date: 23-Jan-2024
https://doi.org/10.3390/electronics13030481
Wang BLiu SDong HWang XXu WZhang JZhong PZhang Y(2024)Bandle: Asynchronous State Machine Replication Made EfficientProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650091(265-280)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650091
Taleb YMcGehee KYan NWang SMüller SSamuels ABarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Amazon MemoryDB: A Fast and Durable Memory-First Cloud DatabaseCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3653380(309-320)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3653380
Show More Cited By

Index Terms

Paxos Quorum Leases: Fast Reads Without Sacrificing Writes

Recommendations

Fast Flexible Paxos: Relaxing Quorum Intersection for Fast Paxos
ICDCN '21: Proceedings of the 22nd International Conference on Distributed Computing and Networking

Paxos, the de facto standard approach to solving distributed consensus, operates in two phases, each of which requires an intersecting quorum of nodes. Multi-Paxos reduces this to one phase by electing a leader but this leader is also a performance ...
Dual-Quorum: A Highly Available and Consistent Replication System for Edge Services

This paper introduces dual-quorum replication, a novel data replication algorithm designed to support Internet edge services. Edge services allow clients to access Internet services via distributed edge servers that operate on a shared collection of ...
Quorum-based synchronization protocols for multimedia replicas

Multiple replicas of multimedia objects are distributed to peers in overlay networks. In quorum-based (QB) protocols, every replica may not be up-to-date and the up-to-date replica can be found in the version counter. Multimedia objects are ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SOCC '14: Proceedings of the ACM Symposium on Cloud Computing

November 2014

383 pages

ISBN:9781450332521

DOI:10.1145/2670979

Conference Chairs:
Ed Lazowska,
Doug Terry,
Program Chairs:
Remzi H. Arpaci-Dusseau,
Johannes Gehrke

Copyright © 2014 Owner/Author.

Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 November 2014

Check for updates

Qualifiers

Tutorial
Research
Refereed limited

Funding Sources

Division of Computing and Communication Foundations

Conference

SOCC '14

Sponsor:

SOCC '14: ACM Symposium on Cloud Computing

November 3 - 5, 2014

WA, Seattle, USA

Acceptance Rates

Overall Acceptance Rate 169 of 722 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
1,426
Total Downloads

Downloads (Last 12 months)123
Downloads (Last 6 weeks)13

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Dong HLiu S(2024)Asynchronous Consensus Quorum Read: Pioneering Read Optimization for Asynchronous Consensus ProtocolsElectronics10.3390/electronics1303048113:3(481)Online publication date: 23-Jan-2024
https://doi.org/10.3390/electronics13030481
Wang BLiu SDong HWang XXu WZhang JZhong PZhang Y(2024)Bandle: Asynchronous State Machine Replication Made EfficientProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650091(265-280)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650091
Taleb YMcGehee KYan NWang SMüller SSamuels ABarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Amazon MemoryDB: A Fast and Durable Memory-First Cloud DatabaseCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3653380(309-320)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3653380
Yi JLi QZhang BJiang YZhao DYang YYuan Z(2023)Gleaning the Consensus for Linearizable and Conflict-Free Per-Replica Local ReadsProceedings of the 7th Asia-Pacific Workshop on Networking10.1145/3600061.3603175(143-149)Online publication date: 29-Jun-2023
https://dl.acm.org/doi/10.1145/3600061.3603175
Guarnieri JCharapko AGonzalez Boix ESutra P(2023)Linearizable Low-latency Reads at the EdgeProceedings of the 10th Workshop on Principles and Practice of Consistency for Distributed Data10.1145/3578358.3591327(77-83)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3578358.3591327
VanBenschoten NAjmani AGartner MMatei AShah ASharif IShraer AStorm ATaft RTan OWoods AWalters PIves ZBonifati AEl Abbadi A(2022)Enabling the Next Generation of Multi-Region Applications with CockroachDBProceedings of the 2022 International Conference on Management of Data10.1145/3514221.3526053(2312-2325)Online publication date: 10-Jun-2022
https://dl.acm.org/doi/10.1145/3514221.3526053
Papaioannou AMagoutis K(2022)Addressing the Read-Performance Impact of Reconfigurations in Replicated Key-Value StoresIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.313513733:9(2106-2119)Online publication date: 1-Sep-2022
https://doi.org/10.1109/TPDS.2021.3135137
Amarasekara DRanasinghe D(2022)ZPaxos: An Asynchronous BFT Paxos with a Leaderless Synchronous Group2022 21st International Symposium on Parallel and Distributed Computing (ISPDC)10.1109/ISPDC55340.2022.00025(114-120)Online publication date: Jul-2022
https://doi.org/10.1109/ISPDC55340.2022.00025
Whittaker MAilijiang ACharapko ADemirbas MGiridharan NHellerstein JHoward HStoica ISzekeres A(2021)Scaling replicated state machines with compartmentalizationProceedings of the VLDB Endowment10.14778/3476249.347627314:11(2203-2215)Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.14778/3476249.3476273
Kettaneh IAlquraan ATakruri HMashtizadeh AAl-Kiswany S(2021)Accelerating Reads With In-Network Consistency-Aware Load BalancingIEEE/ACM Transactions on Networking10.1109/TNET.2021.312620330:3(954-968)Online publication date: 14-Dec-2021
https://dl.acm.org/doi/10.1109/TNET.2021.3126203
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

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

Media

Figures

Other

Tables

View Table of Contents