摘要
在几种基于令牌算法的基础上,提出了一个对网络逻辑结构无要求的分布式互斥算法。算法不但能够在逻辑结构无要求的计算机网络中通过发送消息和传递令牌来同步对临界资源的访问,而且可以很好地解决请求丢失、令牌丢失等问题。通过对算法的性能进行分析验证了该算法是高效的,并给出了正确性证明。
Based on several token - based mechanisms, the distributed mutual exclusion algorithm is proposed. The algorithm can not only access the critical resource synchronously, based on sending messages and passing tokens in the computer network with no requirement for logical structure, but also commendably resolve the failure-recovery problems caused by the loss of request and token, etc. The algorithm offers improved performance and the correctness of the algorithm is also proved.
出处
《计算机与现代化》
2006年第6期14-17,21,共5页
Computer and Modernization
关键词
分布式互斥算法
令牌
临界资源
临界区
distributed mutual exdusion algorithm
token
critical resource
critical section
