分布式系统中互斥算法的研究

Research of mutual exclusion algorithm in distribution systems

公平、健壮和易于实现的分布式互斥算法对分布式系统保证数据一致性、逻辑一致性及时序一致性至关重要,互斥问题是分布式系统中一个非常重要的内容。互斥算法是用来解决共享资源访问冲突问题,阐述了分布式系统中进程的互斥问题。对几种算法进行了讨论,分析了其特点,最后给出了一个k-互斥问题的算法,并介绍了该算法应满足的条件和实现过程。

It＇s very important to use a fair and easy implementation distributed mutual exclusion algorithm to ensure the data, logic and time consistency of a distributed system, and mutual exclusion is a very important issue in the distribution systems. The mutual exclusion problem （mutex） means how to solve the clash problem that one processes request to enter a critical section at the same time. Mutual exclusion between courses in distributed system are expatiated detailedly in this paper. Some kinds of algorithms are discussed and their characters are also analyzed, and finally this article gives K-mutual exclusion algorithm, and at the same time introduces satisfied condition and how to implement k-mutual exclusion algorithm.