Learn More
In this paper, we present a distributed algorithm for mutual exclusion based on path reversal. The algorithm does not use logical clocks to serialize the concurrent events, and all the variables are bounded. When a process invokes a critical section, it sends a request to the tail of a queue. A dynamical rooted tree gives the path to this tail. The(More)
This paper presents a new load sharing method for workstation networks in a UNIX environment. We know that the global computing power is most of the time much underutilized in this kind of networks. Our goal is to share the load among the different processors. Usually, load sharing algorithms are based on the fact that information and decision of(More)
The Naimi-Tréhel distributed mutual exclusion algorithm is based on a dynamic rooted tree: when a process requests the critical section, it sends a request that eventually reaches the root and becomes the new root in the reorganized tree. When the processes requests are equiprobabilistic, the algorithm requires only H n?1 messages (order of log n) on(More)
This paper presents a new load sharing method based on process initiative. The method can be applied either for individual processes in networks of workstations or for parallel computation. We know that the global computing power is most of the time much underutilized. Our goal is to share the load among the diierent processors. Usually, load sharing(More)
  • 1