【摘要】 基于LUK算法和LI的一步逼近算法的优缺点,本文提出了一种时间优化的分布式互斥最优长度请求集生成算法。该算法通过牺牲一定时间复杂度和增设最大松弛度的变量来限制将要纳入请求集的节点的方式,使算法生成的请求集长度保持为,但算法的时间度有很大的降低。更多还原

【Abstract】 Based on the advantages and disadvantages of LUK’s and LI’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.更多还原