adplus-dvertising
frame-decoration

Question

For reducing the chance of throwing the information which soon will be needed, this technique used is

a.

Least recently used

b.

Random

c.

First in, first out

d.

First in, last out

Posted under Computer Architecture

Answer: (a).Least recently used

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. For reducing the chance of throwing the information which soon will be needed, this technique used is

Similar Questions

Discover Related MCQs

Q. The ratio of cache accesses, results in a miss is known as

Q. AMD64 requires that the upper 16 bits of the virtual address be just the sign extension of the lower 48 bits, which it calls

Q. Larger cache-size, larger block-size, and higher associativity, refers to the

Q. A small page size will result in less wasted storage when a contiguous region of virtualmemory is not equal in size to a multiple of the page size, this unused memory is known as

Q. To help the operating system estimate LRU, many processors provide a

Q. The policy for memory hierarchies: L1 data are never found in an L2 cache, refers to

Q. The 64-bit virtual address of the AMD64 architecture is mapped onto

Q. A better measurement of performance of memory-hierarchy is the

Q. When the computer processor does not get a data item it requires in the cache, then the problem is known as

Q. To restrict entry into others

Q. Significant percentage of the spent time in moving data in two levels in the memory hierarchy, then the memory-hierarchy is said to

Q. The cache term is now applied when a buffering is employed for reusing commonly occurring items, for example

Q. If each block having one place to be appear in the cache, this cache is said to be

Q. In a direct-mapped cache of eight words (1)10 (00001two) and (29)10 (11101two) map to locations

Q. The levels between the CPU and main memory were given a name of

Q. Allowing the processor for continuing execution of instructions, that access data-cache while having cache miss, is known as

Q. Having 32-bit virtual-address, 4 KB pages and 4 bytes/page of table entry, the total no of page-table size would be

Q. A queue holding data while the data are waiting to be written in memory, is known as

Q. Cache having 64 blocks and a block-size of 16 bytes, will have block-no for address 1200 map to

Q. The spatial locality, is also known as