Suppose we have two implementations: Machine A has a clock cycle time of 10 ns. and a CPI of 2.0. Machine B has a clock cycle time of 20 ns. and a CPI of 1.2. Which machine is faster for this program, and how much in percentage? Consider that the total instruction in the program is 1x10^9 or about 1,000,000,000 set of instructions since the cycle time is running in nanoseconds.

Consider following scenario for a program running on two computers A and B.   Computer A   Execution time = 10 S   ClockRate = 2 GHz   Computer B   Execution time = 8S   No of clock cycles of B 1.1XNo of clock cycles of computer A   Find out the clock rate for computer B?

a. We are given a system with 2 levels of cache, L1 and L2. The CPU directly interfaces to the L1 cache, which has a hit time of 1 ns and a hit rate of 0.4. On misses, the L1 accesses the L2 cache, which has an access time of 20 ns, and a hit rate of 0.8. If the L2 misses, it accesses the main memory, which has an access time of 100 ns. Determine the average memory access time, of the CPU to the memory hierarchy.b. A cache is inserted between the main memory, which is 32 MB, and the CPU. This cache can accomodate 64 blocks and each block can accomodate 128 words (2B per word). How many possible blocks can be stored in one cache block if it is a direct-mapped cache?

Question 1: Consider following scenario for a program running on two computers A and B. Computer A Computer B Execution time = 10 S Execution time = 8 S No of clock cycles of B = 1.1XNO of clock cycles of computer A ClockRate = 2 GHz Find out the clock rate for computer B?