Long Term File Migration,Part II:File Replacement Algorithms.

摘要

The steady increase in the power and complexity of modern computer systems has encouraged the implementation of automatic file migration systems,which move files dynamically between mass storage devices and disk in response to user reference patterns. From information describing thirteen months of text editor data set file references (analyzed in detail in the first part of this paper),algorithms for the selection of files to be moved from disk to mass storage are developed and evaluated. Algorithms based on both the file size and the time since the file was last used work well. The best realizable algorithms tested condition on the empirical distribution of the times between file references. Acceptable results are also obtained by selecting for replacement that file whose size times time to last reference is maximal. Comparisons are made with a number of standard algorithms developed for paging,such as Working Set, VMIN,etc. Sufficient information (parameter values,fitted equations) is provided that the algorithms may be easily implemented on other systems. 15figures, 4tables. (ERA citation 04:045766)