Giving credit where credit is due

Similar documents
CISC 360. Cache Memories Nov 25, 2008

Cache Memories. EL2010 Organisasi dan Arsitektur Sistem Komputer Sekolah Teknik Elektro dan Informatika ITB 2010

Cache Memories October 8, 2007

Systems I. Optimizing for the Memory Hierarchy. Topics Impact of caches on performance Memory hierarchy considerations

Cache Memories. Cache Memories Oct. 10, Inserting an L1 Cache Between the CPU and Main Memory. General Org of a Cache Memory

ν Hold frequently accessed blocks of main memory 2 CISC 360, Fa09 Cache is an array of sets. Each set contains one or more lines.

Cache memories The course that gives CMU its Zip! Cache Memories Oct 11, General organization of a cache memory

Cache Memories. Topics. Next time. Generic cache memory organization Direct mapped caches Set associative caches Impact of caches on performance

211: Computer Architecture Summer 2016

Last class. Caches. Direct mapped

Cache memories are small, fast SRAM based memories managed automatically in hardware.

Today Cache memory organization and operation Performance impact of caches

Memory Hierarchy. Announcement. Computer system model. Reference

The course that gives CMU its Zip! Memory System Performance. March 22, 2001

Example. How are these parameters decided?

Agenda Cache memory organization and operation Chapter 6 Performance impact of caches Cache Memories

Today. Cache Memories. General Cache Concept. General Cache Organization (S, E, B) Cache Memories. Example Memory Hierarchy Smaller, faster,

Denison University. Cache Memories. CS-281: Introduction to Computer Systems. Instructor: Thomas C. Bressoud

Computer Organization: A Programmer's Perspective

Carnegie Mellon. Cache Memories. Computer Architecture. Instructor: Norbert Lu1enberger. based on the book by Randy Bryant and Dave O Hallaron

Cache Memories /18-213/15-513: Introduction to Computer Systems 12 th Lecture, October 5, Today s Instructor: Phil Gibbons

Memory Hierarchy. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

Carnegie Mellon. Cache Memories

CS 33. Caches. CS33 Intro to Computer Systems XVIII 1 Copyright 2017 Thomas W. Doeppner. All rights reserved.

Memory Hierarchy. Computer Systems Organization (Spring 2017) CSCI-UA 201, Section 3. Instructor: Joanna Klukowska

Memory Hierarchy. Cache Memory Organization and Access. General Cache Concept. Example Memory Hierarchy Smaller, faster,

High-Performance Parallel Computing

Cache Memories. Andrew Case. Slides adapted from Jinyang Li, Randy Bryant and Dave O Hallaron

Cache Memories. From Bryant and O Hallaron, Computer Systems. A Programmer s Perspective. Chapter 6.

Cache Memories : Introduc on to Computer Systems 12 th Lecture, October 6th, Instructor: Randy Bryant.

Memory Hierarchy. Instructor: Adam C. Champion, Ph.D. CSE 2431: Introduction to Operating Systems Reading: Chap. 6, [CSAPP]

Cache memories are small, fast SRAM-based memories managed automatically in hardware. Hold frequently accessed blocks of main memory

Lecture 12. Memory Design & Caches, part 2. Christos Kozyrakis Stanford University

CSCI-UA.0201 Computer Systems Organization Memory Hierarchy

Cache Memories. Lecture, Oct. 30, Bryant and O Hallaron, Computer Systems: A Programmer s Perspective, Third Edition

Introduction to Computer Systems

Introduction to Computer Systems

CISC 360. Cache Memories Exercises Dec 3, 2009

Roadmap. Java: Assembly language: OS: Machine code: Computer system:

Lecture 15: Caches and Optimization Computer Architecture and Systems Programming ( )

Systems Programming and Computer Architecture ( ) Timothy Roscoe

Chapter 6 Caches. Computer System. Alpha Chip Photo. Topics. Memory Hierarchy Locality of Reference SRAM Caches Direct Mapped Associative

