Two algorithms are presented which dynamically cluster pages of a problem program based on past program behavior (i.e., reference string patterns) in a demand paged virtual memory environment. The objective of these ...