Sentence examples for mutual exclusion algorithm from inspiring English sources

In this paper, we present a self-stabilizing quorum-based distributed mutual exclusion algorithm.

Since many rules are executing concurrently and they are sharing resources, a mutual exclusion algorithm is necessary.

Lately, many researchers [21 23] have proposed different approaches on how mutual exclusion algorithm can be applied in improving distributed computing systems.

Since the general read-modify-write primitive is a generalization of a variety of atomic primitives that have been implemented in multiprocessor systems, our lower bound holds for all mutual exclusion algorithms that use such primitives.

We establish a lower bound of three on remote reference time complexity for mutual exclusion algorithms in a model where processes communicate by means of a general read-modify-write primitive that accesses at most one shared variable in one instruction.

Weigang Wu et al. [18] proposed a permission-based message efficient mutual exclusion (MUTEX) algorithm for mobile ad hoc networks (MANETs).

Instead of preventing interference between processes using mutual exclusion, lock-free algorithms must ensure correct behaviour in the presence of interference.

This work focuses on self-stabilizing algorithms for mutual exclusion and leader election two fundamental tasks for distributed systems.

The general behavior of the algorithm follows that of Graphplan with mutual exclusion.

We illustrate our algorithm with four case studies: stabilizing mutual exclusion, stabilizing diffusing computation, a data dissemination problem in sensor networks, and tree maintenance.

For a class of Petri nets with uncontrollable transitions, this paper proposes a bottom-up algorithm to transform a given generalized mutual exclusion constraint into an optimal admissible one.