A Practical Transactional Memory Interface

摘要: Hardware transactional memory (HTM) is becoming widely available on modern platforms. However, software using HTM requires at least two carefully-coordinated code paths: one for transactions, and when transactions either fail, or are not supported all. We present the MCMS interface that allows a simple design of fast concurrent data structures. MCMS-based can execute support provided, but it also executes well platforms do HTM, handles transaction failures as well. To demonstrate advantage such an abstraction, we designed linked-list tree algorithms. The list algorithm outperforms all known lock-free linked-lists by factor up to X2.15. builds Ellen et al. [7] X1.37. Both algorithms considerably simpler than their counterparts.