ZuoTi.Pro
Question

Assume a cache with a write-through policy, non-write allocate. Your cache has a miss rate of...

Assume a cache with a write-through policy, non-write allocate. Your cache has a miss rate of 5%. There is a 150 cycle miss penalty. Additionally, it takes an extra 30 cycles to do a write. Your program has a base CPI of 1, is 20% loads, and 5% stores. What will its CPI be?

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Ansuex Hese missate 5%, -0.05 : 9 missPenaty 150 cyctes In these cache Po wite oPesation,it takes oddibionaty 3o cycles So the neuw Penaltys 150 +30 - 80 Cycies Base CPI= 1 le con ind the miss cycles Pex instuction using below fosmula is Loods ond Stoe instsuction* miss sate x miss Penalty Substbtute the abave values to given Psmuia (0.2+ 0.05) 0,05 180Miss cycle Pes instruction R2s the cp1 is Calculated uSin ede CPI- Base cPT+ Miss cycles Pesin CP325. Anathes answe miss sate

0 0
Add a comment
Know the answer?
Add Answer to:
Assume a cache with a write-through policy, non-write allocate. Your cache has a miss rate of...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Question 4 (10 pt). One difference between a write-through cache and a write-back cache can be...

    Question 4 (10 pt). One difference between a write-through cache and a write-back cache can be in the time it takes to write. During the first cycle, we detect whether a hit will occur, and during the second (assuming a hit) we actually write the data. Let’s assume that 50% of the blocks are dirty for a write-back cache. For this question, assume that the write buffer for the write through will never stall the CPU (no penalty). Assume a...

  • Assume the miss rate of an instruction cache is 3% and the miss rate of the...

    Assume the miss rate of an instruction cache is 3% and the miss rate of the data cache is 5%. If a processor has a CPI of 2 without any memory stalls and the miss penalty is 120 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 36%. *The size of the tag field-64- (n + m 2). ** The total...

  • For gcc, the frequency for all loads and stores is 36%. Instruction cache miss rate is...

    For gcc, the frequency for all loads and stores is 36%. Instruction cache miss rate is 5%. Data cache miss rate is 10%. If a machine has a CPI of 2 without memory stalls and the miss penalty is 40 cycles for all misses, how much faster is a machine with a perfect cache? increase the performance by doubling its clock rate. Since the main memory speed is unlikely to change, assume that the absolute time to handle a cache...

  • Base machine has a 2.4GHz clock rate. There is L1 and L2 cache. L1 cache is...

    Base machine has a 2.4GHz clock rate. There is L1 and L2 cache. L1 cache is 256K, direct mapped write through. 90% (read) hit rate without penalty, miss penalty is 4 cycles. (cost of reading L2) All writes take 1 cycle. L2 cache is 2MB, 4 way set associative write back. 95% hit rate, 60 cycle miss penalty (cost of reading memory). 30% of all instructions are reads, 10% writes. All instructions take 1 cycle - except reads which take...

  • AMAT = Time for a hit + (Miss rate x Miss penalty) For a data cache...

    AMAT = Time for a hit + (Miss rate x Miss penalty) For a data cache with a 4% miss rate and a 5-cycle hit latency, calculate the average memory access time (AMAT). Assume that latency to memory and the cache miss penalty together is 100 cycles. Note: The cache must be accessed after memory returns the data.

  • 2. Cache hierarchy You are building a computer system with in-order execution that runs at 1...

    2. Cache hierarchy You are building a computer system with in-order execution that runs at 1 GHz and has a CPI of 1, with no memory accesses. The memory system is a split L1 cache. Both the I-cache and the D-cache are direct mapped and hold 32 KB each, with a block size of 64 bytes. The memory system is split L1 cache. Both the I-cache and the D-cache are direct mapped and hold 32 KB each, with a block...

  • Write-allocate policy requires fetching the data block into the cache from memory when a write miss...

    Write-allocate policy requires fetching the data block into the cache from memory when a write miss occurs. True False A Moving to another question will save this response. esc DO FT F2 F3 DOO F4 # 이.

  • (a)What is the average memory access time (AMAT) if a cache uses write-back strategy and 20%...

    (a)What is the average memory access time (AMAT) if a cache uses write-back strategy and 20% of the data blocks to be swapped out are dirty. Assume that the miss rate is 15%, the hit time of the cache is 1 cycle and the miss penalty is 8 cycles for the data blocks that are not dirty and 20 cycles for those blocks that are dirty. (b) What is the speedup up if we add a “write-buffer” that eliminates 40%...

  • virtual memory support into our baseline 5-stage MIPS pipeline using the TLB miss handler. Assume that...

    virtual memory support into our baseline 5-stage MIPS pipeline using the TLB miss handler. Assume that accessing the TLB does not incur an extra cycle in memory access in case of hits. Without virtual memory support (i.e. she had only a single address space for the entire system, or a physical address is same as a logical address), the average cycles per instruction (CPI) was 2 to run Program X. If the TLB misses 10 times for instructions and 20...

  • A particular (fictional) CPU has the following internal units and timings: 1. IFD: Instruction fetch + decode : 160 ps...

    A particular (fictional) CPU has the following internal units and timings: 1. IFD: Instruction fetch + decode : 160 ps 2. RR: Register read 80 ps 3. ALU: 240 ps 4. MA : memory access: 160 ps (assuming cache) 5. RW : register write : 80 ps There are 5 basic instruction types: 1. LOAD : IFD+RR+ALU+MA+RW 720 ps 2. STORE: IFD+RR+ALU+MA : 640 ps 3. ARITHMETIC: IFD+RR+ALU+RW : 560 4. BRANCH: IFD+RR+ALU : 480 ps 5. MEMOP: IFD+RR+MA+ALU+MA :...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT