Σχεδιασµός της Ιεραρχίας Μνήµης. Pedro Trancoso

Μέγεθος: px

Εμφάνιση ξεκινά από τη σελίδα:

Download "Σχεδιασµός της Ιεραρχίας Μνήµης. Pedro Trancoso"

Ἡρὼ Παπάζογλου
8 χρόνια πριν
Προβολές:

1 Σχεδιασµός της Ιεραρχίας Μνήµης Pedro Trancoso H&P Appendix C H&P Chapter 5 Μνήµη GIER Computer, Norway, ca Micron, Automata Processor,

2 Η Αρχή... Ideally one would desire an indefinitely large memory capacity such that any particular word would be immediately available We are forced to recognize the possibility of constructing a hierarchy of memories, each of which has greater capacity than the preceding but which is less quickly accessible A.W.Burks, H.H.Goldstein, and J. von Neumann (1946) 3 Το Κίνητρο... Διαφορά µεταξύ της επίδοσης του επεξεργαστή και της µνήµης: Παράδειγµα: Alpha 200MHz 340ns/5.0ns = 136 clk Alpha 300MHz 266ns/3.3ns = 320 clk Alpha 566MHz 180ns/1.7ns = 648 clk 4 2

forced to recognize the possibility of constructing a hierarchy of memories, each of which has greater capacity than the preceding but

3 Τυπική Ιεραρχία Μνήµης 5 Ορολογία για Κρυφή Μνήµη... Cache, fully associative, write allocate, virtual memory, dirty bit, unified cache, memory stall cycles, block offset, misses per instruction, direct mapped, write back, block, valid bit, data cache, locality, block address, hit time, address trace, write through, cache miss, set, instruction cache, page fault, random replacement, average memory access time, miss rate, index field, cache hit, n- way set associative, no-write allocate, page, leastrecently used, write buffer, miss penalty, tag field, write stall,

instruction, direct mapped, write back, block, valid bit, data cache, locality, block address, hit time, address trace, write through, cache

4 Αναθεώρηση Πρόσβαση στην Κρυφή Μνήµη Λόγος Επιτυχίας (Cache Hit / Hit Rate), Χρόνος Επιτυχίας (Hit Time) Λόγος Αποτυχίας (Cache Miss / Miss Rate), Ποινή Αποτυχίας (Miss Penalty) Τοπικότητα Χρονική Τοπικότητα (Temporal Locality) If an item is referenced, it will tend to be referenced again soon (e.g. loops, reuse) Χωρική Τοπικότητα (Spatial Locality) If an item is referenced, items whose addresses are close by tend to be referenced soon (e.g. straight line code, array accesses) 7 Επίδοση της Κρυφής Μνήµης CPU execution time = (CPU clock cycles + Memory stall cycles) x Clock cycle time Memory Stall Cycles = Number of misses x Miss penalty = IC x (Misses / Instruction) x Miss penalty = IC x (Memory Accesses / Instruction) x Miss rate x Miss penalty Memory stall Cycles = IC x Reads per instruction x Read miss rate x Read miss penalty + IC x Writes per instruction x Write miss rate x Write miss penalty (Misses / Instruction) = (Miss rate x Memory accesses) / Instruction count = Miss rate x (Memory accesses / Instruction) Παράδειγµα: CPI=1, load/store=50% instr, miss penalty=25clk, miss rate=2%, speedup=? 8 4

5 Κρυφή Μνήµη WORD BLOCK SET 9 Τέσσερις Ερωτήσεις 1. Που µπορούµε να βάλουµε ένα µπλοκ; (block placement) 2. Πως βρίσκουµε αν ένα µπλοκ είναι στην Κρυφή Μνήµη; (block identification) 3. Ποιο µπλοκ να αντικαταστήσω µετά από αποτυχία; (block replacement) 4. Τι γίνεται όταν γράφουµε; (write strategy) 10 5

Πως βρίσκουµε αν ένα µπλοκ είναι στην Κρυφή Μνήµη; (block identification) 3.

6 Που µπορούµε να βάλουµε ένα µπλοκ; Οργάνωση της Κρυφής Μνήµης: Direct Mapped: each block has only one place it can appear Mapping = (Block address) MOD (Number of blocks in cache) Fully Associative: a block can be placed anywhere Set Associative: a block can be placed on a restricted set of places Mapping = (Block address) MOD (Number of sets in cache) 11 Πως βρίσκουµε αν ένα µπλοκ είναι στην Κρυφή Μνήµη; Διεύθυνση: Block Offset Block Address: Index + Tag Λειτουργία: Index για να βρει που µπορεί να είναι, Tag για να βρει αν είναι το συγκεκριµένο µπλοκ (κάνουµε Tag Check για όλα τα πιθανά Tags), Offset για να βρει τα δεδοµένα µέσα στο µπλοκ 12 6

