Memory basic concept hierarchy and cache memory 1
Download as PPTX, PDF2 likes440 views
The lecture focuses on memory technologies, their hierarchical organization, and the principle of locality, alongside analysis of cache access mechanisms. It discusses various memory types, such as SRAM, DRAM, and flash memory, while detailing aspects like speed, cost, and data transfer. Additionally, it examines cache architecture, including direct-mapped and fully associative caches, with various examples and questions posed for understanding.
Memory basic concept hierarchy and cache memory 1
- 1. MEMORY UNIT-3 Mohammad Asif Iqbal Assistant Professor, Deptt of ECE, JETGI, Barabanki
- 3. WHAT WE WILL LEARN IN THIS LECTURE Memory technologies Hierarchal organization Principle of locality Analysis of hierarchy Simple case organizations
- 4. TYPICAL SPECIFICATIONS OF COMPUTERS TODAY
- 5. MEMORY TECHNOLOGIES SEMICONDUCTOR Register SRAM DRAM FLASH MAGNETIC FDD HDD OPTICAL CD DVD Random access Random + sequentional
- 6. HIERARCHAL STRUCTURE SPEED CPU SIZE COST/ BIT Fastest Memory Slowest Highest Fastest Memory Memory Biggest Lowest
- 7. DATA TRANSFER BETWEEN LEVELS
- 8. PRINCIPLE OF LOCALITY Temporal locality References repeated in time The concept that a resource that is referenced at one point in time will be referenced again sometime in the near future. Spatial locality Reference repeated in space Special case: sequential locality The concept that likelihood of referencing a resource is higher if a resource near it was just referenced.
- 10. CACHE ACCESS EXAMPLE. Before the reference to Xn After the reference to Xn X4 X4 X1 X1 Xn-2 Xn-2 Xn-1 Xn-1 X2 X2 X3 X3
- 13. CACHE WITH 4 WORD BLOCKS
- 14. QUESTIONS MM SIZE CACHE SIZE BLOCK SIZE TAG BITS TAG DIRECTOR Y 128 KB 16KB 256 B ------- ------- 32 GB 32KB 1KB ------- ------- ------- 512 KB 1 KB 7 -------
- 15. MORE FLEXIBLE BLOCK ARRANGEMENT
- 16. FULLY ASSOCIATIVE CACHE Question:- MM:- 32 GB BLOCK:- 32 KB TAG= ? Propagation Delay Of Comparator=10 K ns PD of OR Gate= 10 ns HL=?
- 17. SET ASSOCIATIVE CACHE MM SIZE CACHE SIZE BLOCK SIZE TAG BITS TAG DIRESTOR Y SET ASSOCIATIV E 128 KB 16KB 256B ----- ----- 2-WAY 32GB 32KB 1KB ----- ----- 4-WAY ----- 512KB 1KB 7 ------ 8-WAY
- 18. 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 52 53 54 55 40 41 42 43 12 13 14 15 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 01 11 10 00 01 00 11 01 11 11 11 01 01 10 10 11 MORE EXAMPLE OF DIRECT MAPPING TAG LINE BO
- 19. MORE EXAMPLE OF SET ASSOCIATIVE MAPPING 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 0 1 2 3 4 5 6 7 0,4 1,5 2,6 3,7 TAG SET BO
- 20. MORE EXAMPLE OF FULLY ASSOCIATIVE MAPPING 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 TAG BO
- 21. THANK YOU!
Editor's Notes
- #3: “Ant Colony Optimization (ACO) studies artificial systems that take inspiration from the behavior of real ant colonies and which are used to solve discrete optimization problems.”