An algebraic approach to file synchronization

Authors:
Norman Ramsey;El″od Csirmaz
Affiliations:
Division of Engineering and Applied Sciences, Harvard University, Cambridge, ;Mihaly Fazekas Secondary Grammar School, Budapest, Hungary
Venue:
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Year:
2001

Citing 5
Cited 8

Structure-oriented merging of revisions of software documents

SCM '91 Proceedings of the 3rd international workshop on Software configuration management
Operation-based merging

SDE 5 Proceedings of the fifth ACM SIGSOFT symposium on Software development environments
Version models for software configuration management

ACM Computing Surveys (CSUR)
What is a file synchronizer?

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
The IceCube approach to the reconciliation of divergent replicas

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing

Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Optimistic replication

ACM Computing Surveys (CSUR)
Post-partition reconciliation protocols for maintaining consistency

Proceedings of the 2006 ACM symposium on Applied computing
Reconciliation in the APPA P2P System

ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Exploiting schemas in data synchronization

Journal of Computer and System Sciences
Scaling optimistic replication

Future directions in distributed computing
Fixing collaborative edition on typed documents

CDVE'10 Proceedings of the 7th international conference on Cooperative design, visualization, and engineering
Exploiting schemas in data synchronization

DBPL'05 Proceedings of the 10th international conference on Database Programming Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

A file synchronizer restores consistency after multiple replicas of a filesystem have been changed independently. We present an algebra for reasoning about operations on filesystems and show that it is sound and complete with respect to a simple model. The algebra enables us to specify a file-synchronization algorithm that can be combined with several different conflict-resolution policies. By contrast, previous work builds the conflict-resolution policy into the specification, or worse, does not specify the synchronizer's behavior precisely. We classify synchronizers by asking whether conflicts can be resolved at a single disconnected replica and whether all replicas are identical after synchronization. We also discuss timestamps and argue that there is no good way to propagate timestamps when there is severe clock skew between replicas.