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)
Optimal program and data locations in computer networks
Communications of the ACM
Some theorems to aid in solving the file allocation problem
Communications of the ACM
Data base design: object distribution and resource-constrained task scheduling.
Data base design: object distribution and resource-constrained task scheduling.
Organizing distributed data bases in computer networks.
Organizing distributed data bases in computer networks.
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
Distributing a Data Base with Logical Associations on a Computer Network for Parallel Searching
IEEE Transactions on Software Engineering
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
IEEE Transactions on Software Engineering
Optimization of the Number of Copies in a Distributed Data Base
IEEE Transactions on Software Engineering
Algorithms to Distribute a Database for Parallel Searching
IEEE Transactions on Software Engineering
Allocation of copies of a file in an information network
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
Location of computers and multiple files in distributed computer systems
Mathematical and Computer Modelling: An International Journal
| Hi-index | 14.99 |
In this paper, we show that the simple file allocation problem in computer science is isomorphic to the single commodity warehouse location problem in operations research. In simple file allocation, costs due to query and update accesses and storage are considered. Design requirements such as reliability, availability, and delay are not taken into account. Due to this isomorphism, many techniques which have been developed for the warehouse location problem can be applied to solve the simple file allocation problem. Furthermore, there are techniques and conditions developed for one problem which match closely with techniques and conditions developed for the other problem. Based on a combined set of conditions developed in computer science and operations research, a heuristic for file allocation is presented.