DocumentCode :
3438575
Title :
Bounded dynamic data allocation in distributed systems
Author :
Theel, Oliver E. ; Pagnia, Henning
Author_Institution :
Campus Univ. de Beaulieu, INRIA/IRISA, Rennes, France
fYear :
1996
fDate :
19-22 Dec 1996
Firstpage :
126
Lastpage :
131
Abstract :
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
Keywords :
distributed databases; replicated databases; bounded; distributed systems; dynamic data allocation; replicated data; Access protocols; Algorithm design and analysis; Availability; Computer crashes; Computer science; Contracts; Costs; Failure analysis; Runtime; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Performance Computing, 1996. Proceedings. 3rd International Conference on
Conference_Location :
Trivandrum
Print_ISBN :
0-8186-7557-8
Type :
conf
DOI :
10.1109/HIPC.1996.565810
Filename :
565810
Link To Document :
بازگشت