Group mutual exclusion algorithms based on ticket orders

DOI10.1007/3-540-45071-8_25MaRDI QIDQ3082931zbMATH OpenOpenAlexFDO

Authors Masataka Takamura, Yoshihide Igarashi

Publication date 18 March 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45071-8_25

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Fair group mutual exclusion
• Group mutual exclusion in linear time and space
• Asynchronous group mutual exclusion
• Space-efficient FCFS group mutual exclusion
• scientific article; zbMATH DE number 2089981

Cited in

(11)

• Space-efficient FCFS group mutual exclusion
• Group mutual exclusion in linear time and space
• Scalable room synchronizations
• A priority-based distributed group mutual exclusion algorithm when group access is non-uniform
• Speedup of Vidyasankar's algorithm for the group \(k\)-exclusion problem
• scientific article; zbMATH DE number 1728280 (Why is no real title available?)
• Fair group mutual exclusion
• scientific article; zbMATH DE number 2006641 (Why is no real title available?)
• scientific article; zbMATH DE number 2089981 (Why is no real title available?)
• Asynchronous group mutual exclusion
• Local-Spin Group Mutual Exclusion Algorithms

This page was built for publication: Group mutual exclusion algorithms based on ticket orders

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