Universal Constructions for Large Objects
暂无分享,去创建一个
[1] Amos Israeli,et al. Disjoint-access-parallel implementations of strong shared memory primitives , 1994, PODC '94.
[2] Maurice Herlihy,et al. A methodology for implementing highly concurrent data objects , 1993, TOPL.
[3] James H. Anderson,et al. Proceedings of the twelfth annual ACM symposium on Principles of distributed computing , 1993, PODC 1993.
[4] Yehuda Afek,et al. Wait-free made fast (Extended Abstract). , 1995, STOC 1995.
[5] Greg Barnes,et al. A method for implementing lock-free shared-data structures , 1993, SPAA '93.
[6] Mark Moir,et al. Universal constructions for multi-object operations , 1995, PODC '95.
[7] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.
[8] Maurice Herlihy,et al. Linearizability: a correctness condition for concurrent objects , 1990, TOPL.
[9] Mark Moir,et al. Transparent Support for Wait-Free Transactions , 1997, WDAG.
[10] Nir Shavit,et al. Software transactional memory , 1995, PODC '95.
[11] Christopher D. Filachek. Evaluation and Optimization of Lock-Free and Wait-Free Universal Constructions for Large Objects , 1997 .