Distributed Groups Mutual Exclusion Based on Clients/Servers Model

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Thiare, O., Gueroui, M., Naimi, M.
Format: Conference Proceeding
Language:English
Subjects:
Clocks
Computer science
Concurrent computing
Data structures
Delay
Distributed algorithms
Message passing
Network servers
Permission
Synchronization
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
ISSN:2379-5352
DOI:10.1109/PDCAT.2006.57