On the correctness of orphan management algorithms

DOI10.1145/146585.146616MaRDI QIDQ4302795zbMATH OpenOpenAlexFDO

Authors Michael Merritt, William E. Weihl, Maurice Herlihy, Nancy Lynch

Publication date 21 August 1994

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/146585.146616

zbMATH Keywords

correctnessdistributed systemdistributed-computingorphan computationsorphan management algorithms

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Efficient detection and resolution of OR deadlocks in distributed systems
• scientific article; zbMATH DE number 4100502
• scientific article; zbMATH DE number 3883614
• Robust algorithms: a different approach to oracles
• On the optimality of randomized deadlock avoidance policies
• Stable and fault-tolerant object allocation
• scientific article; zbMATH DE number 4133475
• The correctness proof of Ben-Or's randomized consensus algorithm

Cited in

(2)

• Multi-granularity locking for nested transactions: A proof using a possibilities mapping
• Verifying atomic data types

This page was built for publication: On the correctness of orphan management algorithms

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