File Synchronization with Vector Time Pairs
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 a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://hdl.handle.net/1721.1/30527 |
| _version_ | 1826193656257708032 |
|---|---|
| author | Cox, Russ Josephson, William |
| author2 | Parallel and Distributed Operating Systems |
| author_facet | Parallel and Distributed Operating Systems Cox, Russ Josephson, William |
| author_sort | Cox, Russ |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T09:42:37Z |
| id | mit-1721.1/30527 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T09:42:37Z |
| publishDate | 2005 |
| record_format | dspace |
| spelling | mit-1721.1/305272019-04-12T08:37:41Z File Synchronization with Vector Time Pairs Cox, Russ Josephson, William Parallel and Distributed Operating Systems 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. 2005-12-22T02:24:58Z 2005-12-22T02:24:58Z 2005-02-28 MIT-CSAIL-TR-2005-014 MIT-LCS-TM-650 http://hdl.handle.net/1721.1/30527 en_US Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory 14 p. 22930099 bytes 909750 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Cox, Russ Josephson, William File Synchronization with Vector Time Pairs |
| title | File Synchronization with Vector Time Pairs |
| title_full | File Synchronization with Vector Time Pairs |
| title_fullStr | File Synchronization with Vector Time Pairs |
| title_full_unstemmed | File Synchronization with Vector Time Pairs |
| title_short | File Synchronization with Vector Time Pairs |
| title_sort | file synchronization with vector time pairs |
| url | http://hdl.handle.net/1721.1/30527 |
| work_keys_str_mv | AT coxruss filesynchronizationwithvectortimepairs AT josephsonwilliam filesynchronizationwithvectortimepairs |