We describe a technique for simulating associative cache
directories that considerably reduces simulation time with
respect to a sequential search of the tag array. We also
describe techniques for maintaining LRU information that use
considerably less memory than time-stamps. The combination
of these techniques makes possible the simulation of
set-associative cache directories at a much higher speed
than other techniques.
By: Mayan Moudgill
Published in: RC21038 in 1997
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .