Title:
Adaptive transaction scheduling for transactional memory systems
Adaptive transaction scheduling for transactional memory systems
Author(s)
Yoo, Richard M.
Advisor(s)
Lee, Hsien-Hsin Sean
Editor(s)
Collections
Supplementary to
Permanent Link
Abstract
Transactional memory systems are expected to enable parallel
programming at lower programming complexity, while delivering improved performance over traditional lock-based systems. Nonetheless, there are certain situations where transactional memory systems could actually perform worse. Transactional memory systems can outperform locks only
when the executing workloads contain sufficient parallelism. When the workload lacks inherent parallelism, launching excessive transactions can adversely degrade performance. These situations will actually become dominant in future workloads when large-scale transactions are frequently executed.
In this thesis, we propose a new paradigm called adaptive transaction scheduling to address this issue. Based on the parallelism feedback from applications, our adaptive transaction scheduler dynamically dispatches and controls the number of concurrently executing transactions. In our case study, we show that our low-cost mechanism not only guarantees that hardware transactional memory systems perform no worse than a single global lock, but also significantly improves performance for both hardware and software transactional memory systems.
Sponsor
Date Issued
2008-04-01
Extent
Resource Type
Text
Resource Subtype
Thesis