Andrew: a distributed personal computing environment
Communications of the ACM - The MIT Press scientific computation series
Performance of the V storage server: a preliminary report
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
A trace-driven analysis of the UNIX 4.2 BSD file system
Proceedings of the tenth ACM symposium on Operating systems principles
Regeneration of Replicated Objects: A Technique and Its Eden Implementation
Proceedings of the Second International Conference on Data Engineering
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
LOCUS a network transparent, high reliability distributed system
SOSP '81 Proceedings of the eighth ACM symposium on Operating systems principles
File migration in distributed computer systems
File migration in distributed computer systems
File replication in distributed systems (performance analysis, site recovery)
File replication in distributed systems (performance analysis, site recovery)
Encyclopedia of Computer Science
| Hi-index | 0.00 |
In distributed systems the efficiency of the network file system is a key performance issue. Replication of files and directories can enhance file system efficiency, but the choice of replication techniques is crucial. This paper studies a number of replication techniques, including remote access, prereplication, weighted voting, and two demand replication schemes: polling and staling. It develops a Markov chain model, which is capable of characterizing properties of file access sequences, including access locality and access bias. The paper compares the replication techniques under three different network file system architectures. The results show that, under reasonable assumptions, demand replication requires fewer file transfers than remote access, especially for files that have a high degree of access locality. Among the demand replication schemes, staling requires fewer auxiliary messages than polling.