if the replacement policy is free to choose any

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ll up quickly, and therefore a replacement policy is needed. "   The heuristic that it uses to choose the entry to evict is called the replacement policy. The fundamental problem with any replacement policy is that it must predict which existing cache entry is least likely to be used in the near future. "   A popular replacement policy, least- recently used (LRU), replaces the least recently accessed entry. Associativity "   The replacement policy decides where in the cache a copy of a particular entry of main memory will go. "   If the replacement policy is free to choose any entry in the cache to hold the copy, the cache is called fully associative. "   At the other extreme, if each entry in main memory can go in just one place in...
View Full Document

This note was uploaded on 02/12/2014 for the course CS 475 taught by Professor Staff during the Fall '08 term at Colorado State.

Ask a homework question - tutors are online