Speedup of Vidyasankar's algorithm for the group k-exclusion problem

DOI10.1016/J.IPL.2004.03.012MaRDI QIDQ2390288zbMATH OpenOpenAlexFDO

Authors Masataka Takamura, Yoshihide Igarashi, Tom Altman

Publication date 21 July 2009

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2004.03.012

zbMATH Keywords

\(k\)-exclusiondistributed computinggroup mutual exclusionlockout avoidancemutual exclusionshared memory

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
• Group mutual exclusion algorithms based on ticket orders
• scientific article; zbMATH DE number 1796997
• Group mutual exclusion in linear time and space
• A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

Cites work

• A simple group mutual \(l\)-exclusion algorithm.
• Analysis of Some Lockout Avoidance Algorithms for the k-Exclusion Problem
• Asynchronous group mutual exclusion
• Group mutual exclusion algorithms based on ticket orders
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Myths about the mutual exclusion problem

This page was built for publication: Speedup of Vidyasankar's algorithm for the group \(k\)-exclusion problem

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