So, I'm trying to do a computer architecture assignment and there's a question about dcaches. Here's the question:Given a 16 word dcache initially filled with word address 0, 1, 2, 15  memory data (referenced by the datapath in that order). Below is the next  sequence of data memory address references given as word addresses.   1, 18, 2, 3, 4, 20, 5, 21, 33, 34, 1, 4a) Assuming the dcache is direct-mapped with one-word blocks, list if each  reference is a hit or a miss. Show the state of the dcache after the last reference. What is the hit rate for this reference string? I'm not asking for a solution but would just like to know what is considered a miss or hit and how this is calculated? Also, what would be the difference if the dcache had a two-word blocks instead of 1?Any help is greatly appreciated.
Can someone give me an explanation of how dcaches works?
computer architecture;cpu cache