MOD (Number of sets in cache) 11 Πως βρίσκουµε αν ένα µπλοκ είναι στην Κρυφή Μνήµη; Διεύθυνση: Block Offset Block Address: Index + Tag Λειτουργία: Index για να

7 Ποίο µπλοκ να αντικαταστήσω µετά από αποτυχία; Direct Mapped: Μόνο ένα µπλοκ µπορεί να αντικατασταθεί Fully Associative: Random (απλό) Least-recently used (LRU) First in, first out (FIFO) 13 Τι γίνεται όταν γράφουµε; Οι περισσότερες προσβάσεις είναι διαβάσµατα (π.χ. 10% st και 37% ld για 5 SPECint2000) Για το read µπορούµε να διαβάζουµε το Tag και το µπλοκ ταυτόχρονα όµως για το write... Δυο επιλογές για να γράψουµε: Write through: write to both block in cache and in main memory Write back: write only to block in cache. Modified block written to main memory upon replacement (use dirty bit) 14 7

10% st και 37% ld για 5 SPECint2000) Για το read µπορούµε να διαβάζουµε το Tag και το µπλοκ ταυτόχρονα όµως για το write.

8 Τι γίνεται όταν γράφουµε; Δυο επιλογές όταν έχουµε write miss (write miss policy): Write allocate: block is allocated (read miss + write) No-write allocate: does not affect the cache, modifies only lower-level memory Βελτίωση... Write buffer: processor continues execution as data is written to buffer 15 Παράδειγµα: Alpha Data Cache 16 8

affect the cache, modifies only lower-level memory Βελτίωση.

9 Επίδοση της Κρυφής Μνήµης Average memory access time = ΑΜΑΤ = Hit time + Miss rate x Miss penalty Άσκηση: Ποια οργάνωση έχει χαµηλότερο λόγο αποτυχίας: 16KB instruction cache + 16KB data cache 32 KB unified cache Assume: 36% of instr are data transfers, hit=1clk, miss penalty=100clk, unified with single port means 1 extra clk if 2 requests, write-through with write buffer (ignore stalls to write buffer) 16KB I$ 3.82miss/1000instr 16KB D$ 40.9miss/1000instr 32KB U$ 43.3miss/1000instr 17 Επίδοση της Κρυφής Μνήµης CPU time = (CPU execution clock cycles + Memory stall clock cycles) x Clock cycle time Άσκηση: cache penalty=200clk, all instr take 1clk, average miss rate=2%, average memory refs per instr=1.5, average cache misses per 1000 instr=30. Performance with and without cache=? 18 9

write buffer) 16KB I$ 3.82miss/1000instr 16KB D$ 40.9miss/1000instr 32KB U$ 43.

10 Μείωση του Λόγου Αποτυχίας Types of Misses ( three C s ) Compulsory: first access. Also called cold-start misses or first-reference misses Capacity: cache can not contain all blocks Conflict: many blocks map to the same set. Also called collision misses or interference misses (fourth C: Coherence ) 19 Six Basic Cache Optimizations 1. Larger block size to reduce miss rate 2. Bigger caches to reduce miss rate 3. Higher associativity to reduce miss rate 4. Multilevel caches to reduce miss penalty 5. Giving priority to read misses over writes to reduce miss penalty 6. Avoiding address translation during indexing of the cache to reduce hit time 20 10

Also called collision misses or interference misses (fourth C: Coherence ) 19 Six Basic Cache Optimizations 1. Larger block size to reduce miss rate 2.

11 Larger Block Size Reduces compulsory misses (spatial locality) Increases miss penalty May increase conflict and capacity misses 21 Larger Block Size Άσκηση: Cache Size Block Size 4K 16K 64K 256K % 3.94% 2.04% 1.09% % 2.87% 1.35% 0.70% % 2.64% 1.06% 0.51% % 2.77% 1.02% 0.49% % 3.29% 1.15% 0.49% Assume memory system takes 80 clk overhead and then delivers 16 bytes every 2 clk (16 bytes in 82clk, 32 bytes in 84clk, ). Which block size has the smallest average memory access time for each cache size? 22 11

06% 0.51% 128 7.78% 2.77% 1.02% 0.49% 256 9.51% 3.29% 1.15% 0.

12 Bigger Caches Reduces miss rate 0.12 Total Miss Rate way 2-way 4-way 8-way 0 4KB 8KB 16KB 32KB 64KB 128KB 256KB 512KB Cache Size 23 Higher Associativity Reduces miss rate 0.12 Total Miss Rate way 2-way 4-way 8-way Cache Size 4KB 8KB 16KB 32KB 64KB 128KB 256KB 512KB 24 12

23 Higher Associativity Reduces miss rate 0.12 Total Miss Rate 0.1 0.08 0.06 0.

