Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem

DOI10.4036/IIS.2002.187MaRDI QIDQ4800321zbMATH OpenOpenAlexFDO

Authors Michiko Omori, Kumiko Obokata, Kazuhiro Motegi, Yoshihide Igarashi

Publication date 15 July 2003

Published in Interdisciplinary Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4036/iis.2002.187

zbMATH Keywords

asynchronous processesconcurrent computation

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 1796997
• The \(k\)-bakery, local-spin \(k\)-exclusion using non-atomic reads and writes
• Tight space bounds for \(\ell\)-exclusion
• Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
• A self‐stabilizing token‐based k‐out‐of‐ℓ exclusion algorithm

Cited in

(6)

• Speedup of Vidyasankar's algorithm for the group \(k\)-exclusion problem
• Tight space bounds for -exclusion
• scientific article; zbMATH DE number 1796997 (Why is no real title available?)
• Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
• The \(k\)-bakery, local-spin \(k\)-exclusion using non-atomic reads and writes
• Analysis of quorum-based protocols for distributed (k+1)-exclusion

This page was built for publication: Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4800321)