Taking the heat off transactions: dynamic selection of pessimistic concurrency control

IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium

Volumn , Issue , 2009, Pages

  Sönmez, Nehir ^a,b   Harris, Tim ^c   Cristal, Adrián ^a   Un̈sal, Osman S ^a   Valero, Mateo ^a,b  

^a MICROSOFT RESEARCH   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC BLOCKS; DYNAMIC SELECTION; HASKELL PROGRAMMING LANGUAGE; MUTUAL EXCLUSIONS; OPTIMISTIC CONCURRENCY; RUNTIMES; SINGLE-THREADED;

DISTRIBUTED PARAMETER NETWORKS; LOCKS (FASTENERS);

CONCURRENCY CONTROL;

EID: 84869664656     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2009.5161032     Document Type: Conference Paper

References (30)

1. M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1): 1-70, 1999.
2. M. Ansari, C. Kotselidis, K. Jarvis, M. Lujan, C. Kirkham, and I. Watson. Experiences using adaptive concurrency in transactional memory with Lee's routing algorithm. In PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 261-262, February 2008.
3. M. Ansari, C. Kotselidis, M. Lujan, C. Kirkham, and I. Watson. Investigating contention management for complex transactional memory benchmarks. In Proc. Second Workshop on Programmability Issues for Multi-core Computers (MULTIPROG'09), January 2009.
4. M. S. Atkins and M. Y. Coady. Adaptable concurrency control for atomic data types. ACM Transactions on Computer Systems, 10(3): 190-225, 1992.
5. S. Cherem, T. Chilimbi, and S. Gulwani. Inferring locks for atomic sections. Proc. 2008 ACM SIGPLAN conference on programming language design and implementation (PLDI 2008), 43(6):304-315, 2008.
6. S. Dolev, D. Hendler, and A. Suissa. CAR-STM: Scheduling-based collision avoidance and resolution for software transactional memory. In PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of Distributed Computing, pages 125-134, August 2008.
7. R. E. Gruber. Temperature-based concurrency control. Proc. Third Int. Workshop on Object Orientation and Operating Systems, pages 230-232, December 1993.
8. R. Guerraoui, M. Herlihy, and B. Pochon. Polymorphic contention management. In Proc. of 19th International Symposium on Distributed Computing (DISC 2005), pages 303-323, September 2005.
9. R. L. Halpert, C. J. E Pickett, and C. Verbrugge. Component-based lock allocation. In PACT '07: Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques, pages 353-364, September 2007.
10. T. Harris, S. Marlow, S. Peyton Jones, and M. Herlihy. Com-posable memory transactions. In PPoPP '05: Proc. 10th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 48-60, June 2005.
11. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In ICDCS '03: Proceedings of the 23rd International Conference on Distributed Computing Systems, pages 522-529, May 2003.
12. M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer, III. Software transactional memory for dynamic-sized data structures. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, pages 92-101, July 2003.
13. M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the 20th Annual International Symposium on Computer Architecture, pages 289-301, May 1993.
14. M. Hicks, J. S. Foster, and P. Prattikakis. Lock inference for atomic sections. In First ACM SIGPLAN Workshop on Transactional Computing (TRANSACT 2006), June 2006.
15. P. Hudak, J. Hughes, S. P. Jones, and P. Wadler. A history of Haskell: being lazy with class. In HOPL III: Proceedings of the third ACM SIGPLAN conference on History of programming languages, pages 1-55, June 2007.
16. E. Koskinen and M. Herlihy. Dreadlocks: efficient deadlock detection. In SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in Algorithms and Architectures, pages 297-303, June 2008.
17. B. Liskov, M. Day, and L. Shrira. Distributed object management in Thor. Distributed Object Management, pages 79-91, 1993.
18. C. C. Minh, J. Chung, C. Kozyrakis, and K. Oluko-tun. STAMP: Stanford transactional applications for multiprocessing. In IEEE International Symposium on Workload Characterization (IISWC 2008), pages 35-46, September 2008.
19. K. E. Moore, J. Bobba, M. J. Moravan, M. D. Hill, and D. A. Wood. LogTM: Log-based transactional memory. In Proc. 12th International Symposium on High-Performance Computer Architecture, pages 254-265. February 2006.
20. Y. Ni, A. Welc, A.-R. Adl-Tabatabai, M. Bach, S. Berkow-its, J. Cownie, R. Geva, S. Kozhukow, R. Narayanaswamy, J. Ollivier, S. Preis, B. Saha, A. Tal, and X. Tian. Design and implementation of transactional constructs for C/C++. In International Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), 2008.
21. C. Perfumo, N. Sonmez, S. Stipic, O. Unsal, A. Cristal, T. Harris, and M. Valero. The limits of software transactional memory (STM): dissecting Haskell STM applications on a many-core environment. In CF '08: Proceedings of the 2008 conference on Computing Frontiers, pages 67-78, May 2008.
22. S. Peyton Jones. Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell. July 2000. Presented at the 2000 Markto-berdorf Summer School.
23. W. N. Scherer III. Synchronization and Concurrency in User-level Software Systems. PhD thesis, University of Rochester, Department of Computer Science, 2006.
24. W. N. Scherer III and M. L. Scott. Advanced contention management for dynamic software transactional memory. In PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pages 240-248, July 2005.
25. N. Shavit and D. Touitou. Software transactional memory. In Proc. 14th Annual ACM Symposium on Principles of Distributed Computing, pages 204-213, August 1995.
26. N. Sonmez, A. Cristal, O. Unsal, T. Harris, and M. Valero. Why you should profile transactional memory applications on an atomic block basis: A Haskell case study. In Proceedings of Second Workshop on Programmability Issues for Multi-core Computers (MULTIPROG'09), January 2009.
27. M. Spear, M. Michael, and M. Scott. Inevitability mechanisms for software transactional memory. In Third ACM SIGPLAN Workshop on Transactional Computing (TRANSACT 2008), February 2008.
28. M. M. Waliullah and P. Stenstrom. Intermediate checkpointing with conflicting access prediction in transactional memory systems. Proceedings of the 22nd IEEE International Parallel and Distributed Processing Symposium, April 2008.
29. A. Welc, B. Saha, and A.-R. Adl-Tabatabai. Irrevocable transactions and their applications. In SPAA '08: Proceedings of the twentieth annual Symposium on Parallelism in Algorithms and Architectures, pages 285-296, June 2008.
30. R. M. Yoo and H.-H. S. Lee. Adaptive transaction scheduling for transactional memory systems. In SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in Algorithms and Architectures, pages 169-178, June 2008.