Computer Organization - Overview

211: Computer Architecture Summer 2016

Memory hierarchies: caches and their impact on the running time

CSCI 402: Computer Architectures. Performance of Multilevel Cache

CS429: Computer Organization and Architecture

Locality. CS429: Computer Organization and Architecture. Locality Example 2. Locality Example

Lecture 17: Memory Hierarchy and Cache Coherence Concurrent and Mul7core Programming

EE108B Lecture 13. Caches Wrap Up Processes, Interrupts, and Exceptions. Christos Kozyrakis Stanford University

CS 240 Stage 3 Abstractions for Practical Systems

CS429: Computer Organization and Architecture

Cache Performance II 1

Announcements. EE108B Lecture 13. Caches Wrap Up Processes, Interrupts, and Exceptions. Measuring Performance. Memory Performance

CS3350B Computer Architecture

CS 261 Fall Caching. Mike Lam, Professor. (get it??)

F28HS Hardware-Software Interface: Systems Programming

write-through v. write-back write-through v. write-back write-through v. write-back option 1: write-through write 10 to 0xABCD CPU RAM Cache ABCD: FF

Giving credit where credit is due

Problem: Processor Memory BoJleneck

Measurement tools and techniques

+ Random-Access Memory (RAM)

Caches Concepts Review

Memory Hierarchy & Caching. CS 351: Systems Programming Michael Saelee

Problem: Processor- Memory Bo<leneck

Computer Systems. Memory Hierarchy. Han, Hwansoo

How to Write Fast Numerical Code

Cache Memory and Performance

Caches Spring 2016 May 4: Caches 1

Computer Architecture and System Software Lecture 09: Memory Hierarchy. Instructor: Rob Bergen Applied Computer Science University of Winnipeg

How to Write Fast Numerical Code

CS241 Computer Organization Spring Principle of Locality

Memories. CPE480/CS480/EE480, Spring Hank Dietz.

SE-292 High Performance Computing. Memory Hierarchy. R. Govindarajan Memory Hierarchy

Read-only memory (ROM): programmed during production Programmable ROM (PROM): can be programmed once SRAM (Static RAM)

A Crash Course in Compilers for Parallel Computing. Mary Hall Fall, L2: Transforms, Reuse, Locality

L2 cache provides additional on-chip caching space. L2 cache captures misses from L1 cache. Summary

Princeton University. Computer Science 217: Introduction to Programming Systems. The Memory/Storage Hierarchy and Virtual Memory

Donn Morrison Department of Computer Science. TDT4255 Memory hierarchies

Advanced Caching Techniques

CS377P Programming for Performance Single Thread Performance Caches I

CS/ECE 250 Computer Architecture

Copyright 2012, Elsevier Inc. All rights reserved.

CS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2014 Lecture 14

211: Computer Architecture Summer 2016

Advanced Architecture

Lecture 2. Memory locality optimizations Address space organization

CS356: Discussion #9 Memory Hierarchy and Caches. Marco Paolieri Illustrations from CS:APP3e textbook

Caches III. CSE 351 Spring Instructor: Ruth Anderson

Advanced Caching Techniques

Introduction to Computer Systems: Semester 1 Computer Architecture

Random-Access Memory (RAM) CISC 360. The Memory Hierarchy Nov 24, Conventional DRAM Organization. SRAM vs DRAM Summary.

Cache Impact on Program Performance. T. Yang. UCSB CS240A. 2017

CS 33. Architecture and Optimization (3) CS33 Intro to Computer Systems XVI 1 Copyright 2018 Thomas W. Doeppner. All rights reserved.

CS3350B Computer Architecture

Advanced Memory Organizations

Parallel Processing. Parallel Processing. 4 Optimization Techniques WS 2018/19

Computer Systems CSE 410 Autumn Memory Organiza:on and Caches

LECTURE 4: LARGE AND FAST: EXPLOITING MEMORY HIERARCHY

