The Further Exploration For The Algorithm About Distributed Mutual Exclusion Quorum

In the algorithm about distributed mutual exclusion quorum, the symmetry of the algorithm and the length of quorum are not harmonious, time complexity, the space complexity and the length of quorum can’t be combined problem, in order to solve the above problems, this paper focuses on the further exploration and research mainly from the following three aspects in order to solve the above problems.First, the time complexity of the algorithm about distributed mutual exclusion quorum is higher.The paper initiates the node through Fibonacci Sequence and a power of2on the basis of Cyclic algorithm.The paper gets the improved algorithm quorum length, time complexity and the order of magnitude of space complexity using cycle code produce quorum sequence.lt is compared to Cyclic algorithm, and concluding the advangtage and disadvangtage of the improved algorithm.Second,in order to insolve the magnitude of algorithm about distributed mutual exclusion quorum is much higher, the paper improves the algorithm through increasing the number of initial node, introducing greedy algorithm and substruct set.The paper compares the concluded length of quorum with LUK algorithm and Maekawa algorithm.the paper concludes that the the advangtage and disadvangtage of the improved algorithm.Finally,the efficiency of the algorithm is not the best, becaouse the quorum length, time complexity and space complexity are not coordinate in the past, the paper optimize the distributed algorithm through custom the data structure, and introducing the concept of intersection of the minimum distance and local optimal solution in the process of solving algorithm according to the characteristics of distributed mutual exclusion algorithm, then quorum sequence is generated, after the improved algorithm, and Cyclic algorithm are compared, the improved algorithm space complexity is lower, the synchronization time is shorter, fault tolerance performance is much higher.