Author:
Cole Christopher,Herlihy Maurice
Reference15 articles.
1. Wait-free made fast;Afek,1995
2. Universal constructions for large objects;Anderson,1995
3. Keir Fraser, Practical lock-freedom, Technical Report UCAM-CL-TR-579, University of Cambridge Computer Laboratory, February 2004
4. Language support for lightweight transactions;Harris,2003
5. Maurice Herlihy, J. Eliot B. Moss, Transactional memory: Architectural support for lock-free data structures, in: Proceedings of the Twentieth Annual International Symposium on Computer Architecture, 1993
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A speculation‐friendly binary search tree;Concurrency and Computation: Practice and Experience;2018-07-31
2. Elastic transactions;Journal of Parallel and Distributed Computing;2017-02
3. A Multi-Core Architecture for Video Streaming;Applied Mechanics and Materials;2013-09
4. A speculation-friendly binary search tree;ACM SIGPLAN Notices;2012-09-11
5. Transactions are back---but are they the same?;ACM SIGACT News;2008-03