A Quorum-Based Distributed Algorithm for Group Mutual Exclusion

摘要：

The group mutual exclusion problem is a variant of mutual exclusion problem in a sense that only the same group of processes can enter their critical section simultaneously.In this paper, we propose a quorum-based distributed algorithm for the group mutual exclusion problem in asynchronous message passing distributed systems. The message complexity of our algorithm is O(|Q|) in the best case and O(n|Q|) in the worst case, where |Q| is a quorum size that the algorithm adopts, and n is the number of processes that make requests for resources.

作者: Mie Toyomura Sayaka Kamei Hirotsugu Kakugawa

作者单位: Hiroshima University, Japan

会议类型: 国际会议

会议名称: Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)

会议地点: 成都

会议语种:英文

页码: 742-746

在线出版日期: 2003-08-27（万方平台首次上网日期，不代表论文的发表时间）