Based On Difference Sets Of High-performance Distributed Request Set Generation Algorithm

摘要：

The length, symmetry and generation complexity of the distributed mutual exclusion quorum and the time and space complexity of the generation algorithm will directly affect the message complexity, symmetry and system scale of these distributed mutual exclusion algorithms based on it 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 use 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) and 2√N.

关键词： component Mtialization relaxed positive difference set quorum

作者: Meian Li Zhidang Chen Chunshen Wang Lan Lin

作者单位: College of Computer and Information Engineering.Inner Mongolia Agricultural University,Huhehaote,China

会议类型: 国际会议

会议名称: 2011 3rd International Conference on Computer and Network Technology(ICCNT 2011)(2011第三届IEEE计算机与网络技术国际会议)

会议地点: 太原

会议语种:英文

页码: 122-1525

在线出版日期: 2011-02-26（万方平台首次上网日期，不代表论文的发表时间）