Time-adaptive algorithms for synchronization
暂无分享,去创建一个
[1] N. Lynch,et al. Timing-based mutual exclusion , 1992, [1992] Proceedings Real-Time Systems Symposium.
[2] Rajeev Alur,et al. Fast timing-based algorithms , 1996, Distributed Computing.
[3] Danny Dolev,et al. On the minimal synchronism needed for distributed consensus , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[4] Nancy A. Lynch,et al. Bounds on the time to reach agreement in the presence of timing uncertainty , 1991, STOC '91.
[5] Rajeev Alur,et al. How to share an object: A fast timing-based solution , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.
[6] Maurice Herlihy,et al. Wait-free synchronization , 1991, TOPL.
[7] Leslie Lamport,et al. A fast mutual exclusion algorithm , 1987, TOCS.
[8] Shay Kutten,et al. Fast isolation of arbitrary forwarding faults , 1989, PODC '89.
[9] Maurice Herlihy,et al. Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.
[10] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[11] Maged M. Michael,et al. Fast Mutual Exclusion, Even with Contention , 1993 .
[12] Manhoi Choy,et al. Adaptive solutions to the mutual exclusion problem , 1993, PODC '93.
[13] Edsger W. Dijkstra,et al. Solution of a problem in concurrent programming control , 1965, CACM.
[14] James H. Anderson,et al. Fast, scalable synchronization with minimal hardware support , 1993, PODC '93.
[15] Leslie Lamport,et al. Reaching Agreement in the Presence of Faults , 1980, JACM.
[16] G. Taubenfeld,et al. Results about fast mutual exclusion , 1992, [1992] Proceedings Real-Time Systems Symposium.
[17] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.