Computer Design 2007 – Caches 13 Direct Map Cache (cont) u Partition memory into slices  slice size = cache size u Partition each slice to blocks  Block size = cache line size  Distance of block from slice start indicates position in cache (set) u Advantages  Easy hit/miss resolution  Easy replacement algorithm  Lowest power u Disadvantage  Line replacements due to set conflict misses Cache Size........
{}