Snapshot Isolation for Software Transactional Memory (bibtex)
by Torvald Riegel, Christof Fetzer, Pascal Felber
Abstract:
Software transactional memory (STM) has been proposed to simplify the development and to increase the scalability of concurrent programs. One problem of existing STMs is that of having long-running read transactions co-exist with shorter update transactions. This problem is of practical importance and has so far not been addressed by other papers in this domain. We approach this problem by investigating the performance of a STM using snapshot isolation and a novel lazy multi-version snapshot algorithm to decrease the validation costs - which can increase quadratically with the number of objects read in STMs with invisible reads. Our measurements demonstrate that snapshot isolation can increase throughput for workloads with long transactions. In comparison to other STMs with invisible reads, we can reduce the validation costs by using our lazy consistent snapshot algorithm.
Reference:
Snapshot Isolation for Software Transactional Memory (Torvald Riegel, Christof Fetzer, Pascal Felber), In In Proceedings of the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT '06), 2006.
Bibtex Entry:
@inproceedings{riegel2006sistm,
	Abstract = {Software transactional memory (STM) has been proposed to simplify
 the development and to increase the scalability of concurrent
 programs. One problem of existing STMs is that of having long-running
 read transactions co-exist with shorter update transactions.
 This problem is of practical importance and has so far not
 been addressed by other papers in this domain.
 We approach this problem by investigating
 the performance of a STM using snapshot isolation and a novel lazy
 multi-version snapshot algorithm to decrease the validation costs -
 which can increase quadratically
 with the number of objects read in STMs with invisible reads. Our
 measurements demonstrate that snapshot isolation can increase
 throughput for workloads with long transactions. In comparison
 to other STMs with invisible reads, we can reduce the validation costs
 by using our lazy consistent snapshot algorithm.},
	Author = {Torvald Riegel and Christof Fetzer and Pascal Felber},
	Booktitle = {In Proceedings of the First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT '06)},
	Month = {June},
	Title = {Snapshot Isolation for Software Transactional Memory},
	Url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.7870},
	Year = {2006}}
Powered by bibtexbrowser