基于和数列的分布式互斥请求集生成算法  

BASED ON THE SUMMATION SERIES OF DISTRIBUTED MUTEXES REQUEST SET GENERATION ALGORITHMS

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

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

出　　处：《内蒙古农业大学学报（自然科学版）》2012年第3期235-238,共4页Journal of Inner Mongolia Agricultural University(Natural Science Edition)

摘　　要：本文在基于循环编码的分布式互斥请求集生成算法的基础上,提出了1种利用求和数列初始化节点,并且利用对称请求集的性质来生成请求集算法,使算法的时间复杂度降低1个数量级,同时所生成的请求集长度仍然保持在2N^(1/2)到2N^(1/2)之间,从而更有利于在通信中推广使用。In this paper,based on recycling code distributed mutexes request set generation algorithm was put forward on the basis of using a summation series initialization node,and make use of symmetrical request set properties to generate request set algorithm,the method of time complexity reduce an order of magnitude,while the generated request sets the length of to remain in between 2N^（1/2） and 2N^（1/2）,Thus more conducive to promoting the use of the communication.

关 键 词：初始化 循环编码 求和数列 请求集 

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