Based on the advantages and disadvantages of LUK's and LI's algorithms, a symmetric distributed mutual exclusion quorum generation algorithm with variable-length has been presented. Through introducing the concepts of laxity and average permission repeat times, the time complexity of this quorum generation algorithm became to O(N/2) and the quorum length became Nÿ+laxity.
展开▼