Synchronizing without locks is inherently expensive
暂无分享,去创建一个
Rachid Guerraoui | Petr Kuznetsov | Danny Hendler | Hagit Attiya | R. Guerraoui | H. Attiya | D. Hendler | P. Kuznetsov
[1] Danny Dolev,et al. On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[2] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[3] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.
[4] Maurice Herlihy,et al. On the space complexity of randomized synchronization , 1993, PODC '93.
[5] Brian N. Bershad,et al. Practical considerations for non-blocking concurrent objects , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.
[6] Anthony LaMarca,et al. A performance evaluation of lock-free synchronization protocols , 1994, PODC '94.
[7] Sam Toueg,et al. Unreliable failure detectors for reliable distributed systems , 1996, JACM.
[8] Maurice Herlihy,et al. Contention in shared memory algorithms , 1997, J. ACM.
[9] Sam Toueg,et al. Time and Space Lower Bounds for Nonblocking Implementations , 2000, SIAM J. Comput..
[10] Eric Ruppert. Determining Consensus Numbers , 2000, SIAM J. Comput..
[11] Maurice Herlihy,et al. Software transactional memory for dynamic-sized data structures , 2003, PODC '03.
[12] Maurice Herlihy,et al. Obstruction-free synchronization: double-ended queues as an example , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..
[13] Nir Shavit,et al. Operation-valency and the cost of coordination , 2003, PODC '03.
[14] Mark Moir,et al. On the Uncontended Complexity of Consensus , 2003, DISC.
[15] William N. Scherer,et al. Contention Management in Dynamic Software Transactional Memory ∗ , 2004 .
[16] Nir Shavit,et al. Linear lower bounds on real-world implementations of concurrent objects , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[17] Rachid Guerraoui,et al. Computing with Reads and Writes in the Absence of Step Contention , 2005, DISC.
[18] F. Schlenk. Proof of Theorem 4 , 2005 .