loading...
Distributed Groups Mutual Exclusion Based on Clients/Servers Model
Taipei, Taiwan December 04-December 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2006.57Seventh International Conference on P ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Ousmane Thiare, Mourad Gueroui, Mohamed NAIMI, "Distributed Groups Mutual Exclusion Based on Clients/Servers Model," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 67-73, Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2006.57,
author = {Ousmane Thiare and Mourad Gueroui and Mohamed NAIMI},
title = {Distributed Groups Mutual Exclusion Based on Clients/Servers Model},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2006},
isbn = {0-7695-2736-1},
pages = {67-73},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2006.57},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - Distributed Groups Mutual Exclusion Based on Clients/Servers Model
SN - 0-7695-2736-1
SP67
EP73
A1 - Ousmane Thiare,
A1 - Mourad Gueroui,
A1 - Mohamed NAIMI,
PY - 2006
KW - null
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
Ousmane Thiare, University of Cergy-Pontoise, France
Mourad Gueroui, PRISM Lab, France
Mohamed NAIMI, University of Cergy-Pontoise, France
In this paper we present a new Distributed GroupMutual 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.
Citation:
Ousmane Thiare, Mourad Gueroui, Mohamed NAIMI, "Distributed Groups Mutual Exclusion Based on Clients/Servers Model," pdcat, pp.67-73, Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.