Calculate the cpu execution time for a computer with clock cycles per instruction as 1.0 when all memory accesses hit in the cache. The only data accesses or loads and stores and these total 50% of the instructions. If the miss penalty is 25 clock cycles and the miss rate is 2% how much faster would the computer be if all instructions were cache hits.

Calculate the cpu execution time for a computer with clock cycles per instruction as 1.0 when all memory accesses hit in the cache. The only data accesses or loads and stores and these total 50% of the instructions. If the miss penalty is 25 clock cycles and the miss rate is 2% how much faster would the computer be if all instructions were cache hits.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter4: Processor Technology And Architecture

Section: Chapter Questions

Problem 2PE: If a microprocessor has a cycle time of 0.5 nanoseconds, what’s the processor clock rate? If the...

See similar textbooks

Similar questions

Assume we have a computer where the clocks per instruction is 1.0 when all memory accesses hit in the cache. The only data accesses are loads and stores and these total 50% of the instructions. If the miss penalty is 25 clock cycles and the miss rate is 2%, how much faster would the computer be if all instructions were cache hits?
3. Assume you have a computer where the cycles per Instruction(CPI) is 1 when all the memory accesses hit in the cache. The only data accesses are loads and stores and these total 25% of the instructions.If the miss penalty is 50 clock cycles and the miss rate is 1%, how much faster would the computer if all the instructions were cache hits?
Note:- Don't copy paste and existing Answers will downvote Sub:- Computer Architecture Assume the cache miss penalty is 100 clock cycles and all instructions normally take 1.0 clock cycles (ignoring memory stalls). Assume the average miss rate is 2%, there is an average of 1.5 memory references for instruction, and the average number of cache misses per 1000 instructions is 30. What is the impact on performance when behavior of the cache is included? Calculate the impact using both misses per instruc tion and miss rate.
Assume the miss rate of an instruction cache is 4% and the miss rate of the data cache is 5%. If a processor has a CPI of 3 without any memory stalls, and the miss penalty is 50 cycles for all misses, determine how much faster a processor would run with a perfect cache that never missed. Assume the frequency of all loads and stores is 44%.
What are the two main steps involved in an instruction cycle? If the CPU needs to be alerted by the keyboard and the mouse at the same time, How the CPU will handle interrupts from the keyboard and the mouse at the same time? There are two ways... Which cache mapping does not need a replacement algorithm? Which cache mapping scheme has the largest TAG? Only a microprocessor is accessing the memory via cache i.e. no other device is reading from memory. Which cache write the policy will you use and why.
Suppose memory access takes 100 ns and register access takes 1 ns (or less), calculate and compare the computational speed of the three code snippets. Assume CPU instructions such as XOR, ADD, also take 1 ns and we flush everything in the cache before executing the programs. Program snippet 1: Mov EAX, [0x 8002 B001] Mov EBX, EAX XOR EAX, EAX Program snippet 2: Mov ECX, 0 Mov EAX, 1 ADD ECX, EAX Mov [0x 8009 0001], ECX Mov EAX, [0x 8009 0010] Program snippet 3: Mov EAX, Ox 4001 0000 Mov EBX, Ox 4001 0001 ADD EAX, EBX XOR EBX, EBX
Q. What is the baseline performance (in cycles, per loop iteration) of the code sequence in if no new instruction’s execution could be initiated until the previous instruction’s execution had completed? Ignore front-end fetch and decode. Assume for now that execution does not stall for lack of the next instruction, but only one instruction/cycle can be issued. Assume the branch is taken, and that there is a one-cycle branch delay slot. Latencies beyond single cycle: Latencies beyond single cycle:Memory LD +6Memory SD +4Integer ADD, SUB +1Branches +2fadd.d +4fmul.d +6fdiv.d +10Execution codeLoop : fld f2, 0(Rx)I0: fdiv.d f8, f2, f0I1: fmul.d f2, f6, f2I2: fld f4, 0(Ry)I3: fadd.d f4, f0, f4I4: fadd.d f10, f8, f4I5: fsd f10, 0(Ry)I6: addi Rx, Ry, 8I7: addi Ry, Ry, 8I8: sub x20, x4, RxI9: bnz x20, Loop Q. Think about what latency numbers really mean—they indicate the number of cycles a given function requires to produce its output. If the overall pipeline stalls for the latency cycles of…
. Consider a system that has multiple processors where eachprocessor has its own cache, but main memory is shared among allprocessors.1. a) Which cache write policy would you use?2. b) The cache coherency problem. With regard to the systemjust described, what problems are caused if a processor has acopy of memory block A in its cache and a second processor,also having a copy of A in its cache, then updates mainmemory block A? Can you think of a way (perhaps morethan one) of preventing this situation, or lessening itseffects?
A benchmark program makes 1800 memory references and produces the following statistics. The average memory access time is 60 nsec, the number of memory misses on the cache is 12,000 and the primary memory access time is 45 nsec. The computer manufacturer maintains that the Cache system has a 25 nsec access time. Is this plausible?
Let's pretend for a moment that we had a byte-addressable computer with 2-way set associative mapping, 16-bit main memory addresses, and 32 cache memory blocks at our disposal. Using the information that there are 8 bytes in each block, calculate the size of the offset field and show your results.
In this problem, you will explore processor frequency in the context of the speed of light.Suppose you have overclocked a processor to 8,722.78MHz. This processor can execute one instruction per cycle. Further let us suppose that the system is accessing a magnetic disk (HD) with an access time of 11ms. 1. Suppose that you are designing the machine architecture and want to guarantee the CPU can obtain data from memory within 4 CPU cycles. Given that the address has to travel from the CPU to the memory unit (MMU) and that the data has to travel from memory to the CPU, what is the maximum distance between CPU and the MMU if the signal on the memory bus propagates at 75% of the speed of light?
A computer has a cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, 20 ns are required to access it. If it is in main memory but not in the cache, 60 ns are needed to load it into the cache, then the reference is started again. If the word is not in main memory, 12 ms (not ns) are required to fetch the word from disk, then the reference is started again. The cache hit ratio is 0.9 and the main memory hit ratio is 0.06. What is the average time in ns required to access a referenced word on this system?