SMV: Selective multi-versioning STM

Dmitri Perelman, Anton Byshevsky, Oleg Litmanovich, Idit Keidar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationDistributed Computing - 25th International Symposium, DISC 2011, Proceedings
Pages125-140
Number of pages16
DOIs
StatePublished - 2011
Event25th International Symposium on Distributed Computing, DISC 2011 - Rome, Italy
Duration: 20 Sep 201122 Sep 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6950 LNCS

Conference

Conference25th International Symposium on Distributed Computing, DISC 2011
Country/TerritoryItaly
CityRome
Period20/09/1122/09/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'SMV: Selective multi-versioning STM'. Together they form a unique fingerprint.

Cite this