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
Optimal program and data locations in computer networks
Communications of the ACM
Data base decomposition in a hierarchical computer system
SIGMOD '75 Proceedings of the 1975 ACM SIGMOD international conference on Management of data
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Organizing distributed data bases in computer networks.
Organizing distributed data bases in computer networks.
Fast object partitioning using Stochastic learning automata
SIGIR '87 Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval
Deterministic Learning Automata Solutions to the Equipartitioning Problem
IEEE Transactions on Computers
File Allocation in Distributed Databases with Interaction between Files
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
A Model and Decision Procedure for Data Storage in Cloud Computing
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
| Hi-index | 0.00 |
A file allocation problem in a hierarchical distributed computer network is examined. It is shown that the problem is NP-hard. An approximation algorithm is suggested. It is estimated that the approximation algorithm has a high chance of obtaining the optimal solution. Experimental results show that the difference between the optimal solution and the solution generated by the approximation algorithm is no more than 4% away from the optimal solution.