Computer architecture describes how components of a computer system are organized and linked together. Cache memory stores recently accessed data closer to the processor to improve performance. There are three main cache mapping techniques - direct mapping, associative mapping, and set associative mapping - which determine how data blocks are stored in cache. Cache replacement algorithms like LRU and FIFO are used to determine which block to remove when new data needs to be added to a full cache.

1. COMPUTER
ORGANIZATION & ARCHITECTURE
CACHE MEMORY
SAJEENA SHAJI

2. Computer Organization & Architecture
Computer Architecture is a functional description of the design
implementation and requirements of different components of a
computer.
Computer Organization provides information about the linking of
different operational attributes of the computer system.

4. Working Principle : Locality of references
Cache Memory

5. Cache Mapping Techniques
1. Direct Mapping
2. Associative Mapping
3. Set Associative Mapping

6. Direct Mapping

7. Direct Mapping Example Problems

8. Associative Mapping

9. Associative Mapping Example Problems

10. Set Associative Mapping

11. Problems

12. Cache Replacement Algorithm
1. Random
2. FIFO
3. LRU
4. LFU

13. Problem-1
Consider a fully associative cache with 8 cache blocks (numbered
0-7) and the following sequence of memory block requests : 4, 3,
25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7. If LRU replacement
policy is used, which cache block will have memory block 7?

14. THANK YOU