基于贪心策略的高效能分布式请求集生成算法

Local greedy strategy based on high-performance quorum generation algorithm

在松弛循环差集的基础上,依据局部贪心策略对可纳入节点以局部求优的方式来生成请求集的算法,使算法的时间复杂度降低一个数量级,同时所生成的请求集长度仍然保持在2 N～2N,从而更有利于在通信中推广使用。

Based on the relaxation of cyclic difference sets and the basis of local greedy strategy could be incorporated into the nodes of local demand excellent way generate the request set of algorithms,the algorithm＇s time complexity decreased a order of magnitude,while the length of generated request sets remained between 2N and 2N,So as to be more useful to communication.