The effectiveness of a compiler assisted look-ahead paging algorithm via simulation
JACOB ROOTENBERG, JOSEPH J. PYERON · International Journal of Systems Science · 1977
This paper presents a computer simulation of a look-ahead paging algorithm that; is based on computer produced weighted values assigned at compilation time. The look-ahead paging algorithm employed in this paper calculates those pages with the highest values as the most probable for future utilization and selectively chooses among them those which will comprise the new current working set. The number of page faults, which in essence is the request for up-dating the current working set, prorated by the number of original pages of programme code and data, yields a ratio that is used as a basis for determining the effectiveness of the system with or without the look-ahead paging algorithm. The implementation of this algorithm can be accomplished via software using an added programming package controlled by the operating system or via hardware using a dedicated micro-computer. The effectiveness of the look-ahead paging algorithm was determined via simulation. The simulation itself was written in General Purpose Discrete Simulator (GPDS), a high level event oriented simulation language, and was carried out on a Xerox Data Systems Sigma 6/Sigma 7 dual-processor computer. The results of the simulation clearly demonstrate the advantage of the look-ahead paging algorithm described in this paper.