Name
Abstract | ||
|---|---|---|
Transactional memory (TM) guarantees that a sequence of operations encapsulated into a transaction is atomic. This simple yet powerful paradigm is a promising direction for writing concurrent applications. Recent TM designs employ a time-based mechanism to leverage the performance advantage of invisible reads. With the advent of many-core architectures and non-uniform memory (NUMA) architectures, this technique is however hitting the synchronization wall of the cache coherency protocol. To address this limitation, we propose a novel and flexible approach based on a new consistency criteria named stricter serializability (({text {SSER}^+})). Workloads executed under ({text {SSER}^+}) are opaque when the object graph forms a tree and transactions traverse it top-down. We present a matching algorithm that supports invisible reads, lazy snapshots, and that can trade synchronization for more parallelism. Several empirical results against a well-established TM design demonstrate the benefits of our solution. |
Year | Venue | Field |
|---|---|---|
2018 | COORDINATION | Serializability,Synchronization,Computer science,Object graph,Theoretical computer science,Transactional memory,Boosting (machine learning),Snapshot (computer storage),Blossom algorithm,Cache coherence |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
22 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pierre Sutra | 1 | 152 | 14.73 |
| Patrick Marlier | 2 | 51 | 2.00 |
| Valerio Schiavoni | 3 | 235 | 28.37 |
| François Trahay | 4 | 33 | 7.51 |