Show simple item record

dc.contributor.authorCox, Russ
dc.contributor.authorJosephson, William
dc.contributor.otherParallel and Distributed Operating Systems
dc.date.accessioned2005-12-22T02:24:58Z
dc.date.available2005-12-22T02:24:58Z
dc.date.issued2005-02-28
dc.identifier.otherMIT-CSAIL-TR-2005-014
dc.identifier.otherMIT-LCS-TM-650
dc.identifier.urihttp://hdl.handle.net/1721.1/30527
dc.description.abstractVector 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.format.extent14 p.
dc.format.extent22930099 bytes
dc.format.extent909750 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.titleFile Synchronization with Vector Time Pairs


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record