一种高效能的分布式请求集生成算法  

A High-performance Distributed Request Set Generation Algorithm

作　　者：郭玉波[1] 陈志党[1] 王春申[1] 林岚[1] 

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

出　　处：《微计算机信息》2011年第8期201-203,共3页Control & Automation

摘　　要：分布式互斥请求集的长度、对称性和生成的难易程度以及生成算法占用的空间及耗费的时间直接影响着基于该请求集的分布式互斥算法的消息复杂度、对称性和算法的应用规模。本文在折半循环编码算法的基础上,提出了一种增加算法初始化节点数量和引入松弛差集的对称分布式互斥请求集生成算法,使算法的时间复杂度和消息复杂度大幅度降低。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.In this paper binary encoding algorithm based on the cycle,a algorithm is initialized to increase the number of nodes and the introduction of relaxed difference set of symmetric distributed mutual exclusion request set generation algorithm,the algorithm＇s time complexity and message complexity significantly reduced.

关 键 词：初始化 松弛差集 时间复杂度 消息复杂度 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]