Paper Info
Title
Distributed Groups Mutual Exclusion Based on Clients/Servers Model
Abstract
In this paper we present a new distributed group mutual exclusion (DGME) based on clients/servers model, and uses a dynamic data structures. Several processes (clients) can access simultaneously to a same opened session (server). The algorithm ensures that, at any time, at most one session is opened, and any requested session will be opened in a finite time. The number of messages is between 0 and m, where m is the number of session in the network. In the average case, O(Log(m)) messages are necessary to open a session. The maximum concurrency is n, where n is the number of processes in the network
Year
DOI
Venue
2006
10.1109/PDCAT.2006.57
Taipei
Keywords
Field
DocType
servers model,dynamic data structure,groupmutual exclusion,groups mutual exclusion,requested session,average case,maximum concurrency,finite time,client server,data structures,concurrency control
Concurrency,Computer science,Server,Computer network,Real-time computing,Distributed computing,Client–server model,Data structure,Concurrency control,Session ID,Inter-process communication,Mutual exclusion,Operating system
Conference
ISBN
Citations 
PageRank 
0-7695-2736-1
0
0.34
References 
Authors
5
3
Name
Order
Citations
PageRank
Ousmane Thiare1115.75
Mourad Gueroui2443.98
Mohamed Naimi319616.15