 | This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Naimi–Trehel algorithm" – news · newspapers · books · scholar · JSTOR (May 2022) (Learn how and when to remove this message) |
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.
References
 | This computer science article is a stub. You can help Misplaced Pages by expanding it. |