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

edit


Stub icon

This computer science article is a stub. You can help Wikipedia by adding missing information.

📚 Artikel Terkait di Wikipedia

Lamport's distributed mutual exclusion algorithm

Naimi–Trehel algorithm Kshemkalyani, A., & Singhal, M. Chapter 9: Distributed Mutual Exclusion Algorithms. Distributed Computing: Principles, Algorithms, and

List of algorithms

algorithm Mutual exclusion Lamport's Distributed Mutual Exclusion Algorithm Naimi-Trehel's log(n) Algorithm Maekawa's Algorithm Raymond's Algorithm Ricart–Agrawala

Ricart–Agrawala algorithm

algorithm Lamport's distributed mutual exclusion algorithm Maekawa's algorithm Suzuki–Kasami algorithm Raymond's algorithm Naimi–Trehel's algorithm Ricart

Raymond's algorithm

algorithm Lamport's bakery algorithm Lamport's distributed mutual exclusion algorithm Maekawa's algorithm Suzuki–Kasami algorithm Naimi–Trehel algorithm