Bounding sequence numbers in distributed systems: a general approach
暂无分享,去创建一个
[1] Ashok K. Agrawala,et al. An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.
[2] Leslie Lamport,et al. Distributed Systems: Methods and Tools for Specification, An Advanced Course, April 3-12, 1984 and April 16-25, 1985, Munich, Germany , 1985, Advanced Course: Distributed Systems.
[3] Fred B. Schneider,et al. Byzantine generals in action: implementing fail-stop processors , 1984, TOCS.
[4] Carl A. Sunshine,et al. Connection Management in Transport Protocols , 1978, Comput. Networks.
[5] Raymond S. Tomlinson. Selecting sequence numbers , 1975, ACM SIGOPS Oper. Syst. Rev..
[6] Phil Kearns,et al. Immediate ordered service in distributed systems , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.
[7] Colin J. Fidge,et al. Timestamps in Message-Passing Systems That Preserve the Partial Ordering , 1988 .
[8] Ichiro Suzuki,et al. A distributed mutual exclusion algorithm , 1985, TOCS.
[9] Richard W. Watson,et al. Gaining efficiency in transport services by appropriate design and implementation choices , 1987, TOCS.
[10] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.