Q. The cache memory of 1K words uses direct mapping with a block size of 4 words. How many blocks can the cache accommodate?

View solution

Q. A page fault

View solution

Q. If a block can be placed at every location in the cache, this cache is said to be

View solution

Q. For recording, was the block written, the Opteron keeps

View solution

Q. The information when is written in the cache, both to the block in the cache and the block present in the lower-level memory, refers to

View solution

Q. Average access time of memory for having memory-hierarchy performance is given as

View solution

Q. As segment or a page is normally used for block, page-fault and the address-fault is used for

View solution

Q. The block frame address are divided into the

View solution

Q. The increase in the width of the cache address tag, can be done with the

View solution

Q. The victim buffer's performance and the operation is almost similar to

View solution

Q. Assume that the hit-time is single clock cycle, independent of size of block, and then 16-byte block in a 4 KB cache will be having access-time of

View solution

Q. The virtual memory producing the virtual-addresses, are translated by

View solution

Q. The most obvious architectural parameter is the

View solution

Q. The time of CPU can be modeled as

View solution

Q. The processor protection structure expand memory access protection from two levels to many, the added ones are

View solution

Q. The virtually indexer's limitation, saying that a cache which is direct-mapped can have a size no bigger than the

View solution

Q. IA-32 allows the operating system to maintain the protection level of the called

View solution

Q. Per memory reference, the miss-rate can be turned into the per instruction misses rate by

View solution

Q. The field that is not found in paged systems, which establishes theupper bound of valid offsets for segments is called

View solution

Q. A common optimization for reducing write stalls is a

View solution