A Single-Version STM that Is Multi-Versioned Permissive

作者：Attiya Hagit^*; Hillel Eshcar

来源：Theory of Computing Systems, 2012, 51(4): 425-446.

DOI：10.1007/s00224-012-9406-3

• Transactional memory
• Versions
• Permissiveness
• Disjoint access parallelism
• Compare-and-swap
• k-compare-single-swap
• Best-effort hardware transactional memory

We present PermiSTM, a single-version STM that satisfies a practical notion of permissiveness, usually associated with keeping many versions: it never aborts read-only transactions, and it aborts other transactions only due to a conflicting transaction (writing to a common data item), thereby avoiding spurious aborts. PermiSTM also avoids unnecessary contention on the memory, being disjoint-access parallel. %26lt;br%26gt;We first present a variant of PermiSTM that uses k-compare-single-swap primitive. Then we present a variant with similar properties using only cas, and show how the livelocks it may incur can be avoided with best-effort hardware transactions.

• 出版日期2012-11