基于时间复杂度优化的分布式互斥请求集生成算法  

A Distributed Mutual Exclusion Quorum Generation Algorithm Based on Optimization of Time Complexity

作　　者：战俊伟[1] 李美安[1] 裴喜春[1] 申二威[1] 

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

出　　处：《微计算机信息》2010年第27期205-207,共3页Control & Automation

摘　　要：基于LUK算法和LI的一步逼近算法的优缺点,本文提出了一种时间优化的分布式互斥最优长度请求集生成算法。该算法通过牺牲一定时间复杂度和增设最大松弛度的变量来限制将要纳入请求集的节点的方式,使算法生成的请求集长度保持为,但算法的时间度有很大的降低。Based on the advantages and disadvantages of LUK’s and LI’s algorithm, a symmetric distributed mutual exclusion quorum generation algorithm with optimal length has been presented in this paper. it ensures that the quorum length is the shortest through expensing some time complexity to limit modes of the nods included in the quorum. It can reduce the time complexity of the quorum generation algorithm obviously.

关 键 词：分布式 互斥 请求集 最大松弛度 

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