Name
Abstract | ||
|---|---|---|
In this paper we describe an implementation for exploring the scheduling of aborted transactions within transactional memory systems. We consider application semantics to be just as important as guaranteeing linearizability in arriving at an appropriate execution strategy. Our approach exploits parallelism to simultaneously create different execution orderings for rescheduled aborted transactions and chooses the most beneficial for application progression. The overall solution guarantees a lock-free universal construction if there exists at least one transaction that can commit. The appropriateness of our approach is demonstrated via micro-benchmark performance figures. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-40047-6_48 | Euro-Par |
Keywords | DocType | Volume |
overall solution,micro-benchmark performance figure,different execution ordering,semantically aware universal construction,appropriate execution strategy,application progression,lock-free universal construction,aborted transaction,transactional memory system,application semantics | Conference | 8097 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
17 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Craig Sharp | 1 | 12 | 3.63 |
| Graham Morgan | 2 | 150 | 19.15 |