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

Q. Address translation cache is referred to as a

View solution

Q. Cutting of physical-memory into the form of blocks and allocating them to different processes, the stated technique is known as

View solution

Q. If the processor is not willing in the cycle for retiring the maximum number of instructions; it is said to be

View solution

Q. The security loopholes, prevents by not allowing the user process to ask the operating system to access somethingindirectly are known as

View solution

Q. When the processor is waiting for write instruction to complete during the write-through process, the processor is said to

View solution

Q. If a set has n blocks, the cache placement is then called

View solution

Q. For reducing the frequency on replacement of write-back blocks, the commonly used feature, is known as

View solution

Q. The processor address's size, determines the size of

View solution

Q. A direct-mapped cache having a size of N and has the miss rate same as a two-way set-associative cache, of size

View solution

Q. The block placement strategy, is if set associative/direct mapped, then this miss is called

View solution

Q. When Cycle per instruction is 1.0, data accesses are 50% of the total instructions, and the miss penalty is 25clock-cycles and the miss rate having 2%, then the computer would the faster as,

View solution