Introduction to Computer Organisation — Week 5 [Sect 3][2419753]

Hey hey heyy.. Hello everyonee! 😄Hope you all are having a good day, and I would like to welcome you guys back to this week’s publish 🔥

So, for this week, we only had one class because is was public holiday for Deepavali on Thursday. On Tuesday, Dr. taught a new topic, Chapter 5: Cache Memory. Well, we had already learned a bit on cache memory in the past chapter, but we are going a bit detailed on it for this one. To recap a bit, cache memory is a small, high-speed storage close to the CPU that holds copies of frequently accessed data from main memory, speeding up data retrieval. Then we have memory hierachy, where it balances speed, capacity, and cost. Faster, smaller, and more expensive memory (cache) is used alongside larger, slower, and cheaper memory (main memory and external storage).

After that, we have Cache Principles where when the CPU reads data, it first checks the cache, if data is found (a cache hit), it is quickly retrieved. If not found (a cache miss), the needed data block is transferred from main memory to the cache. Next is Cache Mapping. There are three types, namely direct, associative and set associative. Last but not least, we learned on Cache Replacement Policies. In total there are four of them, but we will only be learning on two of them, which are Least Recently Used (LRU) and First-In, First-Out (FIFO).

So yeah, I guess that’s it for this week. Hoped you all enjoyed this week’s publish. See you next week. 🌟