摘要
在折半循环编码算法的基础上,提出了一种增加算法初始化节点数量和松弛正向差集的对称分布式互斥请求集生成算法,使算法的时间复杂度大幅度降低,而所生成的请求集长度仍然保持(2N)^(1/2)~2N^(1/2)之间。
A new generation algorithm has been proposed in this paper.It can improve the time and length performance of the distributed mutual exclusion algorithm based on binary cyclic coding.Through increasing the number of initialization nodes and relaxed positive difference set,this algorithm makes the time complexity greatly reduced,at the same time,the length of the quorums which it generated is between (2N)^(1/2) and 2N^(1/2).
出处
《微型机与应用》
2011年第3期46-48,51,共4页
Microcomputer & Its Applications