SMV: Selective Multi-Versioning STM

  • Dmitri Perelman
  • Anton Byshevsky
  • Oleg Litmanovich
  • Idit Keidar
Conference paper

DOI: 10.1007/978-3-642-24100-0_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)
Cite this paper as:
Perelman D., Byshevsky A., Litmanovich O., Keidar I. (2011) SMV: Selective Multi-Versioning STM. In: Peleg D. (eds) Distributed Computing. DISC 2011. Lecture Notes in Computer Science, vol 6950. Springer, Berlin, Heidelberg

Abstract

We present Selective Multi-Versioning (SMV), a new STM that reduces the number of aborts, especially those of long read-only transactions. SMV keeps old object versions as long as they might be useful for some transaction to read. It is able to do so while still allowing reading transactions to be invisible by relying on automatic garbage collection to dispose of obsolete versions.

SMV is most suitable for read-dominated workloads, for which it performs better than previous solutions. It has an up to ×7 throughput improvement over a single-version STM and more than a two-fold improvement over an STM keeping a constant number of versions per object. We show that the memory consumption of algorithms keeping a constant number of versions per object might grow exponentially with the number of objects, while SMV operates successfully even in systems with stringent memory constraints.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Dmitri Perelman
    • 1
  • Anton Byshevsky
    • 1
  • Oleg Litmanovich
    • 1
  • Idit Keidar
    • 1
  1. 1.Technion, Israel Institute of TechnologyIsrael

Personalised recommendations