Cache organization is often influenced by the

desire to reduce the cache's power consumption. For that purpose we assume that

the cache is physically distributed into a data array $($holding the data$),$ a tag array

$($holding the tags$),$ and replacement array $($holding information needed by replacement policy$).$ Furthermore, every one of these arrays is physically distributed into

multiple subarrays $($one per way$)$ that can be individually accessed; for example, a

four$-$way set associative least recently used $($LRU$)$ cache would have four data subarrays, four tag subarrays, and four replacement subarrays.