The Naimi–Trehel algorithm is an algorithm for achieving mutual exclusion in a distributed system.Unlike Lamport's distributed mutual exclusion algorithm and its related version, this algorithm does not use logical clocks.This method requires only O(log(number of processes in the network)) messages on average.When a process invokes a critical section, it sends a request to a queue at a particular processor which is specified by a path built by the algorithm as it runs.