A set of strategy‐independent restructuring algorithms
M. Kobayashi · Software Practice and Experience · 1977
Abstract This paper proposes a set of new program restructuring algorithms which can be used to reorganize programs so as to increase their performance under two typical memory management strategies. The new algorithms are based on a recently proposed program behaviour model called the bounded locality intervals model, which allows us to give a precise definition of the localities of a program. The paging activities of a program restructured with the new algorithms under working‐set and global LRU‐like memory management strategies are simulated to evaluate the new algorithms. Some of them are shown to have quite satisfactory performance.