Optimization of Memory Hierarchies in Multiprogrammed Systems
Journal of the ACM (JACM)
Optimizing distributed data bases: a framework for research
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Surveyor's Forum: The File Assignment Problem
ACM Computing Surveys (CSUR)
Some theorems to aid in solving the file allocation problem
Communications of the ACM
An approximation algorithm to the file allocation problem in computer networks
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems
Distributed and Parallel Databases
A Model for Database Allocation Incorporating a Concurrency Control Mechanism
IEEE Transactions on Knowledge and Data Engineering
A queueing network approach to the module allocation problem in distributed systems
SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A critical overview of computer performance evaluation
ICSE '76 Proceedings of the 2nd international conference on Software engineering
IEEE Transactions on Computers
Distributed and Parallel Databases
| Hi-index | 0.02 |
The problem of allocating files in a computer network is a complex combinatorial problem due to the number of integer design parameters involved. These parameters include system cost, number of copies of each file to be stored, and sites at which the copies should be stored. The tradeoffs between these parameters are discussed. The design problem is formulated as an integer programming problem. A branch and bound algorithm is proposed to solve the problem. A linear programming formulation which ignores integer restrictions (and allows a fraction of a file to reside at a site) is shown to yield integer solutions in most cases. In other words integer restrictions are satisfied automatically. A near-optimal heuristic is presented, along with computational results. An efficient method to solve the file allocation problem for medium-scale networks is proposed.