An optimal algorithm for mutual exclusion in computer networks
Tóm tắt
Từ khóa
Tài liệu tham khảo
Dijkstra , E.W. Hierarchical ordering of sequential processes. Acta lnformatica 1, 2 ( 1971 ), 115-138. Dijkstra, E.W. Hierarchical ordering of sequential processes. Acta lnformatica 1, 2 (1971), 115-138.
Lamport , L. Time, clocks and the ordering of events in a distributed system. Rep. CA-7603-2911 , Mass. Comptr. Assoc., Wakefield, Mass. March 1976 . Lamport, L. Time, clocks and the ordering of events in a distributed system. Rep. CA-7603-2911, Mass. Comptr. Assoc., Wakefield, Mass. March 1976.
Ricart , G. , and Agrawala , A.K . Performance of a distributed network mutual exclusion algorithm. Tech. Rept. TR-774 , Dept. Comptr. Sci., Univ. of Maryland , College Park , Md ., March 1979 . Ricart, G., and Agrawala, A.K. Performance of a distributed network mutual exclusion algorithm. Tech. Rept. TR-774, Dept. Comptr. Sci., Univ. of Maryland, College Park, Md., March 1979.
Ricart , G. , and Agrawala , A.K . Using exact timing to implement mutual exclusion in a distributed network. Tech. Rept. TR-742 , Dept. Comptr. Sci., Univ. of Maryland , College Park , Md . March 1979 . Ricart, G., and Agrawala, A.K. Using exact timing to implement mutual exclusion in a distributed network. Tech. Rept. TR-742, Dept. Comptr. Sci., Univ. of Maryland, College Park, Md. March 1979.