A Symmetric Distributed Mutual Exclusion Optimal Length Of The Quorum Generation Algorithm Based On The Time Complexity

Performance of quorum generation algorithm will directly affects the performance of distributed mutual exclusion algorithm. The symmetry of the quorum, will affect the symmetry of distributed mutual exclusion algorithm. Generated quorum set generation algorithm directly affects the length of a request set based on which distributed mutual exclusion algorithm message complexity. but there are already requests for Distributed Mutual Exclusion Algorithm in the request set set the length of time complexity and so can not satisfactory.Based on the advantages and disadvantages of LUK[4]'s and LI[26]'s algorithm, a symmetric distributed mutual exclusion quorum generation algorithm with optimal length has been presented in this paper. It ensures that the quorum length is the shortest through expensing some time complexity to limit modes of the nods included in the quorum. It can reduce the time complexity of the quorum generation algorithm obviously.Through analysis and calculation , This algorithm can generate the minimum of quorum。This algorithm is a series of additional conditions to substantially reduce the time complexity. Thus reducing the requests set based on distributed mutual exclusion algorithm message complexity, improve performance of the algorithm of the time. Because the minimum length for the request, it also increased the distributed mutual exclusion based on its performance of the algorithm.