分布式系统进程互斥算法的研究与改进

本文分析比较了传统互斥算法，提出了一种新的基于令牌的算法，并详细阐述算法的设计思想及其数据结构。本算法最主要的特点是在分布式互斥中引入了优先级和树的概念，能有效的降低进程问的通信量，以及保证互斥和预防死锁。

Study and Improve on Distributed Mutual Exclusion Algorithms

This paper has analyses conventional mutual exclusion algorithms and then presents a new one based on Token. It has set forth the devising idea and its data structure. The main peculiarity of this algorithm is that it has introduced the conception of priority and tree structure which can decrease the quantity among processes efficiently and assure mutual exclusion and prevent dead lock.