基于银行家算法的分布式互斥请求集生成算法研究计算机应用技术专业论文.docxVIP

A Quorum Generation Algorithm for Distributed Mutual Exclusion Basing on the Banker’s Algorithm Abstract Distributed Mutual Exclusion efficiency of the system depends to a great extent to get the efficiency of the requesting node. Quorum generation algorithms to achieve the optimal length, but the time complexity is too high; If you want to get a quick generation, but also a corresponding increase in the length of the quorum of. Therefore, to design one and the optimal length and the optimum time complexity is one of the quorum generation algorithm become the urgent need to address the problem. This paper analyzes the distributed mutual exclusion algorithm background and development status. On this basis, focusing on the characteristics of distributed mutual exclusion system, and then analyzes the quorum sequence of the significance of the system. Also described in detail the advantages and disadvantages of the original quorum generation algorithms. Situation for the time complexity and space complexity can not have at the same time, a new type of quorum generation concept. This article focuses on content and innovations in the following aspects. Create a distributed mutual exclusion quorum generation algorithm of the mathematical model. By contrast the characteristics of the existing quorum algorithm determine a good quorum of the standards has. Clear direction. Analysis of the similarities of the bankers algorithm and the quorum generation algorithms. According to the bankers algorithm for deadlock avoidance, and security process sequence of recursive thinking. This idea draws on the quorum generation algorithms. By the addition of the quorum the remaining length of this variable, the quorum of the remaining length of the array of node status as a boundary condition can be determined to apply to enter the legitimacy of the quorum node. The algorithm can be optimal quorum length, its time complexity is far less than the same optimal the quorum length of LUK algori