A novel technique is introduced to graphically analyze the runtime behavior of block replacement algorithms used in cache controllers. The new method allows a behavioral comparison of two or more algorithms, previously impossible due to the vast amount of data involved in cache simulations. Absolute and relative comparisons are demonstrated and the application in the development of a modified LRU is shown.

The full text of this article is not available on SOAR. WSU users can access the article via IEEE Xplore database licensed by University Libraries: http://libcat.wichita.edu/vwebv/holdingsInfo?bibId=1045954