13 Multilevel Caches Πιο γρήγορη ή πιο µεγάλη ΚΜ; ΚΜ Δεύτερο επίπεδο (L2) Λόγοι αποτυχίας της L2: Local miss rate = miss L2 / access L2 Global miss rate = miss L2 / memory access Multilevel inclusion / exclusion AMAT = Hit time L1 + Miss rate L1 x Miss penalty L1 Miss penalty L1 = Hit time L2 + Miss rate L2 x Miss penalty L2 AMAT = Hit time L1 + Miss rate L1 x (Hit time L2 + Miss rate L2 x Miss penalty L2) AMAT = Misses per instruction L1 x Hit time L2 + Misses per instruction L2 x Miss penalty L2 25 Giving priority to read misses over writes Προτεραιότητα για read misses έναντι writes Εξυπηρετώ read πριν από το τέλος του write Προβλήµατα; 26 13

AMAT = Hit time L1 + Miss rate L1 x (Hit time L2 + Miss rate L2 x Miss penalty L2) AMAT = Misses per instruction L1 x Hit time L2 + Misses per instruction L2 x

14 Avoiding Address Translation Virtually addressed cache Problems: Protection, Process switch, Operating Systems/User programs aliases Virtually indexed, physically tagged cache Problem: no bigger than a page size only with associativity 25.0% Miss Rate 20.0% 15.0% 10.0% 5.0% Purge PIDs Uniprocess 0.0% 2KB 4KB 8KB 16KB 32KB 64KB 128KB 256KB 512KB 1024KB Cache Size 27 Summary of Basic Cache Optimizations Hit Miss Miss Hardware Technique time penalty rate complexity Comment Larger block size Trivial; P4 L2 128byte Larger cache size Widely used, for L2 Higher assoc Widely used Multilevel caches + 2 Costly hardware; Harder if L1 block!= L2 block; widely used RD priority over WR + 1 Widely used Avoiding addr Translation + 1 Widely used 28 14

0% 2KB 4KB 8KB 16KB 32KB 64KB 128KB 256KB 512KB 1024KB Cache Size 27 Summary of Basic Cache Optimizations Hit Miss Miss Hardware Technique time penalty rate complexity Comment Larger block

15 Eleven Advanced Optimizations of Cache Performance Reducing the hit time: small and simple caches, way prediction, and trace caches Increasing cache bandwidth: pipelined caches, multibanked caches, and non-blocking caches Reducing the miss penalty: critical word first and merging write buffers Reducing the miss rate: compiler optimizations Reducing the miss penalty or miss rate via parallelism: hardware prefetching and compiler prefetching 29 Μείωση του Χρόνου Επιτυχίας Μικρή και απλή Κρυφή Μνήµη L1 does not usually increase size with processor generation (16KB P III, 8KB P4!) Way Prediction and Pseudoassociative Caches Trace Caches Dynamic sequences of instructions including taken branches Intel NetBurst (Pentium 4) Problem: Code replication 30 15

rate via parallelism: hardware prefetching and compiler prefetching 29 Μείωση του Χρόνου Επιτυχίας Μικρή και απλή Κρυφή Μνήµη L1 does not usually increase size with processor generation

16 Αύξηση της Εύρος Ζώνης (1) Pipelined Cache Access Multibanked Caches Bank 0 Bank 1 Bank 2 Bank Αύξηση της Εύρος Ζώνης (2) Nonblocking caches to increase cache bandwidth Nonblocking or lockup-free cache: multiple outstanding requests (hit-under-miss, hit-under-multiple-miss, missunder-miss) Παράδειγµα: Which is more important for fp programs: two-way set assoc or hit-under-one-miss? For integer programs? Assume for 8KB data cache: miss rate for fp 11.4% for direct mapped, 10.7% for 2- way; miss rate for int 7.4% for direct mapped, 6.0% for 2-way. Miss penalty 16clk. Hit-under-one-miss reduces 76% for fp and 81% for int

Which is more important for fp programs: two-way set assoc or hit-under-one-miss? For integer programs? Assume for 8KB data cache: miss rate for fp 11.

17 Μείωση της ποινής αποτυχίας Χρήσιµη λέξη πρώτη και Early Restart Critical Word First: requests the missed word first Early Restart: restarts execution as soon as word arrives Συγχώνευση του write buffer Multiword writes are faster than multiple singleword writes Less probability of becoming full 33 Μείωση του Λόγου Αποτυχίας Βελτιώσεις από το Μεταγλωττιστή Loop Interchange for (j=0; j<100; j++) for (i=0; i<5000; i++) x[i][j] = 2*x[i][j] i=0 j=0 i=1 j=0 i=0 j=100 for (i=0; i<5000; i++) for (j=0; j<100; j++) x[i][j] = 2*x[i][j] i=0 j=0 i=1 j=0 i=0 j=

