中文摘要：

提出一种新的分布式互斥循环请求集生成算法。该算法采用折半加一与局部递归的方式，在不明显增加请求集长度的情况下，能至少降低WK算法50％的时间复杂度。在利用局部递归方式计算循环请求集时，如果系统节点数属于某分段的后半段，则设定其循环请求集长度下限为√N＋1。性能分析结果表明，该算法能够在规定时间内计算大规模分布式系统的循环请求集，具有较高的实用性。

英文摘要：

Anew distributed cyclic quorum generation algorithm is proposed. Using local recursion and binary plus one, in case of not decreasing quorum length, this algorithm can reduce the time complexity of WK algorithm 50% at least. If the system scale is belong of the behind part in a section, set the shortest quorum length as √N＋1 when using recursion to search quorum. Performance analysis results show that the algorithm can calculate the cyclic quorum of a more large-scale distributed system. So it has higher practicability.