This video is on set associative cache mapping. 2 way set associative cache mapping has been explained by using some referenced addresses. Then hit and miss of different address has been find. By which hit and miss ratio can be calculated. Firstly, offset bit, set bit, and tag bit has been calculated. All the addresses are converted from hex to binary. after that hit and miss is find. Lease recently used (LRU) cache is also explained and found.
Consider a 2-way set associative cache with total capacity 128 Byte, 12 bit address, and 32 Byte blocks. Initially cache is empty. Find the map addresses 2-way set associative cache and indicate whether hit or miss for the following memory referenced addresses?
2 way set associative cache mapping: Hit and Miss
Теги
Set associative cache2 way set associative cacheleast recently usedLRULRU cache2-way set associative cache with total capacity 128 Byteindicate whether hit or miss for the following memory referenced addresses2-way set associative mappingcache hit and miss Examplescache hit and miss problemscache miss and hitcache hit and missset associative mappingassociative cacheLRU cache replacement
