By Topic

Bounded dynamic data allocation in distributed systems

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
$33 $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)
O. E. Theel ; Campus Univ. de Beaulieu, INRIA/IRISA, Rennes, France ; H. Pagnia

Recently, an interesting dynamic data allocation algorithm for the management of replicated data in distributed systems has been presented by Wolfson and Jajodia. We analyze this approach from cost as well as from availability perspectives and suggest an improved algorithm that exhibits superior characteristics. Our approach establishes lower and upper bounds in the number of replicas for guaranteeing minimal availability properties and for restricting operation costs. It additionally exploits an improved replica management that abandons the read-one/write-all approach for all replicas as well as the central server concept used by the original approach, thereby presenting a truly distributed solution. Analyses show that the improved algorithm is superior in terms of costs and availability assuming any reasonable workload

Published in:

High Performance Computing, 1996. Proceedings. 3rd International Conference on

Date of Conference:

19-22 Dec 1996