论文信息 - Software Transactional Memory Should Not Be Obstruction-Free

Software Transactional Memory Should Not Be Obstruction-Free

Much previous work on Software Transactional Memory has gone to great lengths to be “obstruction-free” — meaning that a transaction is guaranteed to make progress when all other transactions are suspended. In this paper we argue that obstruction-freedom is not an important property for software transactional memory, and demonstrate that, if we are prepared to drop the goal of obstruction-freedom, software transactional memory can be made significantly faster.

Robert Ennals

[1] Keir Fraser,et al. Language support for lightweight transactions , 2003, SIGP.

[2] Andreas Reuter,et al. Transaction Processing: Concepts and Techniques , 1992 .

[3] H SchollMarc,et al. Transactional information systems , 2001 .

[4] Nicholas Nethercote,et al. Dynamic Binary Analysis and Instrumentation , 2004 .

[5] Maurice Herlihy,et al. Software transactional memory for dynamic-sized data structures , 2003, PODC '03.

[6] D. B. Lomet. Process structuring, synchronization, and recovery using atomic actions , 1977 .

[7] Barbara Liskov,et al. Guardians and Actions: Linguistic Support for Robust, Distributed Programs , 1983, TOPL.

[8] J. T. Robinson,et al. On optimistic methods for concurrency control , 1979, TODS.

[9] Keir Fraser,et al. Practical lock-freedom , 2003 .

[10] Mark Moir,et al. Transparent Support for Wait-Free Transactions , 1997, WDAG.

[11] Nir Shavit,et al. Software transactional memory , 1995, PODC '95.

[12] Gottfried Vossen,et al. Transactional Information Systems: Theory, Algorithms, and the Practice of Concurrency Control and Recovery , 2002 .

[13] Virendra J. Marathe,et al. Design tradeoffs in modern software transactional memory systems , 2004 .

[14] William N. Scherer,et al. Contention Management in Dynamic Software Transactional Memory ∗ , 2004 .

[15] Virendra J. Marathe,et al. A Qualitative Survey of Modern Software Transactional Memory Systems , 2004 .