Software Transactional Memory for Dynamic-Sized Data Structures

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 92-101

  Herlihy, Maurice ^a   Moir, Mark ^b   Luchangco, Victor ^b   Scherer III, William N ^c  

^a Brown Univerity   (United States)

^b SUN MICROSYSTEMS   (United States)

^c University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; COMPUTER SOFTWARE; DATA STORAGE EQUIPMENT; INTERFACES (COMPUTER); JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; PROGRAM PROCESSORS;

APPLICATION PROGRAMMING INTERFACES (API); CONTENTION MANAGEMENT; RED-BLACK TREE; SOFTWARE TRANSACTIONAL MEMORY (STM);

DATA STRUCTURES;

EID: 1142293109     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872048     Document Type: Conference Paper

References (15)

1. Java Specification Request for Concurrent Utilities (JSR166). http://jcp.org.
2. Sun Microsystems Laboratories Scalable Synchronization Research Group publications page. http://research.sun.com/acalable/pubs.
3. Y. Afek, D. Dauber, and D. Touitou. Wait-free made fast. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 538-547, 1995.
4. G. Barnes. A method for implementing lock-free shared data structures. In Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pages 261-270, 1993.
5. R. Bayer and M. Schkolnick. Concurrency of operations on B-trees. Acta Informatica, 9:1-21, 1977.
6. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, 1990.
7. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In Proceedings of the 23rd International Conference on Distributed Computing Systems, 2003.
8. M. Herlihy and J. Moss. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the 20th International Symposium in Computer Architecture, pages 289-300, 1993.
9. M. Herlihy and J. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, 1990.
10. A. Israeli and L. Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. In Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, pages 151-160, 1994.
11. V. Luchangco, M. Moir, and N. Shavit. Nonblocking k-compare-single-swap. In Proceedings of the 15th Annual ACM Sympoium on Parallel Architecures and Algorithms, 2003.
12. M. Michael and M. Scott. Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors. Journal of Parallel and Distributed Computing, 51(1):1-26, 1998.
13. M. Moir. Transparent support for wait-free transactions. In Proceedings of the 11th International Workshop on Distributed Algorithms, pages 305-319, 1997.
14. N. Shavit and D. Touitou. Software transactional memory. Distributed Computing, Special Issue(10):99-116, 1997.
15. J. Turek, D. Shasha, and S. Prakash. Locking without blocking: making lock based concurrent data structure algorithms nonblocking. In Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, pages 212-222, 1992.