| dc.contributor.author |
Cox, Russ |
|
| dc.contributor.author |
Josephson, William |
|
| dc.contributor.other |
Parallel and Distributed Operating Systems |
|
| dc.date.accessioned |
2005-12-22T02:24:58Z |
|
| dc.date.available |
2005-12-22T02:24:58Z |
|
| dc.date.issued |
2005-02-28 |
|
| dc.identifier.other |
MIT-CSAIL-TR-2005-014 |
|
| dc.identifier.other |
MIT-LCS-TM-650 |
|
| dc.identifier.uri |
http://hdl.handle.net/1721.1/30527 |
|
| dc.description.abstract |
Vector time pairs are a new method for trackingsynchronization metadata. A vector time pairconsists of two vector times: one tracking filemodification history and one tracking filesynchronization history. Because the vectortimes are maintained separately and used fordifferent purposes, different algorithms andoptimizations can be applied to each. As aresult, vector time pairs impose no restrictionon synchronization patterns, never falsely detectconflicts, require no space to store deletionnotices, require network bandwidth proportionalonly to the number of files changed, and supportpartial synchronizations. No other currentsynchronization method has all these properties.Results from an implementation of vector timepairs in a new user-level file synchronizercalled Tra confirm the benefits of vectortime pairs. |
|
| dc.description.provenance |
Made available in DSpace on 2005-12-22T02:24:58Z (GMT). No. of bitstreams: 2
MIT-CSAIL-TR-2005-014.ps: 22930099 bytes, checksum: 40a6255dcc885b08e6c5e9dd20394a11 (MD5)
MIT-CSAIL-TR-2005-014.pdf: 909750 bytes, checksum: 8a736c0840f0c2edb4a064ed63a4000d (MD5) |
en |
| dc.format.extent |
14 p. |
|
| dc.format.extent |
22930099 bytes |
|
| dc.format.extent |
909750 bytes |
|
| dc.format.mimetype |
application/postscript |
|
| dc.format.mimetype |
application/pdf |
|
| dc.language.iso |
en_US |
|
| dc.relation.ispartofseries |
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory |
|
| dc.title |
File Synchronization with Vector Time Pairs |
|
