Google

A window-based cache retains a fixed number of the most recent key-value pairs. For instance, a cache with a window size of four would store the key-value pairs corresponding to indices $i-3$, $i-2$, $i-1$, and $i$. This results in a memory component of size 4x2, as it is composed of four separate key vectors and four separate value vectors.

Example of a Window-based Cache

A system uses a memory component that always stores the three most recently processed key-value pairs. If the system processes the following pairs in order: (K1, V1), (K2, V2), (K3, V3), (K4, V4), (K5, V5), what will be the contents of the memory component after the fifth pair is processed?

A system's memory component is designed to retain a fixed window of the 12 most recent key-value pairs. How many total vectors (counting both key vectors and value vectors) are stored in this memory component at any given time? Briefly explain your reasoning.

Learn Before

Related