Name
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 STMand more than a two-fold improvement over an STMkeeping 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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-24100-0_9 | DISC |
Keywords | Field | DocType |
new stm,stringent memory constraint,selective multi-versioning stm,long read-only transaction,memory consumption,constant number,selective multi-versioning,throughput improvement,two-fold improvement,automatic garbage collection,old object version | Dispose pattern,Computer science,Parallel computing,Real-time computing,Transactional memory,Garbage collection,Throughput,Database transaction,Software versioning | Conference |
Volume | ISSN | Citations |
6950 | 0302-9743 | 21 |
PageRank | References | Authors |
0.91 | 26 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dmitri Perelman | 1 | 120 | 7.40 |
| Anton Byshevsky | 2 | 21 | 0.91 |
| Oleg Litmanovich | 3 | 21 | 0.91 |
| Idit Keidar | 4 | 1892 | 155.01 |