of becoming full 33 Μείωση του Λόγου Αποτυχίας Βελτιώσεις από το Μεταγλωττιστή Loop Interchange for (j=0; j<100; j++) for (i=0; i<5000; i++)

18 Μείωση του Λόγου Αποτυχίας Blocking = X = X 35 Μείωση της Ποινής ή του Λόγου Αποτυχίας µε Παραλληλισµό Hardware Prefetching of Instructions and Data Instruction Prefetch: on a miss fetch 2 blocks requested (goes to cache) and next block (goes to instruction stream buffer) Data Prefetch: calculates stride between accesses for prefetch (UltraSPARC III 8 simultaneous pref) Παράδειγµα: Which is the effective miss rate using prefetching? How much larger would a cache need to be to match the AMAT? Assume 64KB data cache, prefetching reduces 20% data miss rate, miss per 1000=36.9 (22% data references, 1 extra clk for prefetch buffer. Miss penalty 15clk 36 18

for prefetch (UltraSPARC III 8 simultaneous pref) Παράδειγµα: Which is the effective miss rate using prefetching?

19 Hardware Prefetching Performance improvement gap 1.45 mcf fam3d wupwise galgel facerec swim applu lucas 1.49 mgrid 1.97 equake SPECint2000 SPECfp Μείωση της Ποινής ή του Λόγου Αποτυχίας µε Παραλληλισµό Compiler-Controlled Prefetching Register or cache prefetch Faulting or nonfaulting (nonbinding) Helper threads: Pre-execution [Luk-ISCA2001] SUN Scouts [ISCA2004] 38 19

97 equake SPECint2000 SPECfp2000 37 Μείωση της Ποινής ή του Λόγου Αποτυχίας µε Παραλληλισµό

20 Cache Optimization Summary 39 Μεγαλύτερο Bandwidth της Κύριας Μνήµης Φαρδιά Κύρια Μνήµη 40 20

21 Μεγαλύτερο Bandwidth της Κύριας Μνήµης Simple Interleaved Memory Memory banks: read/write multiple words simultaneously Problems: new high capacity memory chips leads to fewer banks, difficult expansion Independent Memory Banks 41 Τεχνολογία Μνήµης DRAM Technology Multiplex address line: row access strobe (RAS), column access strobe (CAS) Dynamic: data refresh Packaging: dual inline memory modules (DIMM) SRAM Technology S = Static 42 21

22 Τεχνολογία Μνήµης 43 Τεχνολογία Μνήµης 44 22

23 Τεχνολογία Μνήµης 45 Τεχνολογία Μνήµης Embedded Processors Memory Technology ROM and Flash Improving Memory Performance in a Standard DRAM Chip Fast page mode Synchronous DRAM (SDRAM) Double Data Rate (DDR) 46 23

24 Τεχνολογία Μνήµης Improving Memory Performance via New DRAM Interface: RAMBUS Packet-switched bus (or split-transaction bus) 2 nd G: direct RDRAM: DRDRAM Packaging: RIMM Comparing RAMBUS with DDR SRAM RDRAM and DRDRAM are expensive! Performance? 47 RAMBUS RAMBUS 800MHz vs DDR266 RAMBUS 1200MHz vs DDR

25 Other results VIA Pro266 Intel 815E Intel 820 Results from: p3ddr/p3ddrmain.htm 49 Memory Latency! A Performance Comparison of Contemporary DRAM Architectures Vinodh Cuppu, Bruce Jacob, Brian Davis, and Trevor Mudge 50 25

26 Άλλα Θέµατα Virtual Memory Segments or pages? Translation Lookaside Buffer (TLB) Page size? Protection and Examples Alpha & IA Σχεδιασµός Ιεραρχίας Μνήµης Superscalar CPU and Number of Ports to the Cache Speculative Execution and the Memory System Combining the Instruction Cache with Instruction Fetch and Decode Mechanisms Embedded Computer Caches and Real-Time Performance Embedded Computer Caches and Power I/O and Consistency of Cached Data 52 26

27 Παράδειγµα: Alpha Παράδειγµα: Sony PlayStation 2 (Emotion Engine) 54 27

28 Παράδειγµα: Sony PlayStation 2 (Emotion Engine) 55 Παράδειγµα: Sun Fire

Σχετικά έγγραφα

Προχωρηµένα Θέµατα Αρχιτεκτονικής

Προχωρηµένα Θέµατα Αρχιτεκτονικής Memory Hierarchy Design. Λιούπης Ιεραρχία Μνήµης Τα προγράµµατα απαιτούν όλο και περισσότερη και πιο γρήγορη µνήµη Γρήγορη και µεγάλη µνήµη -> ακριβή Αυτό οδηγεί σε ιεραρχία