A memory unit which is fast and small memory can be called as the cache memory. If the active portions of program or data are placed in fast and small memory, the average memory access time can be reduced. So it reduces the total execution time of the program. That is why such a fast and small memory is needed. The cache memory is the fastest component in memory hierarchy and approaches the speed of CPU component.
The performance of cache memory is frequently measured in terms of a quantity called hit ratio.
HIT RATIO = HIT / (HIT+MISS)
There is also mapping process. Mapping consists of three types, associative mapping, direct mapping, set-associative mapping.
The Replacement Algorithms :
1) LRU (Least Recently Used)
2) LFU (Least Frequently Used)
3) FIFO (First-In First-Out)
Introduction to Memory Organization
Chapter 12
Terms of Memory Unit
THAT'S ALL FROM ME. THANK YOU. ENJOY READING!
No comments:
Post a Comment