Abstract
TM (transactional memory) is a concurrency control paradigm that provides atomic and isolated execution for regions of code. TM is considered by many researchers to be one of the most promising solutions to address the problem of programming multicore processors. Its most appealing feature is that most programmers only need to reason locally about shared data accesses, mark the code region to be executed transactionally, and let the underlying system ensure the correct concurrent execution. This model promises to provide the scalability of fine-grain locking, while avoiding common pitfalls of lock composition such as deadlock. In this article we explore the performance of a highly optimized STM and observe that the overall performance of TM is significantly worse at low levels of parallelism, which is likely to limit the adoption of this programming paradigm.
Publisher
Association for Computing Machinery (ACM)
Cited by
63 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Multi Bucket Queues: Efficient Concurrent Priority Scheduling;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. LockillerTM: Enhancing Performance Lower Bounds in Best-Effort Hardware Transactional Memory;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27
3. Understanding and utilizing hardware transactional memory capacity;Proceedings of the 2021 ACM SIGPLAN International Symposium on Memory Management;2021-06-22
4. Subutai: Speeding Up Legacy Parallel Applications Through Data Synchronization;IEEE Transactions on Parallel and Distributed Systems;2021-05-01
5. PETRA;ACM Transactions on Architecture and Code Optimization;2021-03