An O(√n) Distributed Mutual Exclusion Algorithm Using Queue Migration
Дата
Авторы
Chaudhuri,Pranay
Edward,Thomas
Journal Title
Journal ISSN
Volume Title
Издатель
Journal of Universal Computer Science
Аннотация
Описание
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.
Ключевые слова
mutual exclusion , critical section , distributed algorithm , computer network , queue migration , message complexity