Mapping Function 3.0

Hi everyone, the Mapping Function 3.0 is arrived !! :D


MF 1.0 is for Direct Mapped function,
MF 2.0 is for Associative Mapped function.

So, MF 3.0 is for.....

Ya, MF 3.0 is for SET ASSOCIATIVE MAPPING FUNCTION !!!


As the name of this mapping function, the cache is divided into a number of sets.
And for each set, they contains a number of lines.
If that is 2 lines in one set, that's called 2 way set associative mapping.

Actually, we can mention that, the address structure of the direct mapped is almost same as the set associative mapping function.

The only difference is between the tag and word, for direct mapped is LINES ; for set associative mapping is SET.


Summary
のAddress Length = (s+w) bits
のBlock Size = Line Size = 2^(w) bytes/words
のNumber of blocks in memory = 2^(d)
のNumber of Lines in set = k ( k way set associative mapping)
のNumber of sets = v = 2^(d)
のNumber of lines in cache = k*v = k * 2^(d)
のSize of tag = (s-d) bits



Hooray~~
Finally, i finish all the mapping function.
For the new coming post, i will post how to solve the mapping question as well.
So, see your guys at next post~~

╭⌒╮¤　　　　　　`  
╭╭ ⌒╮ ●╭○╮　  
╰ ----╯/█∨█\ 　
 ~~~~~~~~∏~~~∏~~~~~~~~~~~


Youtube:K way set associative mapped function

                                                                                                               Written by--®æŋ