ACM Home Page
Please provide us with feedback. Feedback
An algebraic approach to file synchronization
Full text PdfPdf (302 KB)
Source Foundations of Software Engineering archive
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering table of contents
Vienna, Austria
Session: Verification table of contents
Pages: 175 - 185  
Year of Publication: 2001
ISBN:1-58113-390-1
Also published in ...
Authors
Norman Ramsey  Division of Engineering and Applied Sciences, Harvard University, Cambridge,
El″od Csirmaz  Mihaly Fazekas Secondary Grammar School, Budapest, Hungary
Sponsors
SIGSOFT: ACM Special Interest Group on Software Engineering
CEPIS : Council of European Professional Informatics Societies
VIENUT : Vienna University of Technology
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 38,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/503209.503233
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Broder, Andrei. 1993. Some applications of Rabin's fingerprinting method. In Capocelli, R.,A. De Santis, and U. Vaccaro, editors, Sequences II: Methods in Communications, Security, and Computer Science, pages 143-152. Springer-Verlag.
3
 
4
Cox, Russ and William Josephson. 2001 (January). Communication timestamps for file system synchronization. Technical Report 01-01, Computer Science, Harvard University.
 
5
Fidge, Colin J. 1988 (February). Timestamps in messagepassing systems that preserve the partial ordering. Australian Computer Science Communications, 10(1).
 
6
Howard, John H. 1999. Reconcile user's guide. Technical Report TR99-14, Mitsubishi Electronics Research Lab.
7
8
 
9
Mattern, Friedemann. 1989. Virtual time and global states of distributed systems. In Cosnard, Michel, Yves Robert, Patrice Quinton, and Michel Raynal, editors, Parallel and Distributed Algorithms, pages 215-226. Amsterdam: Elsevier Science Publishers B. V. (North Holland).
 
10
Microsoft. 1998. Microsoft Windows 95: Vision for mobile computing. http://www.microsoft.com/windows95/ info/w95mobile.htm.
 
11
Puma. Designing effective synchronization solutions: A White Paper on Synchronization from Puma Technology. http://www.pumatech.com/syncwp.html.
 
12
___. A white paper on DSXtm Technology - Data Synchronization Extensions from Puma Technology. http://www.pumatech.com/dsxwp.html.
 
13
Reiher, P., J. Popek, M. Gunter, J. Salomone, and D. Ratner. 1996 (June). Peer-to-peer reconciliation based replication for mobile computers. In European Conference on Object Oriented Programming '96 Second Workshop on Mobility and Replication.
 
14
Schwartz, Stu. 1996 (May). The Briefcase|in brief. Windows 95 Professional. http://www.cobb.com/w9p/ 9605/w9p9651.htm.
 
15
Thompson, Ken. 1995. The Plan 9 file server. In Plan 9: The Documents, pages 313-320. Murray Hill, New Jersey: Computing Sciences Research Center, AT&T Bell Laboratories.
16


Collaborative Colleagues:
Norman Ramsey: colleagues
El″od Csirmaz: colleagues