Optimum reorganization points for linearly growing files
ACM Transactions on Database Systems (TODS)
A dynamic database reorganization algorithm
ACM Transactions on Database Systems (TODS)
Optimal program and data locations in computer networks
Communications of the ACM
Optimum data base reorganization points
Communications of the ACM
Index selection in a self-adaptive data base management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Optimal File Allocation in a Multiple Computer System
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
Self-adaptive automatic data base design
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
Optimizing distributed data bases: a framework for research
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
| Hi-index | 0.00 |
This paper reports the study of an adaptive strategy for allocating programs and data files in computer networks when only imperfect information on access request rates is available. The adaptive system is based on a set of computer procedures to collect access statistics, to estimate frequencies, to find optimal file assignment based on expected improvements in performance, and to redistribute the files over the network nodes. These computer modules are synchronized with each other in order to predict the best assignment policy on the basis of where access requests are expected to arise in the future; and as new information becomes available, the forecast is revised and the assignment policy adapts itself to the new information. Transition costs incurred by file transmission from one node to another are taken into account, and the decision to reassign files is triggered only when net gains can be realized. The paper also points out the departure from optimality due to the complexity of a multistage self-adapting system. Accordingly, a second-best solution is suggested.