Serverless network file systems
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
Approximation algorithms for bin packing: a survey
Approximation algorithms for NP-hard problems
Frangipani: a scalable distributed file system
Proceedings of the sixteenth ACM symposium on Operating systems principles
Online computation and competitive analysis
Online computation and competitive analysis
A large-scale study of file-system contents
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A prototype implementation of archival Intermemory
Proceedings of the fourth ACM conference on Digital libraries
Feasibility of a serverless distributed file system deployed on an existing set of desktop PCs
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
OceanStore: an architecture for global-scale persistent storage
ACM SIGPLAN Notices
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Hi-index | 0.00 |
We examine the replica placement aspect of a distributed peer-to-peer file system that replicates and stores files on ordinary desktop computers. It has been shown that some desktop machines are available for a greater fraction of time than others, and it is crucial not to place all replicas of any file on machines with low availability. In this paper we study the efficacy of three hill-climbing algorithms for file replica placement. Based on large-scale measurements, we assume that the distribution of machine availabilities be uniform. Among other results we show that the MinMax algorithm is competitive, and that for growing replication factor the MinMax and MinRand algorithms have the same asymptotic worst-case efficacy.