Q. The processor's performance can be calculated as

View solution

Q. At any instant it is possible to switch from one process to another, this exchange is called a

View solution

Q. Caches containing either instructions or data, is referred to the term

View solution

Q. Hardware solutions for the synonym problems, are called

View solution

Q. Fixed-size blocks known as pages, and those having variable-size blocks are known as

View solution

Q. If the entry is 8 bytes long, each page table has 512 entries, and the Opteron has 4 KB pages. Each of the four level fields are 9 bits long, and the page offset is 12 bits, then the sign extended would be

View solution

Q. If going fully associative, refers to the

View solution

Q. The natural policy uses for the memory hierarchies: L1 data of cache are always present in L2 level of cache, refers to

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. To restrict entry into others

View solution

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

View solution