Understanding tradeoffs in software transactional memory

International Symposium on Code Generation and Optimization, CGO 2007

Volumn , Issue , 2007, Pages 21-33

  Dice, Dave ^a   Shavit, Nir ^b  

^a SUN MICROSYSTEMS   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY MANAGEMENT; TRANSACTIONAL MEMORIES;

ALGORITHMS; COMPUTER SOFTWARE; DECISION MAKING;

DATA STORAGE EQUIPMENT;

EID: 34547670723     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGO.2007.38     Document Type: Conference Paper

References (36)

1. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. J. ACM, 40(4):873-890, 1993.
2. O. Agesen, D. Detlefs, A. Garthwaite, R. Knippel, Y. S. Ramakrishna, and D. White. An efficient meta-lock for implementing ubiquitous synchronization. ACM SIGPLAN Notices, 34(10):207-222, 1999.
3. C. S. Ananian, K. Asanovic, B. C. Kuszmaul, C. E. Leiserson, and S. Lie. Unbounded transactional memory. In HPCA '05: Proceedings of the 11th International Symposium on High-Performance Computer Architecture, pages 316-327, Washington, DC, USA, 2005. IEEE Computer Society.
4. C. S. Ananian and M. Rinard. Efficient software transactions for object-oriented languages. In Proceedings of Synchronization and Concurrency in Object-Oriented Languages (SCOOL). ACM, 2005.
5. B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7):422-426, 1970.
6. H.-J. Boehm. Space efficient conservative garbage collection. In SIGPLAN Conference on Programming Language Design and Implementation, pages 197-206, 1993.
7. T. H. Cormen, E. Leiserson, Charles, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990. COR th 01:1 1.Ex.
8. D. Dice, http://blogs.sun.com/dave/entry/ hardware_assisted_transactional_read_set.
9. D. Dice, O. Shalev, , and N. Shavit. Transactional locking ii. In Proc. International Symposium on Distributed Computing. Springer Verlag, 2006.
10. R. Ennals. Software transactional memory should not be obstruction-free. www.cambridge.intelresearch.net/(tilda)rennals/notlockfree.pdf. www.cambridge.intel-research.net/rennals/notlockfree.pdf.
11. K. Fraser. Practical lock freedom. PhD thesis, Cambridge University Computer Laboratory, 2003. Also available as Technical Report UCAM-CL-TR-579.
12. L. Hammond, V. Wong, M. Chen, B. D. Carlstrom, J. D. Davis, B. Hertzberg, M. K. Prabhu, H. Wijaya, C. Kozyrakis, and K. Olukotun. Transactional memory coherence and consistency. In ISCA '04: Proceedings of the 31st annual international symposium on Computer architecture, page 102, Washington, DC, USA, 2004. IEEE Computer Society.
13. S. Hanke. The performance of concurrent red-black tree algorithms. In WAE '99: Proceedings of the 3rd International Workshop on Algorithm Engineering, pages 286-300, London, UK, 1999. Springer-Verlag.
14. T. Harris and K. Fraser. Concurrent programming without locks.
15. T. Harris and K. Fraser. Language support for lightweight transactions. SIGPLANNot., 38(11):388-402, 2003.
16. T. Harris, M. Plesko, A. Shinnar, and D. Tarditi. Optimizing memory transactions. In PLDI '06: Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation, pages 14-25, New York, NY, USA, 2006. ACM Press.
17. S. Heller, M. Herlihy, V Luchangco, M. Moir, N. Shavit, and I. W. N. Scherer. A lazy concurrent list-based set algorithm. In 9th Intl. Conf. on Principles of Distributed Systems (OPODIS), 2005.
18. M. Herlihy, V Luchangco, and M. Moir. The repeat offender problem: A mechanism for supporting lock-free dynamicsized data structures. In Proceedings of the 16th International Symposium on DIStributed Computing, volume 2508, pages 339-353. Springer-Verlag Heidelberg, January 2002. A improved version of this paper is in preparation for journal submission; please contact authors.
19. M. Herlihy, V Luchangco, M. Moir, and W. N. Scherer, III. Software transactional memory for dynamic-sized data structures. In Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 92-101. ACM Press, 2003.
20. M. Herlihy and E. Moss. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the Twentieth Annual International Symposium on Computer Architecture, 1993.
21. M. P. Herlihy and J. M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3):463-492, 1990.
22. C. Kruskal, L. Rudolph, and M. Snir. Efficient synchronization of multiprocessors with shared memory. ACM Transactions on Programming Languages and Systems, 10(4):579-601, 1988.
23. S. Kumar, M. Chu, C. Hughes, P. Kundu, and A. Nguyen. Hybrid transactional memory. In To appear in PPoPP 2006, 2006.
24. V J. Marathe, W. N. Scherer, and M. L. Scott. Design trade-offs in modern software transactional memory systems. In In Proceedings of the 7th Workshop on Languages, Compilers, and Run-time Support for Scalable Systems (LCR'04), 2004.
25. V. J. Marathe, W. N. Scherer, and M. L. Scott. Adaptive software transactional memory. In To Appear in the Proceedings of the 19th International Symposium on Distributed Computing (DISC'05), 2005.
26. J. Mellor-Crummey and M. Scott. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems, 9(1):21-65, 1991.
27. M. M. Michael. Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Trans. Parallel Distrib. Syst., 15(6):491-504, 2004.
28. M. M. Michael and M. L. Scott. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In Symposium on Principles of Distributed Computing, pages 267-275, 1996.
29. M. Moir, P. Damron, A. Fedorova, Y Lev, and V Luchangco. Hybrid transactional memory. In ASPLOS-XII: Proceedings of the 12th international conference on Architectural support for programming languages and operating systems, pages 336-346, New York, NY, USA, 2006. ACM Press.
30. W. Pugh. A skip list cookbook. Technical report, College Park, MD, USA, 1990.
31. A. R. R. L. Hudson B. Saha and B. Hertzberg. Mcrt-malloc: A scalable transactional memory allocator. In In Proceedings of the 2006 International Symposium on Memory Management, pages 197-206, June 2006.
32. R. Rajwar. Transactional memory online, http://www.cs.wisc.edu/trans- memory.
33. R. Rajwar, M. Herlihy, and K. Lai. Virtualizing transactional memory. In ISCA '05: Proceedings of the 32nd Annual International Symposium on Computer Architecture, pages 494-505, Washington, DC, USA, 2005. IEEE Computer Society.
34. B. Saha, A. Adl-Tabatabai, R. L. Hudson, C. C. Minh, and B. Hertzberg. A high performance software transactional memory system for a multi-core runtime. In To appear in PPoPP 2006, 2006.
35. N. Shavit and D. Touitou. Software transactional memory. Distributed Computing, 10(2):99-116, February 1997.
36. A. Welc, S. Jagannathan, and A. L. Hosking. Transactional monitors for concurrent objects. In Proceedings of the European Conference on Object-Oriented Programming, volume 3086 of Lecture Notes in Computer Science, pages 519-542. Springer-Verlag, 2004.