The reference string is the series of virtual page references generated during the execution of a program. The inherent behavior of a program impacts the efficiency of virtual memory systems. Study of certain common patterns of reference strings helps to discover which replacement algorithms are most efficient for which program patterns.
This workbench illustrates several patterns of program behavior. The patterns are represented by the buttons on the left side of the workbench. When you press the button for a pattern, a logical address space and sample code for that pattern are revealed. They are matched with a reference string exhibited below them. Compare the reference strings with different replacement algorithms in mind. Which would work more efficiently with the First In-First Out algorithm? Which with the Least Recently Used algorithm? Which with the Least Frequently Used?