CAJ | 학술논문

如何在最短的时间内生成长度最短的对称循环请求集,是当前分布式计算乃至云计算必须解决的问题.提出了一种基于有限递归的最短长度对称循环请求集生成算法.该算法通过减少每一个递归层次的递归次数,在不增加请求集长度的情况下,能够有效地减少请求集生成过程中节点尝试的次数,从而有效地降低算法的时间复杂度,具有较高的实用价值.
여하재최단적시간내생성장도최단적대칭순배청구집,시당전분포식계산내지운계산필수해결적문제.제출료일충기우유한체귀적최단장도대칭순배청구집생성산법.해산법통과감소매일개체귀층차적체귀차수,재불증가청구집장도적정황하,능구유효지감소청구집생성과정중절점상시적차수,종이유효지강저산법적시간복잡도,구유교고적실용개치.
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 quo-rum 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.