Adaptive software transactional memory

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3724 LNCS, Issue , 2005, Pages 354-368

  Marathe, Virendra J ^a   Scherer III, William N ^a   Scott, Michael L ^a  

^a University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC CONVERSION; SOFTWARE TRANSACTIONAL MEMORY (STM); TRANSACTIONS;

ADAPTIVE SYSTEMS; BENCHMARKING; COMPUTER SOFTWARE; CONCURRENCY CONTROL; DECISION MAKING; SEMANTICS; SYNCHRONIZATION;

DATA STORAGE EQUIPMENT;

EID: 33646411224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11561927_26     Document Type: Conference Paper

References (21)

1. G. Barnes. A Method for Implementing Lock-Free Shared Data Structures. In Proc. of the 5th Ann. ACM Symp. on Parallel Algorithms and Architectures, pages 261-270, 1993.
2. K. Fraser. Practical Lock-Freedom. Technical Report UCAM-CL-TR-579, Cambridge University Computer Laboratory, Feb. 2004.
3. K. Fraser and T. Harris. Concurrent Programming without Locks. Submitted for publication, 2004.
4. R. Guerraoui, M. P. Herlihy, and B. Pochon. Toward a Theory of Transactional Contention Managers. In Proc. of 24th Ann. ACM Symp. on Principles of Distributed Computing, July 2005.
5. T. Harris and K. Fraser. Language Support for Lightweight Transactions. In Proc. of 18th Ann. ACM Conf. on Object-Oriented Prog., Sys., Langs., and Apps.,Oct. 2003.
6. M. P. Herlihy. A Methodology for Implementing Highly Concurrent Data Structures. In Proc. of the 2nd ACM Symp. on Principles & Practice of Parallel Prog., Mar. 1990.
7. M. P. Herlihy, V. Luchangco, and M. Moir. Obstruction Free Synchronization: Double-Ended Queues as an Example. In Proc. of 23rd Intl. Conf. on Distributed Computing Sys., pages 522-529, May 2003.
8. M. P. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer III. Software Transactional Memory for Dynamic-sized Data Structures. In Proc. of 22nd Ann. ACM Symp. on Principles of Distributed Computing, July 2003.
9. M. P. Herlihy and J. E. B. Moss. Transactional Memory: Architectural Support for Lock-Free Data Structures. In Proc. of the 20th Ann. Intl. Symp. on Computer Architecture, pages 289-300, May 1993.
10. M. P. Herlihy and J. M. Wing. Linearizability: a Correctness Condition for Concurrent Objects. ACM Trans. on Prog. Langs. and Sys., 12(3):463-492, 1990.
11. A. Israeli and L. Rappoport. Disjoint-Access-Parallel Implementations of Strong Shared Memory Primitives. In Proc. of the 13th Ann. ACM Symp. on Principles of Distributed Computing, pages 151-160, 1994.
12. D. Lea. Concurrency JSR-166 Interest Site, http://gee.cs.oswego.edu/dl/ concurrency-interest/.
13. V. J. Marathe, W. N. Scherer III, and M. L. Scott. Design Tradeoffs in Modern Software Transactional Memory Systems. In Proc. of 14th Workshop on Langs., Compilers, and Run-time Support for Scalable Sys., Oct. 2004.
14. V. J. Marathe, W. N. Scherer III, and M. L. Scott. Adaptive Software Transactional Memory. Technical Report TR 868, Dept. of Computer Science, University of Rochester, May 2005.
15. M. Moir. Transparent Support for Wait-Free Transactions. In Proc. of the 11th Intl. Workshop on Distributed Algorithms, pages 305-319. Springer-Verlag, 1997.
16. J. T. Robinson and M. V. Devarakonda. Data Cache Management Using Frequency-Based Replacement. In Proc. of the 1990 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Sys., pages 134-142, 1990.
17. W. N. Scherer III and M. L. Scott. Contention Management in Dynamic Software Transactional Memory. In Proc. of Workshop on Concurrency and Synchronization in Java Progs., pages 70-79, July 2004.
18. W. N. Scherer III and M. L. Scott. Advanced Contention Management in Dynamic Software Transactional Memory. In Proc. of 24th Ann. ACM Symp. on Principles of Distributed Computing, July 2005.
19. N. Shavit and D. Touitou. Software Transactional Memory. In Proc. of 14th Ann. ACM Symp. on Principles of Distributed Computing, pages 204-213, Aug. 1995.
20. J. M. Stone, H. S. Stone, P. Heidelberger, and J. Turek. Multiple Reservations and the Oklahoma Update. IEEE Parallel and Distributed Technology, 1(4):58-71, Nov. 1993.
21. J. Turek, D. Shasha, and S. Prakash. Locking without Blocking: Making Lock Based Con-current Data Structure Algorithms Nonlocking. In Proc. of the 11th ACM Symp. on Principles of Database Sys., pages 212-222, 1992.