Lecture 5/9:Caches-Associative

Part 5 of a 9 part series on cache memories. Prof. Harry Porter, Portland State University. For more, visit cs.pdx.edu/~harry

[@RhoPGC]

Harry Porter and the Fully Associative Cache

[@jimmydarkful]

Bravissimo. L'unico video su TH-cam che ha spiegato in maniera DECENTE questa cosa.

[@Sid-ge9vb]

I really appreciate what you are doing

[@khellafkhaled6631]

you're a legend...thanks lot

[@andrewlarkins133]

Thank you, sir.

[@EnxiW]

Thanks a lot !

[@sebastianlacki8483]

Just to be clear there are 26 bits in the tag meaning 2^26 combinations of keys correct?

[@GokulNathXYZ]

Yes, for every position you will have either 0 or 1. Hence, 2*2*2... = 2^26.

[@andrewcekuta8627]

good videos!

[@malehakim248]

But 2^16 = 65,536, Why do we say the maximum addressable addresses are 64,000? I assumed if we had a word, which contains 4bytes. If i divide 64,000 by 32 bits, somewhere i start getting decimal values. I would assume i get whole number all the way through

[@vyor8837]

because 65,536 *is* the max.

[@samuelwallace7036]

You are correct, 6400 is based on an approximation that 2^10 = 1024 which is pretty close to 1000