ACM Home Page
Please provide us with feedback. Feedback
Adaptive transaction scheduling for transactional memory systems
Full text PdfPdf (265 KB)
Source
ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures table of contents
Munich, Germany
SESSION: Special track -- transactional memory table of contents
Pages 169-178  
Year of Publication: 2008
ISBN:978-1-59593-973-9
Authors
Richard M. Yoo  Georgia Institute of Technology, Atlanta, GA 30332, GA, USA
Hsien-Hsin S. Lee  Georgia Institute of Technology, Atlanta, GA 30332, GA, USA
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 171,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1378533.1378564
What is a DOI?

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 are likely to become dominant in future workloads when large-scale transactions are frequently executed. In this paper, 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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Bai, X. Shen, C. Zhang, W. N. Scherer, III, C. Ding, and M. L. Scott. A Key-based Adaptive Transactional Memory Executor. Technical Report URCS TR 909, University of Rochester, December 2006.
3
 
4
 
5
Chow, R. Morin, and K. Shiv. Enterprise Java performance: Best practices. In Intel Technology Journal, volume 7, issue 1, pages 32--46, February 2003.
6
7
8
 
9
10
11
 
12
R. Larus and R. Rajwar. Transactional Memory. Morgan & Claypool, 2006.
 
13
Marathe, W. Scherer III, and M. Scott. Adaptive software transactional memory. In DISC-2005.
 
14
J. Marathe, M. F. Spear, C. Heriot, A. Acharya, D. Eisenstat, W. N. Scherer, III, and M. L. Scott. Lowering the overhead of nonblocking software transactional memory. In TRANSACT, June 2006.
15
 
16
Martínez and J. Torrellas. Speculative synchronization: Programmability and performance for parallel codes. In IEEE Micro Top Picks from Microarchitecture Conferences, 2003.
17
18
 
19
E. Moore, J. Bobba, M. J. Moravan, M. D. Hill, and D. A. Wood. LogTM: Log-based transactional memory. In HPCA-12, pages 254 -- 265, February 2006.
 
20
E. B. Moss and A. L. Hosking. Nested transactional memory: Model and preliminary architecture sketches. In SCOOL'05.
 
21
22
23
 
24
N. Scherer, III and M. L. Scott. Contention management in dynamic software transactional memory. In Proceedings of the 2004 ACM PODC Workshop on Concurrency and Synchronization in Java Programs, 2004.
 
25
L. Scott, M. F. Spear, L. Dalessandro, and V. J. Marathe. Delaunay triangulation with transactions and barriers. In IISWC-2007, pages 107--113.
26
 
27
A. Stankovic. Admission control, reservation, and reflection in operating systems. IEEE Bulletin of Technical Committee on Operating Systems and Application Environments (TCOS), 10(2), 1998.
28
 
29
Zilles and L. Baugh. Extending hardware transactional memory to support nonbusy waiting and nontransactional actions. In TRANSACT, 2006.


Collaborative Colleagues:
Richard M. Yoo: colleagues
Hsien-Hsin S. Lee: colleagues