Transactional memory should be an implementation technique, not a programming interface

1st USENIX Workshop on Hot Topics in Parallelism, HotPar 2009

Volumn , Issue , 2009, Pages

  Boehm, Hans J ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS; STORAGE ALLOCATION (COMPUTER);

COARSE GRAINS; DEADLOCK FREE; IMPLEMENTATION TECHNIQUES; PROGRAMMING INTERFACE; SYNCHRONIZATION OPERATION; SYNTACTIC SUGARS; TRANSACTIONAL MEMORY;

LOCKS (FASTENERS);

EID: 85092788175     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. ADL-TABATABAI, A.-R., LEWIS, B. T., MENON, V., MURPHY, B. R., SAHA, B., AND SHPEISMAN, T. Compiler and Runtime Support for Efficient Software Transactional Memory. In SIGPLAN Conference on Programming Language Design and Implementation (2006), pp. 26-37.
2. ADVE, S. V., AND HILL, M. D. Weak ordering-A new definition. In Proc. 17th Intl. Symp. Computer Architecture (1990), pp. 2-14.
3. ASPINALL, D., AND SEVCIK, J. Java memory model examples: Good, bad, and ugly. VAMP07 Proceedings http://www.cs. ru.nl/~chaack/VAMP07/, 2007.
4. BOEHM, H., AND MACLAREN, N. Should volatile acquire atomicity and thread visibility semantics? C++ standards committee paper WG21/N2016 = J16/06-0086, http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2006/n2016.html, April 2006.
5. BOEHM, H.-J. Threads basics. http://www.hpl.hp.com/personal/Hans-Boehm/c++mm/threadsintro.html.
6. BOEHM, H.-J. Threads cannot be implemented as a library. In Proc. Conf. on Programming Language Design and Implementation (2005).
7. BOEHM, H.-J. Reordering constraints for pthread-style locks. In Proc. 12th Symp. Principles and Practice of Parallel Programming (2007), pp. 173-182.
8. BOEHM, H.-J., AND ADVE, S. Foundations of the c++ concurrency memory model. In Proc. Conf. on Programming Language Design and Implementation (2008), pp. 68-78.
9. CHEREM, S., CHILIMBI, T., AND GULWAMI, S. Infering locks for atomic sections. In PLDI 08 (2008), pp. 304-315.
10. COLVIN, G., DAWES, B., ADLER, D., AND DIMOV, P. The Boost shared ptr class template. http://www.boost.org/libs/smart-ptr/shared-ptr.htm, August 2005.
11. CROWL, L., LEV, Y., LUCHANGCO, V., MOIR, M., AND NUSSBAUM, D. Integrating transactional memory into c++. TRANSACT, http://www.cs.rochester.edu/meetings/TRANSACT07/papers/crowl.pdf, 2007.
12. DELESSANDRO, L., AND SCOTT, M. L. Strong isolation is a weak idea. TRANSACT, http://transact09.cs.washington.edu/33-paper.pdf, 2009.
13. EMMI, M., FISCHER, J. S., JHALA, R., AND MAJUMDAR, R. Lock Allocation. In Symposium on Principles of Programming Languages (POPL) (2007), pp. 291-296.
14. GROSSMAN, D., PUGH, B., AND MANSON, J. What do High-Level Memory Models Mean for Transactions? In Workshop on Memory System Performance and Correctness (MSPC) (2006), pp. 63-69.
15. HARRIS, T. Language constructs for transactional memory. Slides from POPL 09 invited talk http://research.microsoft.com/en-us/um/people/tharris/misc/2009-01jan-popl.pdf, January 2009.
16. HARRIS, T., MARLOW, S., PEYTON-JONES, S., AND HERLIHY, M. Composable memory transactions. In Principles and Practice of Parallel Programming (2005), pp. 48-60.
17. HERLIHY, M., AND MOSS, J. E. B. Transactional memory: architectural support for lock-free data structures. In ISCA 93 (1993), pp. 289-300.
18. IEEE, AND THE OPEN GROUP. IEEE Standard 1003.1-2001. IEEE, 2001.
19. ISO/IEC JTC1/SC22/WG21. ISO/IEC 14882, programming language - C++ (committee draft). http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2800.pdf, 2008.
20. LAMPORT, L. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers C-28, 9 (1979), 690-691.
21. LEE, E. A. The problem with threads. Tech. Rep. UCB/EECS-2006-1, EECS Department, University of California, Berkeley, Jan 2006. The published version of this paper is in IEEE Computer 39(5):33-42, May 2006.
22. LUCHANGCO, V. Against lock-based semantics for transactional memory. In SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallel Algorithms and Architectures (2008), pp. 98-100.
23. MANSON, J., PUGH, W., AND ADVE, S. The Java memory model. In Proc. Symp. on Principles of Programming Languages (2005).
24. MCCLOSKEY, B., ZHOU, F., GAY, D., AND BREWER, E. Autolocker: Synchronization Inference for Atomic Sections. In POPL 06 (2006), pp. 346-358.
25. MENON, V., BALENSIEFER, S., SHPEISMAN, T., ADLTABATABAI, A.-R., HUDSON, R., SAHA, B., AND WELC, A. Single global lock semantics in a weakly atomic stm. In TRANSACT (2008).
26. NI, Y., WELC, A., ADL-TABATABAI, A.-R., BACH, M., BERKOWITS, S., COWNIE, J., GEVA, R., KOZHUKOW, S., NARAYANASWAMY, R., OLIVIER, J., PREIS, S., SAHA, B., TAL, A., AND TIAN, X. Design and Implementation of Transactional Constructs for C/C++. In OOPSLA (2008), pp. 195-212.
27. RAJWAR, R., AND GOODMAN, J. Speculative lock elision: Enabling highly concurrent multithreaded execution. In Microarchitecture, IEEE/ACM International Symposium on (Los Alamitos, CA, USA, 2001), IEEE Computer Society, pp. 294-305.
28. SEVCIK, J., AND ASPINALL, D. On validity of program transformations in the java memory model. In ECOOP 2008 (2008), pp. 27-51.
29. SHAVIT, N., AND TOUITOU, D. Software Transactional Memory. In Proceedings of the Twenty-third Annual ACM Symposium on Principles of Distributed Computing (1995), pp. 204-213.
30. UNITED STATES DEPARTMENT OF DEFENSE. Reference Manual for the Ada Programming Language: ANSI/MIL-STD-1815A-1983 Standard 1003.1-2001, 1983. Springer.
31. ZHANG, Y., SREEDHAR, V. C., ZHU, W., SARKAR, V., AND GAO, G. R. Optimized Lock Assignment and Allocation: A Method for Exploiting Concurrency among Critical Sections. CAPSL Technical Memo Revised 65, University of Delaware, Mar. 2007.
32. ZIAREK, L., WELC, A., ADL-TABATABAI, A.-R., MENON, V., SHPEISMAN, T., AND JAGANNATHAN, S. A uniform transactional execution environment for java. In ECOOP (2008), pp. 129-154.