Local-spin algorithms for variants of mutual exclusion using read and write operations

Mutual exclusion (ME) is used to coordinate access to shared resources by concurrent\nprocesses. We investigate several new N-process shared-memory algorithms for variants\nof ME, each of which uses only reads and writes, and is local-spin, i.e., has bounded\nremote memory reference (RMR) complexity. We study these algorithms under two\ndifferent shared-memory models: the distributed shared-memory (DSM) model, and the\ncache-coherent (CC) model. In particular, we present the first known algorithm for first-\ncome-first-served (FCFS) ME that has O(log N) RMR complexity in both the DSM and\nCC models, and uses only atomic reads and writes. Our algorithm is also adaptive to\npoint contention, i.e., the number of processes that are simultaneously active during a\npassage by some process. More precisely, the number of RMRs a process makes per\npassage in our algorithm is \\Theta(min(c, log N)), where c is the point contention. We also\npresent the first known FCFS abortable ME algorithm that is local-spin and uses only\natomic reads and writes. This algorithm has O(N) RMR complexity in both the DSM\nand CC models, and is in the form of a transformation from abortable ME to FCFS\nabortable ME. In conjunction with other results, this transformation also yields the\nfirst known local-spin group mutual exclusion algorithm that uses only atomic reads\nand writes. Additionally, we present the first known local-spin k-exclusion algorithms\nthat use only atomic reads and writes and tolerate up to k − 1 crash failures. These algorithms have RMR complexity O(N) in both the DSM and CC models. The simplest\nof these algorithms satisfies a new fairness property, called k-FCFS, that generalizes the\nFCFS fairness property for ME algorithms. A modification of this algorithm satisfies the\nstronger first-in-first-enabled (FIFE) fairness property. Finally, we present a modification\nto the FIFE k-exclusion algorithm that works with non-atomic reads and writes. The\nhigh-level structure of all our k-exclusion algorithms is inspired by Lamport’s famous\nBakery algorithm.

Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.