GATE CSE 2015 Set 2 | Memory Interfacing Question 25 | Computer Organization

GATE CSE 2015 Set 2

Numerical

-0

Assume that for a certain processor, a read request takes $$50$$ nanoseconds on a cache miss and $$5$$ nanoseconds on a cache hit. Suppose while running a program, it was observed that $$80\% $$ of the processor's read requests result in a cache hit. The average read access time in nanoseconds is __________.

Your input ____

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

An access sequence of cache block addresses is of length $$N$$ and contains $$n$$ unique block address. 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\, \ge \,k$$ exercising least-recently-used replacement policy?

$$n/N$$

$$1/N$$

$$1/A$$

$$k/n$$

GATE CSE 2013

MCQ (Single Correct Answer)

-0.3

In a $$k$$-way set associative cache, the cache is divided into $$v$$ sets, each of which consists of $$k$$ lines. The lines of a set are placed in sequence one after another. The lines in set $$s$$ are sequenced before the lines in set $$(s+1).$$ The main memory blocks are numbered $$0$$ onwards. The main memory block numbered $$j$$ must be mapped to any one of the cache lines from

$${\left( {j\,\,\bmod \,\,v} \right)^ * }k\,\,$$ to $${\left( {j\,\,\bmod \,\,v} \right)^ * }k\, + \,\,\,\,\,\,\left( {k - 1} \right)$$

$${\left( {j\,\,\bmod \,\,v} \right)}\,\,$$ to $$\left( {j\,\,\bmod \,\,v} \right)\, + \,\left( {k - 1} \right)$$

$${\left( {j\,\,\bmod \,\,k} \right) }\,\,$$ to $$\left( {j\,\,\bmod \,\,k} \right)\, + \,\left( {v - 1} \right)$$

$${\left( {j\,\,\bmod \,\,k} \right)^ * }v\,\,$$ to $${\left( {j\,\,\bmod \,\,k} \right)^ * }\,v + \,\left( {v - 1} \right)$$

GATE CSE 2012

MCQ (Single Correct Answer)

-0.3

The amount of $$ROM$$ needed to implement a $$4$$ bit multiplier is

$$64$$ bits

$$128$$ bits

$$1$$ $$K$$bits

$$2$$ $$K$$bits