Bounds for mutual exclusion with only processor consistency

DOI10.1007/3-540-40026-5_3MaRDI QIDQ2766860zbMATH OpenFDO

Authors Lisa Higham, Jalal Kawash

Publication date 28 January 2002

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

Full work available at URL https://doi.org/10.1007/3-540-40026-5_3

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Bounds on shared memory for mutual exclusion
• Resilience of mutual exclusion algorithms to transient memory faults
• scientific article; zbMATH DE number 2086790
• Time bounds for mutual exclusion and related problems
• A queue based mutual exclusion algorithm

Cited in

(8)

• Bounds on shared memory for mutual exclusion
• Resilience of mutual exclusion algorithms to transient memory faults
• Multiwriter consistency conditions for shared memory registers
• Implementing sequentially consistent programs on processor consistent platforms
• scientific article; zbMATH DE number 2086790 (Why is no real title available?)
• Hundreds of impossibility results for distributed computing
• Multi-writer consistency conditions for shared memory objects
• Nonatomic dual bakery algorithm with bounded tokens

This page was built for publication: Bounds for mutual exclusion with only processor consistency

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