基于读写特征的分布式互斥算法  

A Distributed Mutual Exclusion Algorithm Based on Read/Write Character

作　　者：刘丹[1] 刘心松[1] 丘志杰[1] 邱元杰[1] 

机构地区：[1]电子科技大学8010研究室,四川成都610054

出　　处：《电子学报》2004年第2期326-329,共4页Acta Electronica Sinica

基　　金：四川省科技攻关项目 (No .0 2GG0 0 6 0 1 8)

摘　　要：在LK算法基础上 ,提出一种对读写请求作不同互斥处理的分布式互斥算法———RWME(read/writemu tualexclusion)算法 .在同步延迟仍为T的前提下 ,降低了传统非令牌类型互斥算法的消息复杂度 .在Lamport全局时戳的基础上 ,定义了适合于读写互斥的全局时戳———读写时戳 ,并由其来保证各读写进程互斥访问临界区的公平性和正确性 .通过对算法的性能分析验证其是高效的 。Based on LK algorithm,a distributed mutual exclusion algorithm-read/write mutual exclusion (RWME) algorithm is presented.It puts different mutual exclusion operations for reading request and writing request.The algorithm belongs to nontoken based type.It saves the message complexity and still has T synchronization delay.A read/write globe clock stamp which based on Lamport clock stamp is defined for the read/write mutual operations.Using the read/write globe clock stamp,reading and writing requests can access critical sections with fairness and freedom from deadlock or starvation.Proved by performance analysis,the algorithm has high performance.A correctness proof is provided.

关 键 词：RWME算法 分布式互斥 读写时戳 消息复杂度 

分 类 号：TP316.4[自动化与计算机技术—计算机软件与理论]