Exams › GATE › Technical

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 sets are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. A main memory block numbered j must be mapped to any one of the cache lines from

1. (j mod v) * k to (j mod v) * k + (k-1)
2. (j mod v) to (j mod v) + (k-1)
3. (j mod k) to (j mod k) + (v-1)
4. (j mod k) * v to (j mod k) * v + (v-1)

Correct answer: (j mod v) * k to (j mod v) * k + (k-1)

Solution

The correct option accurately describes how a main memory block is mapped to a specific range of cache lines in a k-way set associative cache. It indicates that the block indexed by j can occupy any of the k lines within the set determined by the modulo operation with v, ensuring that the mapping adheres to the structure of the cache.

Related GATE Technical questions

• The truth table X Y f(X,Y) 0 0 0 0 1 0 1 0 1 1 1 1 represents the Boolean function
• The decimal value 0.5 in IEEE single precision floating point representation has
• A process executes the code fork(); fork(); fork(); The total number of child processes created is
• The protocol data unit (PDU) for the application layer in the Internet stack is
• Which of the following problems are decidable? 1) Does a given program ever produce an output? 2) If L is a context-free language, then is L̄ also context-free? 3) If L is a regular language, then is L̄ also regular? 4) If L is a recursive language, then is L̄ also recursive?
• A binary operation ⊕ on a set of integers is defined as x ⊕ y = x² × y². Which one of the following statements is TRUE about ⊕?

⚔️ Practice GATE Technical free + battle 1v1 →