"Design and Analysis of Efficient Application-Specific On-line Page Replacement Techniques"

(by V. Andronache, E. H.-M. Sha, and N. L. Passos) in Proceedings of the IEEE Tenth Great Lakes Symposium on VLSI, Evanston, Illinois, March, 2000, pp. 123-128.



  The trend in computer performance over the last 20 years has indicated that the memory performance constitutes a bottlneck for the overall system performance. As a result, smaller, faster memories have been introduced to hide the speed differential between the CPU and memory. From the beginning of this process, an essential question has been the determination of which part of main memory should reside in the faster memory at each instant. Several on­line and off­line algorithms have been introduced, the best known and most used of which are LRU and MIN respectively. This paper introduces a new approach to page replacement in that it allows the compiler to enter the decision process. In introducing compiler help to page replacement, information available at compile time is passed on to new hardware added to the regular memory, with the overall effect of markedly decreasing overall memory access time.


[ Published listings ] [ Top ]