Premium
A set of strategy‐independent restructuring algorithms
Author(s) -
Kobayashi Makoto
Publication year - 1977
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.4380070504
Subject(s) - paging , computer science , restructuring , set (abstract data type) , locality , algorithm , working set , bounded function , demand paging , parallel computing , memory management , virtual memory , overlay , programming language , mathematics , operating system , finance , mathematical analysis , linguistics , philosophy , economics
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.