A time-out based resilient token transfer algorithm for mutual exclusion in computer networks
暂无分享,去创建一个
[1] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[2] Shmuel Zaks,et al. Tight lower and upper bounds for some distributed algorithms for a complete network of processors , 1984, PODC '84.
[3] William Stallings,et al. Local networks: An introduction , 1984 .
[4] Gary L. Peterson,et al. An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem , 1982, TOPL.
[5] Ashok K. Agrawala,et al. An optimal algorithm for mutual exclusion in computer networks , 1981, CACM.
[6] Ken Thompson,et al. The UNIX time-sharing system , 1974, CACM.
[7] Edsger W. Dijkstra,et al. Solution of a problem in concurrent programming control , 1965, CACM.
[8] David P. Reed,et al. Synchronization with eventcounts and sequencers , 1979, CACM.
[9] Daniel S. Hirschberg,et al. Decentralized extrema-finding in circular configurations of processors , 1980, CACM.
[10] Mamoru Maekawa,et al. A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.
[11] Hector Garcia-Molina,et al. Reliability issues for fully replicated distributed databases , 1982, Computer.
[12] Gérard Le Lann,et al. Algorithms for Distributed Data-Sharing Systems Which Use Tickets , 1978, Berkeley Workshop.
[13] Toshimi Minoura,et al. Resilient Extended True-Copy Token Scheme for a Distributed Database System , 1982, IEEE Transactions on Software Engineering.
[14] Edsger W. Dijkstra,et al. Self-stabilizing systems in spite of distributed control , 1974, CACM.
[15] Ernest J. H. Chang,et al. An improved algorithm for decentralized extrema-finding in circular configurations of processes , 1979, CACM.
[16] Ichiro Suzuki,et al. A distributed mutual exclusion algorithm , 1985, TOCS.