LECTURE 10: Improving Memory Access: Direct and Spatial caches

Transcription:

CSCE 23J Computer Organization Cache Memories Dr. Steve Goddard goddard@cse.unl.edu http://cse.unl.edu/~goddard/courses/csce23j Giving credit where credit is due Most of slides for this lecture are based on slides created by Drs. Bryant and O Hallaron, Carnegie Mellon University. I have modified them and added new slides. 2 Page

Topics Generic cache memory organization Direct mapped caches Set associative caches Impact of caches on performance 3 Cache Memories Cache memories are small, fast SRAM-based memories managed automatically in hardware. Hold frequently accessed blocks of main memory CPU looks first for data in L, then in L2, then in main memory. Typical bus structure: CPU chip register file L ALU cache cache bus system bus memory bus L2 cache bus interface I/O bridge main memory 4 Page 2

Inserting an L Cache Between the CPU and Main Memory The transfer unit between the CPU register file and the cache is a 4-byte block. line line The transfer unit between the cache and main memory is a 4-word block (6 bytes). block block 2 block 3 a b c d... p q r s... w x y z... The tiny, very fast CPU register file has room for four 4-byte words. The small fast L cache has room for two 4-word blocks. The big slow main memory has room for many 4-word blocks. 5 General Org of a Cache Memory Cache is an array of sets. Each set contains one or more lines. Each line holds a block of data. S = 2 s sets set : set : bit per line t bits per line B = 2 b bytes per B B B B E lines per set B set S-: B Cache size: C = B x E x S data bytes 6 Page 3

Addressing Caches Address A: t bits s bits b bits set : v v B B m- <> <set index> <block offset> set : set S-: v v v v B B B B The word at address A is in the cache if the bits in one of the <> lines in set <set index> match <>. The word contents begin at offset <block offset> bytes from the beginning of the block. 7 Direct-Mapped Cache Simplest kind of cache Characterized by exactly one line per set. set : E= lines per set set : set S-: 8 Page 4

Accessing Direct-Mapped Caches Set selection Use the set index bits to determine the set of interest. set : selected set set : m- t bits s bits b bits set index block offset set S-: 9 Accessing Direct-Mapped Caches Line matching and word selection Line matching: Find a line in the selected set with a matching Word selection: Then extract the word =? () The bit must be set selected set (i): 2 3 4 5 6 7 w w w 2 w 3 (2) The bits in the cache line must match the bits in the address m- =? t bits s bits b bits i set index block offset (3) If () and (2), then cache hit, and block offset selects starting byte. Page 5

Direct-Mapped Cache Simulation t= s=2 b= x xx x M=6 byte addresses, B=2 bytes/block, S=4 sets, E= entry/set Address trace (reads): [ 2 ], [ 2 ], 3 [ 2 ], 8 [ 2 ], [ 2 ] () [ 2 ] (miss) v data m[] M[-] m[] (3) 3 [ 2 ] (miss) v data m[] M[-] m[] m[3] M[2-3] m[2] (4) 8 [ 2 ] (miss) v data m[9] M[8-9] m[8] M[2-3] (5) [ 2 ] (miss) v data m[] M[-] m[] m[3] M[2-3] m[2] Why Use Middle Bits as Index? 4-line Cache High-Order Bit Indexing Adjacent memory lines would map to same cache entry Poor use of spatial locality Middle-Order Bit Indexing Consecutive memory lines map to different cache lines Can hold C-byte region of address space in cache at one time High-Order Bit Indexing Middle-Order Bit Indexing 2 Page 6

Set Associative Caches Characterized by more than one line per set set : E=2 lines per set set : set S-: 3 Accessing Set Associative Caches Set selection identical to direct-mapped cache set : Selected set set : m- t bits s bits b bits set index block offset set S-: 4 Page 7

