Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Database Location in Computer Networks
Journal of the ACM (JACM)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Optimal program and data locations in computer networks
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Isomorphism of Simple File Allocation
IEEE Transactions on Computers
File Allocation in a Distributed Computer Communication Network
IEEE Transactions on Computers
IEEE Transactions on Computers
Optimal File Allocation in a Multiple Computer System
IEEE Transactions on Computers
Optimal Design of Distributed Information Systems
IEEE Transactions on Computers
Allocation of copies of a file in an information network
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Design of tree networks for distributed data
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
Hi-index | 0.98 |
Advances in computer and communications technology have led to increased use of distributed computer systems which utilize communications channels to interconnect geographically separated users, computer facilities, and data files into integrated information networks. In designing and controlling such a system, one must decide on the number and location of computer facilities, the allocation of multiple data files to facilities, and the user access paths to the data files. A mixed-integer programming formulation and dual-based solution procedure for this problem are described, and the results of computational experiments with realistic-sized problems are reported. Optimal solutions for problems with approximately 2,000 integer decision variables and 76,000 continuous decision variables are found in less than 30 CPU seconds, demonstrating the large-scale capability of the model and algorithm. The problem formulation generalizes Casey's File Allocation Problem to include the location of multiple files and computer facilities in a single planning model.