Name
Abstract | ||
|---|---|---|
This paper takes a step toward developing a theory for understanding aborts in transactional memory systems (TMs). Existing TMs may abort many transactions that could, in fact, commit without violating correctness. We call such unnecessary aborts spare aborts. We classify what kinds of spare aborts can be eliminated, and which cannot. We further study what kinds of spare aborts can be avoided efficiently. Specifically, we show that some unnecessary aborts cannot be avoided, and that there is an inherent tradeoff between the overhead of a TM and the extent to which it reduces the number of spare aborts. We also present an efficient example TM algorithm that avoids certain kinds of spare aborts, and analyze its properties and performance. |
Year | DOI | Venue |
|---|---|---|
2009 | https://doi.org/10.1007/s00224-015-9607-7 | Theory of Computing Systems |
Keywords | DocType | Volume |
Transactional memory | Conference | 57 |
Issue | ISSN | Citations |
1 | 1432-4350 | 18 |
PageRank | References | Authors |
0.85 | 9 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Idit Keidar | 1 | 1892 | 155.01 |
| Dmitri Perelman | 2 | 120 | 7.40 |