A new solution to the concurrent programming control (mutual exclusion) problem that is immune to process failures and restarts is presented. The algorithm uses just four values of shared memory per process, which is within one value of the known lower bound. The algorithm is implemented using two binary variables that make it immune to read errors occurring during writes, that is, "flickering bits."
No takes yet. Share an insight, caveat, or question.
Gary L. Peterson (1983) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: