search
Log In
3 votes
673 views

in CO and Architecture
edited by
673 views

1 Answer

1 vote
 
Best answer

Here each element takes 1 byte ,

Block size=100 Byte each!

 each block can hold=100 elements of the array,

So total Number of Block required to hold the entire array is (80x80)/100=64 blocks

Now as given ,the cache capacity is also 64 blocks and "Data Cache is Initially Empty"



 Array is accessed twice

For the first access, there will be compulsory misses, we need to bring all of those blocks to cache

so in empty cache,we need to bring 64 blocke ..so there is 64 Misses

for second access, No misses occurs because 64 blocks are already in cache

so overall miss will be 64

More on Misses:http://meseec.ce.rit.edu/eecc551-winter2001/551-1-30-2002.pdf


selected by
0

Could you explain it like this example: https://gateoverflow.in/20086/page-replacement

I have drawn the diagram as:

Now how will other addresses be assigned?

Related questions

3 votes
1 answer
3
509 views
Consider a n-way cache with 'x blocks of 64 words each. The main memory of the system is having 8 million words. Size of the tag field is 16 bits and additional memory required for tags is 1024 bytes. What will be the values of n and x respectively? Answer 256 512
asked Jan 30, 2019 in CO and Architecture Ram Swaroop 509 views
2 votes
1 answer
4
491 views
A CPU cache is organized into 2 level cache L1 and L2 The penalty for L1 cache miss and L2 cache miss are 60 and 30 respectively for 1200 memory references The hit time of L1 and L2 are 5 and 10 clock cycles and penalty for L2 cache miss to main memory is 70 clock cycles. The average memory access time will be
asked Jan 29, 2019 in CO and Architecture Ram Swaroop 491 views
...