Before Solving this problem, please go through all the requirements. It's my kind request to you.

I added sample questions and sample answers for your better understanding. from all of them, here is one question Red marked! You have to solve that question only. Please follow this pattern. Without this method, our instructor does not accept any solution. Please, take enough time, approximately 10-12 hrs for solving, but don't write irrelevant something. Please try to understand my situation.

Subject - Computer Organization and Architecture [ Theory ]

# I have posted this question several times, but one of your experts solved the wrong number with an irrelevant answer. It's too much pathetic for me. Did I purchase it for it? You can take enough time to solve this problem, and if you don't have enough knowledge to solve this answer, please skip it.

Hi Experts! Would you please try to solve this as soon as possible with 100 % Accuracy? If possible, please do it.

You have to follow some instructions which I mentioned below. If you don't follow my instructions, please skip my questions.

You have to answer only #2. I repeated, don't do other numbers.

Instructions are given,

• You need to show detailed calculations, as required.
• You need to provide clear diagrams, as required. All diagrams should be clearly drawn

Question --------

2. 20 (5x4) A computer system contains a main memory of 32KB. It also has a 1KB cache divided into two-lines/set with 8Bytes per line. Assume that the cache is initially empty. The processor fetches words from locations in order: 4098, 2052, 2051, 1026, 4097, 4096, 2050, 2049, 2048, 1025, 1024 in that order. Assume an LRU is used as replacement algorithm. Calculate the Hit ratio. Show the state of cache at the end. How many blocks are replaced? Estimate the improvement resulting from the use of the cache, if the cache is 15 times faster than RAM. Just comment relative Hit Ratio and execution time if 4-way set associative cache is used instead. = Ans to the ques-2 Herce, Cache size = 1 KB 1 size of line 8 Bytes. # of lines. pere set , K=2 # . 2. Total number of lines in eache, M= 28 - 256 K=2 So, total sets, set m/k 256 2 = 128 Block RAM Tcheck Event consequence cache Address numbere 4098 j= 409818 Not Miss Block 512 will Yound! - 512 treanster to [s= 512 MOD 8 so] Set o line 1 2052 (j=205218 Not 3 miss BIOCK 256 will transfer to [S=256 MOD to 58] Set o. line 23 2051 3= 2051/8 found hit 5256 - 256 found Reads from Cache 1026 (j= 1026181 Not j =128 I found I miss Block 128 will be treamster to Is = 128 MOD 8 50] Set a line 1 [replace] Miss Block 512 will be Replace treanstered Ho [s = 522 mon8] [set, o, line 2 replace 4097 =4697/8 NOT = 512 / found RAM Block Address number Check Event consequence. Cache found Hit 4096 = 409618 =512 reads from cache Hit 2050 reads from Cache y = 2050/8 found = 256 . uit reads from Cache 2049 j J = 204918 Found =856 tit reads from 2048 j= 204818 Found cache -256 tit reads from Ca@he 10 25 = 1025/8 Found =128 1024 = 1020 G 102% found thit Heads from Cache 5128 Cache thit total: Feilch = 11 Hit ration 7 7 0.63 11 .Om 63% Cache state -Block 512 Block 256 Seto Set'i Tloo blocks are replaced LO 26 and 4097 at betening 2. 13 20 (5x4) A computer system contains a main memory of 32KB. It also has a 256Bytes cache divided into two-lines/set with 4Bytes per line. Assume that the cache is initially empty. The processor fetches words from locations in order: 1032, 1033, 136, 137, 138, 904, 905, 264, 265, 138, 1034, 906 in that order. Assume an LRU is used as replacement algorithm. Calculate the Hit ratio. Show the state of cache at the end. How many blocks are replaced? Estimate the improvement resulting from the use of the cache, if the cache is 10 times faster than RAM. Just comment relative Hit Ratio and execution time if 4-way set associative cache is used instead