Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An interface to support lazy replicated file service

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Duchamp, D. ; Dept. of Comput. Sci., Columbia Univ., New York, NY, USA ; Tait, C.D.

The authors argue that, if they are going to assume low-sharing workloads, then it is possible to build more efficient implementations that provide the same (or stronger) semantics by making fullest use of the assumption. Accordingly, they take an extreme point on the spreading/searching tradeoff: the searcher is made responsible for all the work. Thus, spreading can be made asynchronous and hence very fast from the caller's viewpoint. They employ an important optimization to eliminate most of the searching work when there is little sharing. Their technique carries other advantages as well: simple and flexible recovery algorithms, and suitability for mobile computing

Published in:

Management of Replicated Data, 1992., Second Workshop on the

Date of Conference:

12-13 Nov 1992