| 分布式互斥算法的研究与改进 |
| |
| 引用本文： | 胡吉明,毕伟.分布式互斥算法的研究与改进[J].计算机与现代化,2006(6):14-17,21. |
| |
| 作者姓名： | 胡吉明 毕伟 |
| |
| 作者单位： | 河海大学计算机及信息工程学院,江苏,南京,210098 |
| |
| 摘 要： | 在几种基于令牌算法的基础上，提出了一个对网络逻辑结构无要求的分布式互斥算法。算法不但能够在逻辑结构无要求的计算机网络中通过发送消息和传递令牌来同步对临界资源的访问，而且可以很好地解决请求丢失、令牌丢失等问题。通过对算法的性能进行分析验证了该算法是高效的，并给出了正确性证明。
|
| 关 键 词： | 分布式互斥算法 令牌 临界资源 临界区 |
| 文章编号： | 1006-2475（2006）06-014-04 |
| 收稿时间： | 2005-08-17 |
| 修稿时间： | 2005-08-17 |
A Token-based Distributed Mutual Exclusion Algorithm |
| |
| HU Ji-ming,BI Wei.A Token-based Distributed Mutual Exclusion Algorithm[J].Computer and Modernization,2006(6):14-17,21. |
| |
| Authors: | HU Ji-ming BI Wei |
| |
| Affiliation: | School of Computer and Information Engineering, Hohai University, Nanjing 210098, China |
| |
| Abstract: | 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. |
| |
| Keywords: | distributed mutual exdusion algorithm token critical resource critical section |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
