What is a file synchronizer?

Nloblle computing devices intended for disconnected operation, such as laptops and personal organizers, must employ optimistic replication strategi~ for user files. Unlike traditional distributed systems. such devices do not attempt to present a “single filesystem” semanti~ users are aware that their fles are replicated, and that updates to one rephca till not be seen in another until some point of synchronization is reached (often under the user’s exphcit control). A variety of tools, collectively called file synchronizers, support this mode of operation. Unfortunately, present-day synchronizers seldom give the user enough information to predict how they will behave under all circumstances. Simple slogans fike “Non-confecting updates are propagated to other replicas” ignore numerous subtletim—e.g., Precisely what constitutes a confict be @een updates in different replicas? What does the synchronizer do if updatw confict? What happens when fles are renamed? What if the directory structure is reorganized in one replica? Our god is to offer a simple, concrete, and precise frame work for describing the behavior of file synchronizers. To this end, n?edivide the synchronization task into two conceptually distinct phasm update detection and Reconciliation. We dEcuss each phase in detail and develop a straightforn’ard specification of each. We sketch our on prototype implementation of these specifications and discuss how they apply to some existing synchronization tools.

[1]  Michael J. Fischer,et al.  Sacrificing serializability to attain high availability of data in an unreliable network , 1982, PODS.

[2]  Susan B. Davidson,et al.  Optimism and consistency in partitioned distributed database systems , 1984, TODS.

[3]  Hector Garcia-Molina,et al.  Consistency in a partitioned network: a survey , 1985, CSUR.

[4]  Gerald J. Popek,et al.  Consistency algorithms for optimistic replication , 1993, 1993 International Conference on Network Protocols.

[5]  Peter Honeyman,et al.  Disconnected Operation for AFS , 1993, Symposium on Mobile and Location-Independent Computing.

[6]  M. Theimer,et al.  The Bayou Architecture: support for data sharing among mobile users , 1994, Workshop on Mobile Computing Systems and Applications.

[7]  Marvin Theimer,et al.  The Bayou Architecture: Support for Data Sharing Among Mobile Users , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[8]  Murray S. Mazer,et al.  A Client-Side-Only Approach to Disconnected File Access , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[9]  Dean Daniels,et al.  Oracle's symmetric replication technology and implications for application design , 1994, SIGMOD '94.

[10]  John S. Heidemann,et al.  Resolving File Conflicts in the Ficus File System , 1994, USENIX Summer.

[11]  Puneet Kumar,et al.  Mitigating the Effects of Optimistic Replication in a Distributed File System , 1994 .

[12]  James J. Kistler Disconnected Operation in a Distributed File System , 1995, Lecture Notes in Computer Science.

[13]  Marvin Theimer,et al.  Managing update conflicts in Bayou, a weakly connected replicated storage system , 1995, SOSP.

[14]  Peter Reiher,et al.  Peer-to-Peer Reconciliation Based Replication for Mobile Computers , 1996 .

[15]  Marvin Theimer,et al.  Flexible update propagation for weakly consistent replication , 1997, SOSP.

[16]  Peter Reiher,et al.  Perspectives on optimistically replicated, peer‐to‐peer filing , 1998 .

[17]  Ashish Goel,et al.  Perspectives on optimistically replicated, peer‐to‐peer filing , 1998, Softw. Pract. Exp..