Serializability, not serial

Concurrency control and availability in multidatacenter datastores

Stacy Patterson, Aaron J. Elmore, Faisal Nawab, Divyakant Agrawal, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingChapter

34 Citations (Scopus)

Abstract

We present a framework for concurrency control and avail-ability in multi-datacenter datastores. While we consider Google's Megastore as our motivating example, we define general abstractions for key components, making our solu-tion extensible to any system that satisfies the abstraction properties. We first develop and analyze a transaction man-agement and replication protocol based on a straightforward implementation of the Paxos algorithm. Our investigation reveals that this protocol acts as a concurrency prevention mechanism rather than a concurrency control mechanism. We then propose an enhanced protocol called Paxos with Combination and Promotion (Paxos-CP) that provides true transaction concurrency while requiring the same per in-stance message complexity as the basic Paxos protocol. Fi-nally, we compare the performance of Paxos and Paxos-CP in a multi-datacenter experimental study, and we demon-strate that Paxos-CP results in significantly fewer aborted transactions than basic Paxos.

Original languageEnglish
Title of host publicationProceedings of the VLDB Endowment
Pages1459-1470
Number of pages12
Volume5
Edition11
Publication statusPublished - Jul 2012
Externally publishedYes

Fingerprint

Concurrency control
Availability
Network protocols

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Computer Science(all)

Cite this

Patterson, S., Elmore, A. J., Nawab, F., Agrawal, D., & Abbadi, A. E. (2012). Serializability, not serial: Concurrency control and availability in multidatacenter datastores. In Proceedings of the VLDB Endowment (11 ed., Vol. 5, pp. 1459-1470)

Serializability, not serial : Concurrency control and availability in multidatacenter datastores. / Patterson, Stacy; Elmore, Aaron J.; Nawab, Faisal; Agrawal, Divyakant; Abbadi, Amr El.

Proceedings of the VLDB Endowment. Vol. 5 11. ed. 2012. p. 1459-1470.

Research output: Chapter in Book/Report/Conference proceedingChapter

Patterson, S, Elmore, AJ, Nawab, F, Agrawal, D & Abbadi, AE 2012, Serializability, not serial: Concurrency control and availability in multidatacenter datastores. in Proceedings of the VLDB Endowment. 11 edn, vol. 5, pp. 1459-1470.
Patterson S, Elmore AJ, Nawab F, Agrawal D, Abbadi AE. Serializability, not serial: Concurrency control and availability in multidatacenter datastores. In Proceedings of the VLDB Endowment. 11 ed. Vol. 5. 2012. p. 1459-1470
Patterson, Stacy ; Elmore, Aaron J. ; Nawab, Faisal ; Agrawal, Divyakant ; Abbadi, Amr El. / Serializability, not serial : Concurrency control and availability in multidatacenter datastores. Proceedings of the VLDB Endowment. Vol. 5 11. ed. 2012. pp. 1459-1470
@inbook{117814c901bc4ba1bb8792441d40627a,
title = "Serializability, not serial: Concurrency control and availability in multidatacenter datastores",
abstract = "We present a framework for concurrency control and avail-ability in multi-datacenter datastores. While we consider Google's Megastore as our motivating example, we define general abstractions for key components, making our solu-tion extensible to any system that satisfies the abstraction properties. We first develop and analyze a transaction man-agement and replication protocol based on a straightforward implementation of the Paxos algorithm. Our investigation reveals that this protocol acts as a concurrency prevention mechanism rather than a concurrency control mechanism. We then propose an enhanced protocol called Paxos with Combination and Promotion (Paxos-CP) that provides true transaction concurrency while requiring the same per in-stance message complexity as the basic Paxos protocol. Fi-nally, we compare the performance of Paxos and Paxos-CP in a multi-datacenter experimental study, and we demon-strate that Paxos-CP results in significantly fewer aborted transactions than basic Paxos.",
author = "Stacy Patterson and Elmore, {Aaron J.} and Faisal Nawab and Divyakant Agrawal and Abbadi, {Amr El}",
year = "2012",
month = "7",
language = "English",
volume = "5",
pages = "1459--1470",
booktitle = "Proceedings of the VLDB Endowment",
edition = "11",

}

TY - CHAP

T1 - Serializability, not serial

T2 - Concurrency control and availability in multidatacenter datastores

AU - Patterson, Stacy

AU - Elmore, Aaron J.

AU - Nawab, Faisal

AU - Agrawal, Divyakant

AU - Abbadi, Amr El

PY - 2012/7

Y1 - 2012/7

N2 - We present a framework for concurrency control and avail-ability in multi-datacenter datastores. While we consider Google's Megastore as our motivating example, we define general abstractions for key components, making our solu-tion extensible to any system that satisfies the abstraction properties. We first develop and analyze a transaction man-agement and replication protocol based on a straightforward implementation of the Paxos algorithm. Our investigation reveals that this protocol acts as a concurrency prevention mechanism rather than a concurrency control mechanism. We then propose an enhanced protocol called Paxos with Combination and Promotion (Paxos-CP) that provides true transaction concurrency while requiring the same per in-stance message complexity as the basic Paxos protocol. Fi-nally, we compare the performance of Paxos and Paxos-CP in a multi-datacenter experimental study, and we demon-strate that Paxos-CP results in significantly fewer aborted transactions than basic Paxos.

AB - We present a framework for concurrency control and avail-ability in multi-datacenter datastores. While we consider Google's Megastore as our motivating example, we define general abstractions for key components, making our solu-tion extensible to any system that satisfies the abstraction properties. We first develop and analyze a transaction man-agement and replication protocol based on a straightforward implementation of the Paxos algorithm. Our investigation reveals that this protocol acts as a concurrency prevention mechanism rather than a concurrency control mechanism. We then propose an enhanced protocol called Paxos with Combination and Promotion (Paxos-CP) that provides true transaction concurrency while requiring the same per in-stance message complexity as the basic Paxos protocol. Fi-nally, we compare the performance of Paxos and Paxos-CP in a multi-datacenter experimental study, and we demon-strate that Paxos-CP results in significantly fewer aborted transactions than basic Paxos.

UR - http://www.scopus.com/inward/record.url?scp=84873197751&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873197751&partnerID=8YFLogxK

M3 - Chapter

VL - 5

SP - 1459

EP - 1470

BT - Proceedings of the VLDB Endowment

ER -