摘要
主要介绍了一种分布式互斥算法的改进方案。首先简要介绍了基于权标的常规算法 ,然后提出了优先级组算法的另一种方案 ,并详细阐述算法的设计思想及其数据结构。本算法最主要的特点是在分布式互斥中引入了优先级和树的概念 。
A method for resolving the problem of distributed mutual exclusion is proposed. After introducing normal algorithms based on token in brief, another algorithm based on priority group and data structure is put forward, which introduces the concept of priority and tree structure into distributed mutual exclusion, and combines Raymonds algorithm and Ricart Agrawala together efficiently.
出处
《计算机应用》
CSCD
北大核心
2003年第3期9-12,共4页
journal of Computer Applications