An access sequence of cache block addresses is of length \(N\) and contains n…

PYQ GATE 2014

An access sequence of cache block addresses is of length NN and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by kk. What is the miss ratio if the access sequence is passed through a cache of associativity A≥kA\geq k exercising least-recently-used replacement policy?

  1. A.

    n/Nn/N

  2. B.

    1/N1/N

  3. C.

    1/A1/A

  4. D.

    k/nk/n

Attempted by 142 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…