Permutation Clustering: An Approach to On-Line Storage Reorganization
B. Taylor Bennett, Peter A. Franaszek · IBM Journal of Research and Development · 1977
A class of dynamic reorganization algorithms is described which embodies a number of desirable systems properties. Experiments on a trace taken from a large data base application indicate that a member of this class may be used to obtain time-varying or quasistatic organizations that exhibit improved paging performance.