DocumentCode :
3165990
Title :
Low storage cost, partition-tolerant dynamic algorithms for replicated file systems
Author :
Hu, Ping ; Wilbur, Steve
Author_Institution :
Dept. of Comput. Sci., Univ. Coll. London, UK
fYear :
1992
fDate :
4-8 May 1992
Firstpage :
89
Lastpage :
94
Abstract :
Two algorithms are given for maintaining the consistency of replicated files. One is called dynamic supporting; the other is an extension of dynamic supporting called dynamic supporting with a greatest copy. The algorithms are hybrids of some existing algorithms. The correctness of these two algorithms is proved. Since replicas and votes are conceptually separated, the algorithms can achieve very good performance while still keeping storage costs very low. The proposed algorithms make no further assumptions about the distributed environment than conventional voting algorithms, so they can even tolerate network partition failures.<>
Keywords :
data integrity; distributed databases; parallel algorithms; conventional voting algorithms; correctness; distributed environment; dynamic supporting; network partition failures; replicated files; storage costs; Computer networks; Computer science; Costs; Distributed computing; Educational institutions; File systems; Heuristic algorithms; Logic; Partitioning algorithms; Voting;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
CompEuro '92 . 'Computer Systems and Software Engineering',Proceedings.
Conference_Location :
The Hague, Netherlands
Print_ISBN :
0-8186-2760-3
Type :
conf
DOI :
10.1109/CMPEUR.1992.218481
Filename :
218481
Link To Document :
بازگشت