Progress under bounded fairness

MaRDI QIDQ5137889zbMATH OpenFDO

Authors W. H. Hesselink

Publication date 3 December 2020

Full work available at URL https://link.springer.com/article/10.1007/s004460050066

zbMATH Keywords

bounded fairnessclient-server architectureconcurrent data objectfault-tolerancememory management

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• Bounded fairness
• Stepwise development of fair distributed systems
• Fault-tolerant wait-free shared objects
• Waiting in concurrent algorithms
• scientific article; zbMATH DE number 1059323

Cited in

(6)

• Tournaments for mutual exclusion: verification and concurrent complexity
• Wait-free concurrent memory management by create and read until deletion (CaRuD)
• Bounded fairness
• Liminf progress measures
• Correctness and concurrent complexity of the black-white bakery algorithm
• Adaptive progress: a gracefully-degrading liveness property

This page was built for publication: Progress under bounded fairness

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