ACM Home Page
Please provide us with feedback. Feedback
Against lock-based semantics for transactional memory
Full text PdfPdf (111 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: Brief announcements table of contents
Pages 98-100  
Year of Publication: 2008
ISBN:978-1-59593-973-9
Author
Victor Luchangco  Sun Microsystems Laboratories, Burlington, MA, 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): 169,   Citation Count: 1
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.1378549
What is a DOI?

ABSTRACT

In this position paper, I argue that transactional memory should not be specified in terms of locks. In particular, the semantics of transactional memory in the face of nontransactional access, weak memory consistency guarantees and compiler transformations should not be determined by the behaviors exhibited by lock-based implementations. Specifying transactional behavior in terms of locks would repeat mistakes made in the database community and likely result in specifications as inscrutable to programmers as the memory consistency models that proliferated in the 1990s. It would undercut the promise of transactional memory to free us from the tyranny of lock-based programming and the fragile programs that result, a promise based on the potential for transactions to provide a measure of modularity for concurrent programs. We should strive to preserve that potential as we relax transactional guarantees to admit more efficient implementations.


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
 
3
 
4
C. Blundell, E. C. Lewis, and M. M. K. Martin. Deconstructing transactions: The subtleties of atomicity. In Fourth Annual Workshop on Duplicating, Deconstructing, and Debunking, June 2005.
 
5
L. Crowl, Y. Lev, V. Luchangco, M. Moir, and D. Nussbaum. Integrating transactional memory into c. In Workshop on Transactional Computing (TRANSACT), 2007.
6
 
7
J. Gray, R. A. Lorie, G. R. Putzolu, and I. L. Traiger. Granularity of locks and degrees of consistency and in a shared database. In Modeling in Database Management Systems. Elsevier North-Holland, 1976.
8
9
 
10
T. Harris. Personal communication, 2008.
11
12
13
14
 
15
J. R. Larus and R. Rajwar. Transactional Memory. Morgan & Claypool, 2006.
 
16
Y. Lev, M. Moir, and D. Nussbaum. Ph™: Phased transactional memory. In Workshop on Transactional Computing (TRANSACT), 2007.
 
17
 
18
V. J. Marathe, M. F. Spear, C. Heriot, A. Acharya, D. Eisenstat, W. N. Scherer III, and M. L. Scott. Lowering the overhead of software transactional memory. In TRANSACT:First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing, 2006.
 
19
V. Menon, S. Balensiefer, T. Shpeisman, A.-R. Adl-Tabatabai, R. L. Hudson, B. Saha, and A. Welc. Single global lock semantics in a weakly atomic S™. In Workshop on Transactional Computing (TRANSACT), 2008.
 
20
K. E. Moore, J. Bobba, M. J. Moravan, M. D. Hill, and D. A. Wood. Log™: Log--based transactional memory. In Proc. 12th Annual International Symposium on High Performance Computer Architecture, 2006.
21
22
23
 
24
M. L. Scott. Sequential specification of transactional memory semantics. In TRANSACT:First ACM SIGPLAN Workshop on Languages, Compilers, and Hardware Support for Transactional Computing, 2006.
25
26
 
27
F. Tabba, C. Wang, J. R. Goodman, and M. Moir. NZ™: Nonblocking, zero-indirection transactional memory. In Workshop on Transactional Computing (TRANSACT), 2007.
 
28
E. Vallejo, T. Harris, A. Cristal, O. Unsal, and M. Valero. Hybrid transactional memory to accelerate safe lock-based transactions. In Workshop on Transactional Computing (TRANSACT), 2008.