Here is my question. Topic: Computer Organization (Virtual Memory)

Problem 2 Assume a 4-way set-associative cache with 64 cache sets, 4 words per block, and an LRU replacement policy. For both a write-through, no write-allocate and a write-back, write-allocate cache, fll in the appropriate information for the following memory references (see slide 58-62 of Lecture1 R/W Address Tag Index OffsetResult Memref? Update? 1480 1484 460 456 R. R 2504 2508 R. W 353:2 3528 R. Table 1: Write-Through, No Write-Allocate Handwritten or typed solutions are acceptable. If you do write your solutions by hand, please write clearly. Problem 2 Assume a 4-way set-associative cache with 64 cache sets, 4 words per block, and an LRU replacement policy. For both a write-through, no write-allocate and a write-back, write-allocate cache, fll in the appropriate information for the following memory references (see slide 58-62 of Lecture1 R/W Address Tag Index OffsetResult Memref? Update? 1480 1484 460 456 R. R 2504 2508 R. W 353:2 3528 R. Table 1: Write-Through, No Write-Allocate Handwritten or typed solutions are acceptable. If you do write your solutions by hand, please write clearly