Jump to content

Naimi–Trehel algorithm

Edit links
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Frap (talk | contribs) at 12:36, 30 June 2023. The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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 expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Naimi–Trehel_algorithm&oldid=1162660025"