Accessing Set Associative Caches Line matching and word selection must compare the in each line in the selected set. =? () The bit must be set. 2 3 4 5 6 7 selected set (i): w w w 2 w 3 (2) The bits in one of the cache lines must match the bits in the address m- =? t bits s bits b bits i set index block offset (3) If () and (2), then cache hit, and block offset selects starting byte. 5 Multi-Level Caches Options: separate data and instruction caches, or a unified cache Processor Regs L d-cache L i-cache Unified L2 Cache Memory disk size: speed: $/Mbyte: line size: 2 B 3 ns 8-64 KB 3 ns 8 B 32 B larger, slower, cheaper -4MB SRAM 6 ns $/MB 32 B 28 MB DRAM 6 ns $.5/MB 8 KB 3 GB 8 ms $.5/MB 6 Page 8

Intel Pentium Cache Hierarchy Regs. L Data cycle latency 6 KB 4-way assoc Write-through 32B lines L Instruction 6 KB, 4-way 32B lines L2 Unified 28KB--2 MB 4-way assoc Write-back Write allocate 32B lines Main Memory Up to 4GB Processor Chip 7 Cache Performance Metrics Miss Rate Fraction of memory references not found in cache (misses/references) Typical numbers: 3-% for L can be quite small (e.g., < %) for L2, depending on size, etc. Hit Time Time to deliver a line in the cache to the processor (includes time to determine whether the line is in the cache) Typical numbers: clock cycle for L 3-8 clock cycles for L2 Miss Penalty Additional time required because of a miss Typically 25- cycles for main memory 8 Page 9

