基于有限递归的最短长度循环请求集生成算法  

Shortest-length quorum generation algorithm based on limited recursion

作　　者：李美安[1] 林岚[1] 陈志党[1] 

机构地区：[1]内蒙古农业大学计算机与信息工程学院,呼和浩特010018

出　　处：《计算机工程与应用》2013年第9期37-40,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61063004)

摘　　要：如何在最短的时间内生成长度最短的对称循环请求集,是当前分布式计算乃至云计算必须解决的问题。提出了一种基于有限递归的最短长度对称循环请求集生成算法。该算法通过减少每一个递归层次的递归次数,在不增加请求集长度的情况下,能够有效地减少请求集生成过程中节点尝试的次数,从而有效地降低算法的时间复杂度,具有较高的实用价值。HOW to generate the symmetric quorum with the shortest length in the shortest possible time is a question that must be resolved in distributed computing and cloud computing. A new quorum generation algorithm for symmetric and cyclic quorum with the shortest length has been proposed in this paper. Through reducing the recursion times in every recursion levels, in the case of not increasing the quorum length, the attempt times of nodes can be reduced and the time complexity of the quorum generation algorithm can be reduced significantly. So this algorithm has higher practical value.

关 键 词：有限递归 循环请求集 最短长度 

分 类 号：TP316.4[自动化与计算机技术—计算机软件与理论]