Performance of a log(n) Distributed Mutual Exclusion Algorithm in case of Non-Equiprobability of Processes Requests
نویسندگان
چکیده
RÉSUMÉ. L’algorithme distribué d’exclusion mutuelle de Naimi-Tréhel est fondé sur une structure dynamique d’arbre enraciné: quand un processusdemande la section critique, il envoie une requête qui chemine jusqu’à la racine de l’arbre, puis il devient la nouvelle racine de l’arbre réorganisé. Quand les demandes des processus sont équiprobables, l’algorithme ne requiert que Hn 1 (de l’ordre de logn) messages en moyenne, n étant le nombre de processus en réseau. Cet article étudie le cas de non-équiprobabilité et montre que le nombre de messages est toujours inférieur àHn 1. De plus, il propose une relation entre la variance de la distribution des probabilités de requête et la complexité de l’algorithme.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملA Token-Based Fair Algorithm for Group Mutual Exclusion in Distributed Systems
The group mutual exclusion (GME) problem is a generalization of the mutual exclusion problem. In group mutual exclusion, a process requests a session before entering its critical section (CS). Processes requesting the same session are allowed to be in their CS simultaneously, however, processes requesting different sessions must execute their CS in mutually exclusive way. The paper presents a t...
متن کاملImplementing Distributed Mutual Exclusion on Multithreaded Environments: The Alien-Threads Approach
We present a simple implementation of a token-based distributed mutual exclusion algorithm for multithreaded systems. Several per-node requests could be issued by threads running at each node. Our algorithm relies on special-purpose alien threads running at host processors on behalf of threads running at other processors. The algorithm uses a tree to route requests for the token. We present a p...
متن کاملA Fair Distributed Mutual Exclusion Algorithm
ÐThis paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N ÿ 1 and 2 N ÿ 1 messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the comput...
متن کاملDistributed Mutual Exclusion Based on Causal Ordering
Problem statement: Causality among events, more formally the causal ordering relation, is a powerful tool for analyzing and drawing inferences about distributed systems. The knowledge of the causal ordering relation between processes helps designers and the system itself solve a variety of problems in distributed systems. In distributed algorithms design, such knowledge helped ensure fairness a...
متن کامل