Exploiting the commutativity lattice

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2011, Pages 542-555

  Kulkarni, Milind ^a   Nguyen, Donald ^b   Prountzos, Dimitrios ^b   Sui, Xin ^b   Pingali, Keshav ^b,c  

^a Purdue University   (United States)

^b University of Texas at Austin   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

commutativity lattice; optimistic parallelism; transactions

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS; LOCKS (FASTENERS); TREES (MATHEMATICS);

COMMUTATIVITY; COMMUTATIVITY LATTICE; CONFLICT DETECTION; EFFICIENT SCHEMES; GATEKEEPING; METHOD INVOCATION; OPTIMISTIC PARALLELISM; OPTIMISTICS; SPECULATIVE EXECUTION; TRANSACTION;

SEMANTICS;

EID: 79959900605     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993498.1993562     Document Type: Conference Paper

References (25)

1. Synthetic maximum flow families. http://www.avglab.com/ andrew/CATS/maxflow-synthetic.htm.
2. A. Bondavalli, N. De Francesco, D. Latella, and G. Vaglini. Shared abstract data type: an algebraic methodology for their specification. In MFDBS 89, 1989.
3. J. Burnim, G. Necula, and K. Sen. Specifying and checking semantic atomicity for multithreaded programs. In ASPLOS'11: Proceedings of the 16th International Conference on Architectural Support for Programming Languages and Operating Systems, 2011.
4. B. D. Carlstrom, A. McDonald, C. Kozyrakis, and K. Olukotun. Transactional collection classes. In PPoPP, 2007.
5. B. Demsky and P. Lam. Views: object-inspired concurrency control. In ICSE, 2010.
6. K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger. The notions of consistency and predicate locks in a database system. Commun. ACM, 19(11):624-633, 1976.
7. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4):921-940, 1988.
8. J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Morgan Kaufmann Publishers Inc., 1992.
9. T. Harris and K. Fraser. Language support for lightweight transactions. In OOPSLA. Oct 2003.
10. M. Herlihy and E. Koskinen. Transactional boosting: a methodology for highly-concurrent transactional objects. In PPoPP, 2008.
11. M. Herlihy, V. Luchangco, and M. Moir. A flexible framework for implementing software transactional memory. In OOPSLA, 2006.
12. M. Herlihy and J. E. B. Moss. Transactional memory: architectural support for lock-free data structures. In ISCA, 1993.
13. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. TOPLAS, 12(3):463-492, 1990.
14. D. Kim and M. Rinard. Verification of semantic commutativity conditions and inverse operations on linked data structures. In PLDI, 2011.
15. E. Koskinen, M. Parkinson, and M. Herlihy. Coarse-grained transactions. In POPL, 2010.
16. M. Kulkarni, M. Burtscher, R. Inkulu, K. Pingali, and C. Casçaval. How much parallelism is there in irregular applications? In PPoPP, 2009.
17. M. Kulkarni, K. Pingali, G. Ramanarayanan, B. Walter, K. Bala, and L. P. Chew. Optimistic parallelism benefits from data partitioning. In ASPLOS, 2008.
18. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. P. Chew. Optimistic parallelism requires abstractions. In PLDI, 2007.
19. J. Larus and R. Rajwar. Transactional Memory (Synthesis Lectures on Computer Architecture). Morgan & Claypool Publishers, 2007.
20. Y. Ni, V. Menon, A.-R. Adl-Tabatabai, A. L. Hosking, R. Hudson, J. E. B. Moss, B. Saha, and T. Shpeisman. Open nesting in software transactional memory. In PPoPP, 2007.
21. C. H. Papadimitriou. The serializability of concurrent database updates. J. ACM, 26(4):631-653, 1979.
22. L. Rauchwerger and D. Padua. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. In PLDI, 1995.
23. P. M. Schwarz and A. Z. Spector. Synchronizing shared abstract types. ACM Trans. Comput. Syst., 2(3):223-250, 1984.
24. B. Walter, K. Bala, M. Kulkarni, and K. Pingali. Fast agglomerative clustering for rendering. In Interactive Ray Tracing, 2008.
25. W. Weihl. Commutativity-based concurrency control for abstract data types. IEEE Transactions on Computers, 37(12), 1988.