A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Adaptive transaction scheduling for transactional memory systems
2008
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures - SPAA '08
Transactional memory systems are expected to enable parallel programming at lower programming complexity, while delivering improved performance over traditional lock-based systems. Nonetheless, we observed that there are situations where transactional memory systems could actually perform worse, and that these situations will actually become dominant in future workloads as more and larger-scale transactional memory systems are available. Transactional memory systems can excel locks only when
doi:10.1145/1378533.1378564
dblp:conf/spaa/YooL08
fatcat:3347vtxlfjfnbcl4nyf3z3rsh4