文章基本信息

标题：An O(√n) Distributed Mutual Exclusion Algorithm Using Queue Migration
本地全文：下载
作者：P. Chaudhuri, T. Edward
期刊名称：Journal of Universal Computer Science
印刷版ISSN：0948-6968
出版年度：2006
卷号：12
期号：2
页码：140-140
出版社：Graz University of Technology and Know-Center
摘要：In this paper a distributed algorithm is proposed that realises mutual exclusion among n nodes in a computer network. There is no common or global memory shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The proposed algorithm is based on queue migration and achieves a message complexity of O(√n) per mutual exclusion invocation. Under heavy load, the number of required messages approaches 2 per mutual exclusion.
关键词：computer network, critical section, distributed algorithm, message complexity, mutual exclusion, queue migration