Optimistic transactional boosting

Optimistic transactional boosting
复制标题

DOI:
10.1145/2555243.2555283
复制
发表时间:
2014-02
期刊:
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
影响因子:
--
通讯作者:
Ahmed Hassan;R. Palmieri;B. Ravindran
Ahmed Hassan;R. Palmieri;B. Ravindran
中科院分区:
其他
文献类型:
--
作者:
Ahmed Hassan;R. Palmieri;B. Ravindran

文献摘要

被引文献

相似文献

Herlihy和Koskinen的transactional boosting方法解决了将并发数据结构转换为transactional数据结构的挑战。我们提出了一个乐观的方法来提高并发收集。乐观提升允许更大的特定于数据结构的优化,更容易与STM框架集成,并且比原始提升方法对提升操作的限制更低。
Herlihy and Koskinen's transactional boosting methodology addressed the challenge of converting concurrent data structures into transactional ones. We present an optimistic methodology for boosting concurrent collections. Optimistic boosting allows greater data structure-specific optimizations, easier integration with STM frameworks, and lower restrictions on the boosted operations than the original boosting methodology.