Q44

MCQ2 marks, −0.67

An access sequence of cache block addresses is of length $N$ 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 $k$ . What is the miss ratio if the access sequence is passed through a cache of associativity $A\geq k$ exercising least-recently-used replacement policy?

(A)

$\left(\dfrac{n}{N}\right)$

(B)

$\left(\dfrac{1}{N}\right)$

(C)

$\left(\dfrac{1}{A}\right)$

(D)

$\left(\dfrac{k}{n}\right)$

Loading…