Hagit Attiya
Eshcar Hillel
ABSTRACT
LSTM (local software transactional memory) is the first nonblocking implementation of dynamic software transactional memory with O(k)-local step complexity and contention, where k is the size of the operation's data set.
- Y. Afek, M. Merritt, G. Taubenfeld, and D. Touitou. Disentangling multi-object operations. PODC 1997. Google Scholar
Digital Library
- H. Attiya and E. Dagan. Improved implementations of binary universal operations. J. ACM, 48(5):1013--1037. Google ScholarDigital Library
- G. Barnes. A method for implementing lock-free shared-data structures. SPAA 1993. Google ScholarDigital Library
- D. Dice, O. Shalev, and N. Shavit. Transactional locking II. DISC 2006. Google ScholarDigital Library
- K. Fraser. Practical Lock-Freedom. PhD thesis, University of Cambridge, 2004.Google Scholar
- T. Harris, K. Fraser, and I. Pratt. A practical multi-word compare-and-swap operation. DISC 2002. Google ScholarDigital Library
- M. Herlihy, V. Luchangco, M. Moir, and W. Scherer. Software transactional memory for dynamic-sized data structures. PODC 2003. Google ScholarDigital Library
- M. Herlihy and E. Moss. Transactional memory: architectural support for lock-free data structures. ISCA 1993. Google ScholarDigital Library
- A. Israeli and L. Rappoport. Disjoint-access-parallel implementations of strong shared memory primitives. PODC 1994. Google ScholarDigital Library
- W. Scherer and M. Scott. Advanced contention management for dynamic software transactional memory. PODC 2005. Google ScholarDigital Library
- N. Shavit and D. Touitou. Software transactional memory. Dist. Comp., 10(2):99--116.Google Scholar
- J. Turek, D. Shasha, and S. Prakash. Locking without blocking: making lock based concurrent data structure algorithms nonblocking. PODS 1992. Google ScholarDigital Library
Index Terms
- The power of DCAS: highly-concurrent software transactional memory
Recommendations
CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computingTransactional memory (TM) is a key concurrent programming abstraction. Several software-based transactional memory (STM) implementations have been developed in recent years. All STM implementations must guarantee transaction atomicity but different STM ...
Advanced contention management for dynamic software transactional memory
PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computingThe obstruction-free Dynamic Software Transactional Memory (DSTM) system of Herlihy et al@. allows only one transaction at a time to acquire an object for writing. Should a second require an object currently in use, a contention manager must determine ...
Conflict Avoidance Scheduling Using Grouping List for Transactional Memory
IPDPSW '12: Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD ForumConventional Transactional Memory (TM) systems may experience performance degradation in applications with high contention, given the fact that execution of transaction will frequently restart due to conflicts. The restarting of transaction essentially ...
Comments