Dynamic File Allocation Problems In Distributed Systems


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 7, pp. 1681-1693, Jul. 1997
10.3745/KIPSTE.1997.4.7.1681,   PDF Download:

Abstract

In a distributed system, the simple file allocation problem determines the placement of copies of a file, so as to minimize the operating costs. The simple file allocation problem assumes the cost parameters to be fixed. In practice, these parameters change over time. In this research, dynamic file allocation problem for both single and multiple files are considered, which account for these changing parameters. A model for dynamic file allocation problem is formulated as a mixed integer program for which Lagrangian relaxation based branch-and-bound algorithm is developed. This algorithms is implemented and its efficiency is tested on medium to large test problems.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. P. Kyo, "Dynamic File Allocation Problems In Distributed Systems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 7, pp. 1681-1693, 1997. DOI: 10.3745/KIPSTE.1997.4.7.1681.

[ACM Style]
Seo Pil Kyo. 1997. Dynamic File Allocation Problems In Distributed Systems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 7, (1997), 1681-1693. DOI: 10.3745/KIPSTE.1997.4.7.1681.