Dynamic behaviour of the distributed tree quorum algorithm
Tóm tắt
Mechanisms that ensure mutual access, replication and resilience to failures in large distributed systems can be based on quorum consensus. Effectiveness and scalability of the method selected are crucial. The aim of this paper is to present a message/time cost analysis of a distributed algorithm based on the tree quorum, which needs no global information, and has message complexity independent of the load. Results obtained for the different identifications of the requests (a requester's identification, timestamp, and group priority) illustrate the flexibility of the method The algorithm supports priority, the feature important for current middleware technologies.
Từ khóa
#Costs #Scalability #Distributed algorithms #Delay #Computer science #Resilience #Information analysis #Algorithm design and analysis #Middleware #AvailabilityTài liệu tham khảo
cao, 2001, A Delay-Optimal Quorum Based Mutual Exclusion Algorithm for Distributed Systems, IEEE Trans on Par and Dist Syst, 12, 1256, 10.1109/71.970560
10.1007/BF02242735
chang, 1996, A Simulation Study on Distributed Mutual Exclusion, J Par Distr Comput, 33, 107, 10.1006/jpdc.1996.0030
chang, 1994, Message Complexity of the Tree Quorum Algorithm for Distributed Mutual Ex-Clusion, Proc of the 14th ICDCS, 76
10.1145/214438.214445
golding, 1991, Accessing Replicated Data in Large Scale Distributed Systems, Int J Computer Simulation, 1, 347
10.1109/FTCS.1996.534591
10.1007/BF01798960
10.1145/103727.103728