Some theorems to aid in solving the file allocation problem
- 1 November 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (11), 878-882
- https://doi.org/10.1145/359863.359895
Abstract
The file allocation problem — i.e. the problem of finding the optimal set of network sites at which to locate copies of a file — is known to be, in general, polynomial complete. Heuristics and other aids to finding optimal, or near-optimal, solutions are therefore much needed. In this paper we present three theorems which can be applied a priori to indicate that certain sites should (or should not) be included in an optimal allocation.Keywords
This publication has 1 reference indexed in Scilit:
- File allocation in distributed systemsPublished by Association for Computing Machinery (ACM) ,1976