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

Research and Improvement of Distributed System Mutual Exclusion Algorithms

作　　者：易苗苗[1] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003

出　　处：《计算机技术与发展》2014年第11期74-78,共5页Computer Technology and Development

基　　金：国家自然科学基金资助项目(61170322)

摘　　要：随着网络技术的不断发展,分布式系统得到了广泛的研究与应用。然而由于分布式系统中网络带宽有限,且临界资源的数目是固定的,因此研究设计网络负载轻、临界资源利用率高的分布式互斥算法具有重要的意义。文中首先介绍了几种传统的互斥算法,对各个算法的性能加以比较,结合上述分析提出了一种新的基于令牌的算法,并详细阐述算法的设计思想及其数据结构。该算法最主要的特点是在分布式互斥中引入了优先级和选举算法的概念,能有效提高进程间的通信效率。With the continual development of network technology,distributed system has been widely researched and used. However,as the network bandwidth of distributed system is limited and the number of critical resources is fixed,so it has great significance to design some distributed mutual exclusion algorithms with network light-loaded and high usage rate of critical resources. Firstly,introduce several traditional mutual exclusion algorithm,as well as compare the performance of various algorithms. Combined with the above analysis,pro-pose a new token-based algorithm and expound the design thought and its data structure. The main feature of this algorithm is the intro-duction of the concept of the priority and the election algorithm in the distributed mutual exclusion,which can effectively improve the effi-ciency of communication between processes.

关 键 词：分布式互斥 令牌 优先级 选举 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]