A Dynamic Optimization Model for Distributed Databases

Autor:	K. Dan Levin, Howard L. Morgan
Rok vydání:	1978
Předmět:	Dynamic programming Theoretical computer science Distributed database Computer science Distributed computing State space Limit (mathematics) Management Science and Operations Research Computer Science Applications
Zdroj:	Operations Research. 26:824-835
ISSN:	1526-5463 0030-364X
DOI:	10.1287/opre.26.5.824
Popis:	We present a dynamic programming formulation for solving the problem of locating files in heterogeneous, distributed computer networks. The model presented permits the access rates for information from files to vary over time, takes into account the fact that programs accessing files may only be permitted at certain nodes, and solves this general T-period problem. Special features are used to limit the growth of the state space so that a computationally feasible algorithm results. Finally, we present an example to illustrate the use of the algorithm.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::19713cdced85e47dd4a9123e34d3a1fc https://doi.org/10.1287/opre.26.5.824 Zobrazit plný text záznamu Plný text ve formátu PDF