|Title:||A Single-Version STM that is Multi-Version Permissive
|Authors:||Hagit Attiya and Eshcar Hillel
|Abstract:||We present PermiSTM, a single-version STM satisfying 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 (which writes to a common item), thereby avoiding spurious aborts.
PermiSTM also avoids unnecessary contention on the memory, being strictly disjoint access parallel.
The paper first presents a variant of PermiSTM that uses $k$-compare-single-swap primitive.
Then we show a variant with similar properties using only CAS, and we also show how the livelocks it may incur can be avoided with best-effort hardware transactions.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2011/CS/CS-2011-06), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 2011
To the main CS technical reports page
Computer science department, Technion