On the Scalability of Snapshot Isolation

  • Masoud Saeida Ardekani
  • Pierre Sutra
  • Marc Shapiro
  • Nuno Preguiça
Conference paper

DOI: 10.1007/978-3-642-40047-6_39

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8097)
Cite this paper as:
Saeida Ardekani M., Sutra P., Shapiro M., Preguiça N. (2013) On the Scalability of Snapshot Isolation. In: Wolf F., Mohr B., an Mey D. (eds) Euro-Par 2013 Parallel Processing. Euro-Par 2013. Lecture Notes in Computer Science, vol 8097. Springer, Berlin, Heidelberg

Abstract

Many distributed applications require transactions. However, transactional protocols that require strong synchronization are costly in large scale environments. Two properties help with scalability of a transactional system: genuine partial replication (GPR), which leverages the intrinsic parallelism of a workload, and snapshot isolation (SI), which decreases the need for synchronization. We show that under standard assumptions (data store accesses are not known in advance, and transactions may access arbitrary objects in the data store), it is impossible to have both SI and GPR. Our impossibility result is based on a novel decomposition of SI which proves that, like serializability, SI is expressible on plain histories.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Masoud Saeida Ardekani
    • 1
  • Pierre Sutra
    • 2
  • Marc Shapiro
    • 3
  • Nuno Preguiça
    • 4
  1. 1.Université Pierre et Marie CurieParisFrance
  2. 2.University of NeuchâtelSwitzerland
  3. 3.INRIA & Université Pierre et Marie CurieParisFrance
  4. 4.CITIUniversidade Nova de LisboaLisbonPortugal

Personalised recommendations