Transactional lock-free execution of lock-based programs

摘要: This paper is motivated by the difficulty in writing correct high-performance programs. Writing shared-memory multi-threaded programs imposes a complex trade-off between programming ease and performance, largely due to subtleties coordinating access shared data. To ensure correctness programmers often rely on conservative locking at expense of performance. The resulting serialization threads performance bottleneck. Locks also interact poorly with thread scheduling faults, poor system performance.We seek improve multithreaded trade-offs providing architectural support for optimistic lock-free execution. In execution, objects are never locked when accessed various threads. We propose Transactional Lock Removal (TLR) show how program that uses lock-based synchronization can be executed hardware manner, even presence conflicts, without programmer or software changes. TLR timestamps conflict resolution, modest hardware, features already present many modern computer systems.TLR's benefits include improved programmability, stability, Programmers obtain data structures, such as non-blocking behavior wait-freedom, while using lock-protected critical sections