TY - GEN
T1 - Transactional boosting
T2 - 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP'08
AU - Herlihy, Maurice
AU - Koskinen, Eric
PY - 2008
Y1 - 2008
N2 - We describe a methodology for transforming a large class of highly-concurrent linearizable objects into highly-concurrent transactional objects. As long as the linearizable implementation satisfies certain regularity properties (informally, that every method has an inverse), we define a simple wrapper for the linearizable implementation that guarantees that concurrent transactions without inherent conflicts can synchronize at the same granularity as the original linearizable implementation.
AB - We describe a methodology for transforming a large class of highly-concurrent linearizable objects into highly-concurrent transactional objects. As long as the linearizable implementation satisfies certain regularity properties (informally, that every method has an inverse), we define a simple wrapper for the linearizable implementation that guarantees that concurrent transactions without inherent conflicts can synchronize at the same granularity as the original linearizable implementation.
KW - Abstract locks
KW - Commutativity
KW - Non-blocking algorithms
KW - Transactional boosting
KW - Transactional memory
UR - http://www.scopus.com/inward/record.url?scp=58549112478&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58549112478&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:58549112478
SN - 9781595939609
T3 - Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP
SP - 207
EP - 215
BT - PPoPP'08 - Proceedings of the 2008 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Y2 - 20 February 2008 through 23 February 2008
ER -