Answers are grounded in this paper and cite their sources.
A key problem in optimistic replication, namely, using semantic knowledge of objects to resolve concurrent updates from multiple partitions, is addressed. The authors describe how the Coda file system resolves partitioned updates to directories. The central result is that logging of updates is a simple yet efficient and powerful technique for directory resolution in Unix file systems. Measurements show that the time for resolution is typically less than 10% of the time for performing the original set of partitioned updates. Analysis based on file traces indicates that a log size of 2 MB per hour of partition should be ample for typical services.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Kumar et al. (2002) studied this question.
Synapse has enriched 7 closely related papers on similar clinical questions. Consider them for comparative context: