can someone do this please!! and show the steps thanks

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899603
Joined: Mon Aug 02, 2021 8:13 am

can someone do this please!! and show the steps thanks

Post by answerhappygod »

can someone do this please!! and show the steps thanks
Can Someone Do This Please And Show The Steps Thanks 1
Can Someone Do This Please And Show The Steps Thanks 1 (101.48 KiB) Viewed 15 times
3. Let's consider fun table below, which it is a byte-addressable memory with 256 bytes. The address of each memory cell is determined by its row and column. For example, memory address 0x97 is in the 9th row, 7th column, and contains the hexadecimal value 43. Memory location OxA3 contains the hexadecimal value 58. The system from which this memory was produced contains 4 blocks of cache, where each block consists of eight bytes. Assume the following sequence of memory addresses take place: 0x2C, 0x6D, 0x86, 0x29, 0xA5, 0x82, 0xA7, 0x68, 0x80, and 0x2B. 0 1 2 DC D5 9C 74 3 4 5 6 7 8 9 A B 77 C1 99 90 AC 33 D1 37 49 E2 23 FD DO A6 98 BB DE 9A 9E 3A 14 F3 59 EB 1F 5C 41 B2 6D 18 3C 9D 87 3D B8 E1 EF C5 CE 4E B7 29 E7 BF 6B 69 02 56 7E DA 2A 76 89 20 85 88 5 B9 16 A8 FA AE 68 21 25 34 24 B6 48 17 6 40 2B C4 1D 08 03 OE OB 7 31 AF 30 9F A4 FE 09 60 8 CD 80 64 83 8D 81 A7 9 61 28 5D D4 4A 10 A2 0 1 2 3 4 ABCDE A 52 57 51 с 22 OD A3 58 1C C6 3B F5 2C 62 A9 4C 6A 70 84 6E F7 63 3F CA 45 F AB E6 2D 54 E4 8F 36 6F C7 05 26 50 35 E 18 48 55 OF E8 ED 7B DB 43 CC B4 C2 53 FB E3 4F D7 D9 97 2E F1 BA 66 BE 11 07 7D 5A BO SE DD 00 8A D6 91 FO C3 F6 EE 95 12 7C 8E 96 A0 5F 7A CDEF B5 82 38 EO 04 AA 86 E5 2F 78 44 1E 93 CB 39 7F 72 92 E9 5B 83 75 0A FF 71 65 73 D8 F2 8C OC 9B 6C 94 BC 1A A1 D2 CO D3 CF 67 19 F9 BD DF B1 4D C8 27 3E 8B 47 EC 42 EA 01 13 F4 F8 46 79 C9 FC A5 AD 15 32 06 For the following questions, you need to draw their corresponding cache tables: A. Assuming a direct mapped cache, what does cache look like after the ten memory accesses have taken place? B. In a fully associative cache, assuming all cache blocks are initially empty, blocks are loaded into the first available empty cache location, and cache uses a first-in-first-out replacement policy. what does cache look like after the ten memory accesses have taken place? C. In a 2-way set associative cache, what does cache look like after the ten memory accesses have taken place?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply