Toward a theory of transactional contention managers

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 258-264

  Guerraoui, Rachid ^a   Herlihy, Maurice ^b   Pochon, Bastian ^a  

^a EPFL   (Switzerland)

^b BROWN UNIVERSITY   (United States)

Author keywords

Contention management; Software transactional memory; Transactions

Indexed keywords

CONTENTION MANAGEMENT; SOFTWARE TRANSACTIONAL MEMORY; TRANSACTIONS;

ALGORITHMS; BENCHMARKING; COMPUTER SOFTWARE; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS;

INFORMATION MANAGEMENT;

EID: 32344439666     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073863     Document Type: Conference Paper

References (26)

1. Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
2. Steve J. Chapin. Distributed and multiprocessor scheduling. ACM Comput. Surv., 28(1):233-235, 1996.
3. M. R. Garey and Ronald L. Graham. Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput., 4(2):187-200, 1975.
4. Mario J. Gonzalez, Jr. Deterministic processor scheduling. ACM Comput. Surv., 9(3):173-204, 1977.
5. R. Guerraoui. Indulgent algorithms. In Proceedings of the nineteenth annual symposium on Principles of distributed computing, pages 289-299. ACM Press, 2000.
6. Lance Hammond, Vicky Wong, Mike Chen, Ben Hertzberg, Brian D. Carlstrom, John D. Davis, Manohar K. Prabhu, Honggo Wijaya, Christos Kozyrakis, and Kunle Olukotun. Transactional memory coherence and consistency. In Proceedings of the thirty-first Annual International Symposium on Computer Architecture, June 2004.
7. Tim Harris and Keir Fraser. Language support for lightweight transactions. In Proceedings of the eighteenth ACM Conference on Object-oriented programing, systems, languages, and applications, pages 388-402. ACM Press, 2003.
8. Tim Harris, Simon Marlow, Simon Peyton Jones, and Maurice Herlihy. Composable memory transactions. In Principles and Practice of Parallel Programming, 2005. To appear.
9. Maurice Herlihy, Victor Luchangco, and Mark Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proceedings of the twenty-third International Conference on Distributed Computing Systems, pages 522-529, May 2003.
10. Maurice Herlihy, Victor Luchangco, Mark Moir, and William 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.
11. J. Huang, J. Stankovic, K. Ramamritham, and D. Towsley. Experimental evaluation of real-time optimistic concurrency control schemes. In Proceedings of the seventeenth Conference on Very Large Databases. Morgan Kaufman, 1991.
12. Amos Israeli and Lihu Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. In Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing, pages 151-160. ACM Press, 1994.
13. H. T. Kung and John T. Robinson. On optimistic methods for concurrency control. ACM Trans. Database Syst., 6(2):213-226, 1981.
14. Errol L. Lloyd. Critical path scheduling of task systems with resource and processor constraints (extended abstract). In Proceedings of the twelfth annual ACM symposium on Theory of computing, pages 436-446. ACM Press, 1980.
15. V. J. Marathe, W. N. Scherer, III, and M. L. Scott. Design tradeoffs in modern software transactional memory systems. In 7th Workshop on Languages, Compilers, and Run-time Support for Scalable Systems, October 2004.
16. José F. Martínez and Josep Torrellas. Speculative synchronization: applying thread-level speculation to explicitly parallel applications. In Proceedings of the tenth international conference on architectural support for programming languages and operating systems, pages 18-29. ACM Press, 2002.
17. David McWherter, Bianca Schroeder, Natassa Ailamaki, and Mor Harchol-Balter. Priority mechanisms for OLTP and transactional web applications. In Proceedings of the twentieth International Conference on Data Engineering, April 2004.
18. Mark Moir. Practical implementations of non-blocking synchronization primitives. In Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing, pages 219-228. ACM Press, 1997.
19. Jeffrey Oplinger and Monica S. Lam. Enhancing software reliability with speculative threads. In Proceedings of the tenth international conference on architectural support for programming languages and operating systems, pages 184-196. ACM Press, 2002.
20. Ravi Rajwar and James R. Goodman. Transactional lock-free execution of lock-based programs. In Proceedings of the tenth international conference on architectural support for programming languages and operating systems, pages 5-17. ACM Press, 2002.
21. Microsoft Research. C# software transactional memory. Available at: http://research, microsoft.com/research/ downloads/default, aspx.
22. Daniel J. Rosenkrantz, Richard E. Stearns, and Philip M. Lewis. System level concurrency control for distributed database systems. ACM Transactions on Database Systems, 3(2):178-198, June 1978.
23. W. Scherer, III and M. Scott. Contention management in dynamic software transactional memory. In PODC Workshop on Concurrency and Synchronization in Java Programs, July 2004.
24. W. Scherer, III and M. Scott. Advanced contention management for dynamic software transactional memory. In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, July 2005.
25. Nir Shavit and Dan Touitou. Software transactional memory. In Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing, pages 204-213. ACM Press, 1995.
26. Janice M. Stone, Harold S. Stone, Phil Heidelberger, and John Turek. Multiple reservations and the Oklahoma update. IEEE Parallel and Distributed Technology, 1(4):58-71, November 1993.