Techniques for fast simulation of associative cache directories

Abstract

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.