Writing Cache Friendly Code Repeated references to variables are good (temporal locality) Stride- reference patterns are good (spatial locality) Examples: cold cache, 4-byte words, 4-word s int sumarrayrows(int a[m][n]) { int i, j, sum = ; int sumarraycols(int a[m][n]) { int i, j, sum = ; for (i = ; i < M; i++) for (j = ; j < N; j++) sum += a[i][j]; return sum; for (j = ; j < N; j++) for (i = ; i < M; i++) sum += a[i][j]; return sum; Miss rate = /4 = 25% Miss rate = % 9 The Memory Mountain Read throughput (read bandwidth) Number of bytes read from memory per second (MB/s) Memory mountain Measured read throughput as a function of spatial and temporal locality. Compact way to characterize memory system performance. 2 Page

Memory Mountain Test Function /* The test function */ void test(int elems, int stride) { int i, result = ; volatile int sink; for (i = ; i < elems; i += stride) result += data[i]; sink = result; /* So compiler doesn't optimize away the loop */ /* Run test(elems, stride) and return read throughput (MB/s) */ double run(int size, int stride, double Mhz) { double cycles; int elems = size / sizeof(int); test(elems, stride); /* warm up the cache */ cycles = fcyc2(test, elems, stride, ); /* call test(elems,stride) */ return (size / stride) / (cycles / Mhz); /* convert cycles to MB/s */ 2 Memory Mountain Main Routine /* mountain.c - Generate the memory mountain. */ #define MINBYTES ( << ) /* Working set size ranges from KB */ #define MAXBYTES ( << 23) /*... up to 8 MB */ #define MAXSTRIDE 6 /* Strides range from to 6 */ #define MAXELEMS MAXBYTES/sizeof(int) int data[maxelems]; /* The array we'll be traversing */ int main() { int size; /* Working set size (in bytes) */ int stride; /* Stride (in array elements) */ double Mhz; /* Clock frequency */ init_data(data, MAXELEMS); /* Initialize each element in data to */ Mhz = mhz(); /* Estimate the clock frequency */ for (size = MAXBYTES; size >= MINBYTES; size >>= ) { for (stride = ; stride <= MAXSTRIDE; stride++) printf("%.f\t", run(size, stride, Mhz)); printf("\n"); exit(); 22 Page

The Memory Mountain read throughput (MB/s) Slopes of Spatial Locality 2 8 6 4 2 xe L2 L Pentium III Xeon 55 MHz 6 KB on-chip L d-cache 6 KB on-chip L i-cache 52 KB off-chip unified L2 cache Ridges of Temporal Locality s s3 s5 mem 8k 2k stride (words) s7 s9 s s3 s5 8m 2m 52k 28k 32k working set size (bytes) 23 Ridges of Temporal Locality Slice through the memory mountain with stride= illuminates read throughputs of different caches and memory 2 main memory region L2 cache region L cache region read througput (MB/s) 8 6 4 2 8m 4m 2m 24k 52k 256k 28k 64k 32k 6k 8k 4k 2k k working set size (bytes) 24 Page 2

A Slope of Spatial Locality Slice through memory mountain with size=256kb shows size. 8 7 read throughput (MB/s) 6 5 4 3 2 one access per cache line s s2 s3 s4 s5 s6 s7 s8 s9 s s s2 s3 s4 s5 s6 stride (words) 25 Matrix Multiplication Example Major Cache Effects to Consider Total cache size Exploit temporal locality and keep the working set small (e.g., by using blocking) /* ijk */ Variable sum Block size for (i=; i<n; i++) { held in register Exploit spatial locality for (j=; j<n; j++) { sum =.; for (k=; k<n; k++) Description: Multiply N x N matrices sum += a[i][k] * b[k][j]; c[i][j] = sum; O(N3) total operations Accesses N reads per source element N values summed per destination» but may be able to hold in register 26 Page 3

Miss Rate Analysis for Matrix Multiply Assume: Line size = 32B (big enough for 4 64-bit words) Matrix dimension (N) is very large Approximate /N as. Cache is not even big enough to hold multiple rows Analysis Method: Look at access pattern of inner loop k j j i k i A B C 27 Layout of C Arrays in Memory (review) C arrays allocated in row-major order each row in contiguous memory locations Stepping through columns in one row: for (i = ; i < N; i++) sum += a[][i]; accesses successive elements if block size (B) > 4 bytes, exploit spatial locality compulsory miss rate = 4 bytes / B Stepping through rows in one column: for (i = ; i < n; i++) sum += a[i][]; accesses distant elements no spatial locality! compulsory miss rate = (i.e. %) 28 Page 4

Matrix Multiplication (ijk) /* ijk */ for (i=; i<n; i++) { for (j=; j<n; j++) { sum =.; for (k=; k<n; k++) sum += a[i][k] * b[k][j]; c[i][j] = sum; Misses per Inner Loop Iteration:.25.. Inner loop: (i,*) (*,j) (i,j) Row-wise Fixed 29 Matrix Multiplication (jik) /* jik */ for (j=; j<n; j++) { for (i=; i<n; i++) { sum =.; for (k=; k<n; k++) sum += a[i][k] * b[k][j]; c[i][j] = sum Misses per Inner Loop Iteration:.25.. Inner loop: (i,*) (*,j) (i,j) Row-wise Columnwise Columnwise Fixed 3 Page 5

Matrix Multiplication (kij) /* kij */ for (k=; k<n; k++) { for (i=; i<n; i++) { r = a[i][k]; for (j=; j<n; j++) c[i][j] += r * b[k][j]; Inner loop: (i,k) (k,*) (i,*) Fixed Row-wise Row-wise Misses per Inner Loop Iteration:..25.25 3 Matrix Multiplication (ikj) /* ikj */ for (i=; i<n; i++) { for (k=; k<n; k++) { r = a[i][k]; for (j=; j<n; j++) c[i][j] += r * b[k][j]; Inner loop: (i,k) (k,*) (i,*) Fixed Row-wise Row-wise Misses per Inner Loop Iteration:..25.25 32 Page 6

Matrix Multiplication (jki) /* jki */ for (j=; j<n; j++) { for (k=; k<n; k++) { r = b[k][j]; for (i=; i<n; i++) c[i][j] += a[i][k] * r; Inner loop: (*,k) (*,j) (k,j) Misses per Inner Loop Iteration:... Column - wise Fixed 33 Matrix Multiplication (kji) /* kji */ for (k=; k<n; k++) { for (j=; j<n; j++) { r = b[k][j]; for (i=; i<n; i++) c[i][j] += a[i][k] * r; Misses per Inner Loop Iteration:... Inner loop: (*,k) (k,j) (*,j) Fixed Columnwise Columnwise Columnwise 34 Page 7

Summary of Matrix Multiplication ijk (& jik): 2 loads, stores misses/iter =.25 kij (& ikj): 2 loads, store misses/iter =.5 jki (& kji): 2 loads, store misses/iter = 2. for (i=; i<n; i++) { for (j=; j<n; j++) { sum =.; for (k=; k<n; k++) sum += a[i][k] * b[k][j]; c[i][j] = sum; for (k=; k<n; k++) { for (i=; i<n; i++) { r = a[i][k]; for (j=; j<n; j++) c[i][j] += r * b[k][j]; for (j=; j<n; j++) { for (k=; k<n; k++) { r = b[k][j]; for (i=; i<n; i++) c[i][j] += a[i][k] * r; 35 Pentium Matrix Multiply Performance Miss rates are helpful but not perfect predictors. Code scheduling matters, too. 6 5 Cycles/iteration 4 3 2 kji jki kij ikj jik ijk 25 5 75 25 5 75 2 225 25 275 3 325 35 375 4 Array size (n) 36 Page 8

Improving Temporal Locality by Blocking Example: Blocked matrix multiplication block (in this context) does not mean. Instead, it mean a sub-block within the matrix. Example: N = 8; sub-block size = 4 A A 2 A 2 A 22 X B B 2 B 2 B 22 = C C 2 C 2 C 22 Key idea: Sub-blocks (i.e., A xy ) can be treated just like scalars. C = A B + A 2 B 2 C 2 = A B 2 + A 2 B 22 C 2 = A 2 B + A 22 B 2 C 22 = A 2 B 2 + A 22 B 22 37 Blocked Matrix Multiply (bijk) for (jj=; jj<n; jj+=bsize) { for (i=; i<n; i++) for (j=jj; j < min(jj+bsize,n); j++) c[i][j] =.; for (kk=; kk<n; kk+=bsize) { for (i=; i<n; i++) { for (j=jj; j < min(jj+bsize,n); j++) { sum =. for (k=kk; k < min(kk+bsize,n); k++) { sum += a[i][k] * b[k][j]; c[i][j] += sum; 38 Page 9

Blocked Matrix Multiply Analysis Innermost loop pair multiplies a X bsize sliver of A by a bsize X bsize block of B and accumulates into X bsize sliver of C Loop over i steps through n row slivers of A & C, using same B for (i=; i<n; i++) { for (j=jj; j < min(jj+bsize,n); j++) { sum =. for (k=kk; k < min(kk+bsize,n); k++) { sum += a[i][k] * b[k][j]; Innermost c[i][j] += sum; Loop Pair kk jj jj i row sliver accessed bsize times block reused n times in succession kk i Update successive elements of sliver 39 Pentium Blocked Matrix Multiply Performance Blocking (bijk and bikj) improves performance by a factor of two over unblocked versions (ijk and jik) relatively insensitive to array size. 6 5 Cycles/iteration 4 3 2 25 5 75 25 5 75 2 Array size (n) 225 25 275 3 325 35 375 4 kji jki kij ikj jik ijk bijk (bsize = 25) bikj (bsize = 25) 4 Page 2

Concluding Observations Programmer can optimize for cache performance How data structures are organized How data are accessed Nested loop structure Blocking is a general technique All systems favor cache friendly code Getting absolute optimum performance is very platform specific Cache sizes, line sizes, associativities, etc. Can get most of the advane with generic code Keep working set reasonably small (temporal locality) Use small strides (spatial locality) 4 Page 2