QoS-enabled distributed mutual exclusion in public clouds
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part II
Modified raymond's algorithm for priority (MRA-P) based mutual exclusion in distributed systems
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Service Level Agreement for Distributed Mutual Exclusion in Cloud Computing
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
A New Link Failure Resilient Priority Based Fair Mutual Exclusion Algorithm for Distributed Systems
Journal of Network and Systems Management
| Hi-index | 0.00 |
Abstract: Sites with the same priority are gathered in the same group. Communication inside a group is organized in a logical rooted tree structure. The tree's root is the site that last held the token. This organization is similar to that of Raymond's algorithm. For its external communications, a group resorts to an external supplementary element: a router. This router manages external communications. The communication protocol between routers is similar to that of Ricart_Agrawala. Priority between routers is carried out by a comparison mechanism. When it receives a permission request from a router having priority, a router temporarily suspends the request execution of its global waiting queue.