Answers are grounded in this paper and cite their sources.
This paper describes the design of a scheme to manage updates to a file replicated over a number of UNIX systems. An implementation is described elsewhere. The algorithm prohibits simultaneous updates and maintains a weak consistency between copies. It uses the traditional lock/update/unlock approach but requires only that a majority of the total number of copies of a file be available to process an update.
No takes yet. Share an insight, caveat, or question.
O. Pearl Brereton (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: