|
|
|
|
An O(√n) Distributed Mutual Exclusion Algorithm Using Queue Migration
|
|
|
|
|
|
|
|
نویسنده
|
Chaudhuri Pranay ,Edward Thomas
|
|
منبع
|
journal of universal computer science - 2006 - دوره : 12 - شماره : 2 - صفحه:140 -159
|
|
چکیده
|
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
|
|
آدرس
|
University of the West Indies, Barbados, University of the West Indies, Barbados
|
|
پست الکترونیکی
|
tedward@uwichill.edu.bb
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|