Coarse-grained transactions

ACM SIGPLAN Notices

Volumn 45, Issue 1, 2010, Pages 19-30

  Koskinen, Eric ^a   Parkinson, Matthew ^a   Herlihy, Maurice ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b BROWN UNIVERSITY   (United States)

Author keywords

Abstract data types; Coarse grained transactions; Commutativity; Movers; Transactional boosting; Transactional memory

Indexed keywords

SEMANTICS; STORAGE ALLOCATION (COMPUTER);

COARSE-GRAINED; COMMUTATIVITY; MOVERS; TRANSACTIONAL BOOSTING; TRANSACTIONAL MEMORY;

ABSTRACT DATA TYPES;

EID: 77149175143     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1707801.1706304     Document Type: Conference Paper

References (33)

1. ABADI, M., BIRRELL, A., HARRIS, T., AND ISARD, M. Semantics of transactional memory and automatic mutual exclusion. In The 35th ACM SIGPLAN SIGACT Symposium on Principles of Programming Languages (POPL'08) (2008), G. C. Necula and P. Wadler, Eds., ACM, pp. 63-74.
2. ALEEN, F., AND CLARK, N. Commutativity analysis for software parallelization: letting program transformations see the big picture. In Proceedings of the 14th international conference on Architectural support for programming languages and operating systems (ASPLOSXII) (2009), M. L. Soffa and M. J. Irwin, Eds., ACM, pp. 241-252.
3. BALDASSIN,A., AND BURCKHARDT, S. Lightweight software transactions for games. In Proceedings of the First USENIX Workshop on Hot Topics in Parallelism (HotPar'09) (2009).
4. BEERI, C., BERNSTEIN, P., GOODMAN, N., LAI, M.-Y., AND SHASHA, D. A concurrency control theory for nested transactions (preliminary report). In Proceedings of the 2nd annual ACM symposium on Principles of distributed computing (PODC'83) (New York, NY, USA, 1983), ACM Press, pp. 45-62.
5. BERNSTEIN, A. Analysis of programs for parallel processing. IEEE Transactions on Electronic Computers 15, 5 (1966), 757-763.
6. DAMRON, P., FEDOROVA, A., LEV, Y., LUCHANGCO, V., MOIR, M., AND NUSSBAUM, D. Hybrid transactional memory. In Proceedings of the 12th international conference on Architectural support for programming languages and operating systems (ASPLOS-XII) (New York, NY, USA, 2006), ACM Press, pp. 336-346.
7. DICE, D., SHALEV, O., AND SHAVIT, N. Transactional locking II. In Proceedings of the 20th International Symposium on Distributed Computing (DISC'06) (September 2006).
8. FLANAGAN, C., FREUND, S. N., AND YI, J. Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs. In PLDI'08: Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation (New York, NY, USA, 2008), ACM, pp. 293-303.
9. GUERRAOUI, R., AND KAPALKA, M. On the correctness of transactional memory. In Proceedings of the 13th ACMSIGPLAN Symposium on Principles and practice of parallel programming (PPoPP'08) (New York, NY, USA, 2008), ACM, pp. 175-184.
10. HARRIS, T., MARLOW, S., JONES, S. L. P., AND HERLIHY, M. Composable memory transactions. Commun. ACM 51, 8 (2008), 91-100.
11. HERLIHY, M., AND KOSKINEN, E. Transactional boosting: A methodology for highly concurrent transactional objects. In Proceedings of the 13th ACMSIGPLAN symposium on Principles and practice of parallel programming (PPoPP'08) (2008).
12. HERLIHY, M., LUCHANGCO, V., MOIR, M., AND SCHERER, III, W. N. Software transactional memory for dynamic-sized data structures. In Proceedings of the 22nd annual symposium on Principles of distributed computing (PODC'03) (2003), ACM Press, pp. 92-101.
13. HERLIHY, M., AND MOSS, J. E. B. Transactional memory: architectural support for lock-free data structures. In Proceedings of the 20th Annual International Symposium on Computer Architecture (ISCA'93) (1993), ACM Press, pp. 289-300.
14. HERLIHY, M. P., AND WING, J. M. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS) 12, 3 (1990), 463-492.
15. JAGANNATHAN, S. VITEK, J., WELC, A., HOSKING, A. A Transactional object calculus. Science of Computer Programming. 57, 2 (August 2005), 164-186.
16. KORTH, H. F. Locking primitives in a database system. J. ACM 30, 1 (1983), 55-79.
17. KOSKINEN, E., AND HERLIHY, M. Checkpoints and continuations instead of nested transactions. In Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (SPAA'08) (New York, NY, USA, 2008), ACM, pp. 160-168.
18. KOSKINEN, E., AND HERLIHY, M. Dreadlocks: efficient deadlock detection. In Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (SPAA'08) (New York, NY, USA, 2008), ACM, pp. 297-303.
19. KOSKINEN, E., PARKINSON,M., AND HERLIHY,M. Coarse-grained transactions. Tech. Rep. 759, Computer Laboratory, University of Cambridge, 2009.
20. KULKARNI, M., PINGALI, K., WALTER, B., RAMANARAYANAN, G., BALA, K., AND CHEW, L. P. Optimistic parallelism requires abstractions. In Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation (PLDI'07) (2007), J. Ferrante and K. S. McKinley, Eds., ACM, pp. 211-222.
21. LAM, M., AND RINARD, M. Coarse-grain parallel programming in Jade. In Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP'91) (1991), ACM New York, NY, USA, pp. 94-105.
22. LIPTON, R. J. Reduction: a method of proving properties of parallel programs. Commun. ACM 18, 12 (1975), 717-721.
23. MOORE, K. F., AND GROSSMAN, D. High-level small-step operational semantics for transactions. In Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL'08) (New York, NY, USA, 2008), ACM, pp. 51-62.
24. MORAVAN, M. J., BOBBA, J., MOORE, K. E., YEN, L., HILL, M. D., LIBLIT, B., SWIFT, M. M., AND WOOD, D. A. Supporting nested transactional memory in logtm. In Proceedings of the 12th international conference on Architectural support for programming languages and operating systems (ASPLOS-XII) (New York, NY, USA, 2006), ACM Press, pp. 359-370.
25. MORAVAN, M. J., BOBBA, J., MOORE, K. E., YEN, L., HILL, M. D., LIBLIT, B., SWIFT, M. M., AND WOOD, D. A. Supporting nested transactional memory in logtm. SIGOPS Oper. Syst. Rev. 40, 5 (2006), 359-370.
26. RINARD, M., AND LAM, M. The design, implementation, and evaluation of Jade. ACM Transactions on Programming Languages and Systems (TOPLAS) 20, 3 (1998), 483-545.
27. RINARD, M. C., AND DINIZ, P. C. Commutativity analysis: A new analysis technique for parallelizing compilers. ACM Transactions on Programming Languages and Systems (TOPLAS) 19, 6 (November 1997), 942-991.
28. SAHA, B., ADL-TABATABAI, A.-R., HUDSON, R. L., MINH, C. C., AND HERTZBERG, B. McRT-STM: a high performance software transactional memory system for a multi-core runtime. In Proceedings of the eleventh ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP'06) (New York, NY, USA, 2006), ACM, pp. 187-197.
29. SCHWARZ, P. M., AND SPECTOR, A. Z. Synchronizing shared abstract types. ACM Transactions on Computer Systems 2, 3 (1984), 223-250.
30. SPEAR, M. F., MARATHE, V. J., DALESSANDRO, L., AND SCOTT, M. L. Privatization techniques for software transactional memory. In Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (PODC'07) (New York, NY, USA, 2007), ACM, pp. 338-339.
31. STEELE, JR, G. L. Making asynchronous parallelism safe for the world. In Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL'90) (New York, NY, USA, 1990), ACM Press, pp. 218-231.
32. WEIHL,W. E. Data-dependent concurrency control and recovery (extended abstract). In Proceedings of the second annual ACM symposium on Principles of distributed computing (PODC'83) (New York, NY, USA, 1983), ACM Press, pp. 63-75.
33. WILLIAM N. SCHERER, I., AND SCOTT, M. L. Advanced contention management for dynamic software transactional memory. In Proceedings of the 24th annual ACM symposium on Principles of distributed computing (PODC'05) (New York, NY, USA, 2005), ACM, pp. 240- 248.