adplus-dvertising
frame-decoration

Question

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

a.

Write buffer

b.

Multilevel exclusion

c.

Write-through

d.

Multilevel inclusion

Answer: (b).Multilevel exclusion

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

Q. In terms of the no of read accesses/program, the miss penalty in clock-cycles for a reading, and the reading miss-rate, is defined as

Q. Having a cache block of 4words, having one-word-wide bank of DRAMs and the miss penalty 65, then no of bytes transferred/bus-clock cycle for a single miss will be

Q. The range of designs between direct-mapped and fully-associative cache, is called

Q. The main memory of a computer can act as a

Q. If the entries no is a power of 2 in the cache, then modulo will be computed by using the

Q. Forget to accounting the byte addressing or the cache block-size, in processing a cache is a