Presentation is loading. Please wait.

Presentation is loading. Please wait.

Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 31 – Caches II 2008-04-14 In this week’s Science, IBM researchers describe a new class.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 31 – Caches II 2008-04-14 In this week’s Science, IBM researchers describe a new class."— Presentation transcript:

1 inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 31 – Caches II 2008-04-14 In this week’s Science, IBM researchers describe a new class of data storage, called racetrack memory, combining the data storage density of disk with the ruggedness and speed of flash memory (no moving parts). They store bits as magnetic fields on nanowires. They don’t have a prototype, and say commercialization is about 7 years away. But, this could be something big! Lecturer SOE Dan Garcia www.technologyreview.com/Infotech/20553/ Hi to Yi Luo from Seattle, WA !

2 CS61C L31 Caches II (2) Garcia, Spring 2008 © UCB Direct-Mapped Cache Terminology  All fields are read as unsigned integers.  Index  specifies the cache index (or “row”/block)  Tag  distinguishes betw the addresses that map to the same location  Offset  specifies which byte within the block we want ttttttttttttttttt iiiiiiiiii oooo tagindex byte to checkto offset if have select within correct blockblock block

3 CS61C L31 Caches II (3) Garcia, Spring 2008 © UCB AREA (cache size, B) = HEIGHT (# of blocks) * WIDTH (size of one block, B/block) WIDTH (size of one block, B/block) HEIGHT (# of blocks) AREA (cache size, B) 2 (H+W) = 2 H * 2 W Tag Index Offset TIO Dan’s great cache mnemonic

4 CS61C L31 Caches II (4) Garcia, Spring 2008 © UCB Caching Terminology  When reading memory, 3 things can happen:  cache hit: cache block is valid and contains proper address, so read desired word  cache miss: nothing in cache in appropriate block, so fetch from memory  cache miss, block replacement: wrong data is in cache at appropriate block, so discard it and fetch desired data from memory (cache always copy)

5 CS61C L31 Caches II (5) Garcia, Spring 2008 © UCB  Ex.: 16KB of data, direct-mapped, 4 word blocks  Can you work out height, width, area?  Read 4 addresses 1. 0x00000014 2. 0x0000001C 3. 0x00000034 4. 0x00008014  Memory vals here: Address (hex) Value of Word Memory 00000010 00000014 00000018 0000001C a b c d... 00000030 00000034 00000038 0000003C e f g h 00008010 00008014 00008018 0000801C i j k l... Accessing data in a direct mapped cache

6 CS61C L31 Caches II (6) Garcia, Spring 2008 © UCB  4 Addresses:  0x00000014, 0x0000001C, 0x00000034, 0x00008014  4 Addresses divided (for convenience) into Tag, Index, Byte Offset fields 000000000000000000 0000000001 0100 000000000000000000 0000000001 1100 000000000000000000 0000000011 0100 000000000000000010 0000000001 0100 Tag Index Offset Accessing data in a direct mapped cache

7 CS61C L31 Caches II (7) Garcia, Spring 2008 © UCB 16 KB Direct Mapped Cache, 16B blocks  Valid bit: determines whether anything is stored in that row (when computer initially turned on, all entries invalid)... Valid Tag 0xc-f 0x8-b0x4-70x0-3 0 1 2 3 4 5 6 7 1022 1023... Index 0 0 0 0 0 0 0 0 0 0

8 CS61C L31 Caches II (8) Garcia, Spring 2008 © UCB 1. Read 0x00000014... Valid Tag 0 1 2 3 4 5 6 7 1022 1023...  000000000000000000 0000000001 0100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3

9 CS61C L31 Caches II (9) Garcia, Spring 2008 © UCB So we read block 1 (0000000001)... Valid Tag 0 1 2 3 4 5 6 7 1022 1023...  000000000000000000 0000000001 0100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3

10 CS61C L31 Caches II (10) Garcia, Spring 2008 © UCB No valid data... Valid Tag 0 1 2 3 4 5 6 7 1022 1023...  000000000000000000 0000000001 0100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3

11 CS61C L31 Caches II (11) Garcia, Spring 2008 © UCB So load that data into cache, setting tag, valid... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0dcba  000000000000000000 0000000001 0100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3

12 CS61C L31 Caches II (12) Garcia, Spring 2008 © UCB Read from cache at offset, return word b  000000000000000000 0000000001 0100... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba

13 CS61C L31 Caches II (13) Garcia, Spring 2008 © UCB 2. Read 0x0000001C = 0…00 0..001 1100... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000000 0000000001 1100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba

14 CS61C L31 Caches II (14) Garcia, Spring 2008 © UCB Index is Valid... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000000 0000000001 1100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba

15 CS61C L31 Caches II (15) Garcia, Spring 2008 © UCB Index valid, Tag Matches... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000000 0000000001 1100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba

16 CS61C L31 Caches II (16) Garcia, Spring 2008 © UCB Index Valid, Tag Matches, return d... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000000 0000000001 1100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba

17 CS61C L31 Caches II (17) Garcia, Spring 2008 © UCB 3. Read 0x00000034 = 0…00 0..011 0100... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000000 0000000011 0100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba

18 CS61C L31 Caches II (18) Garcia, Spring 2008 © UCB So read block 3... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000000 0000000011 0100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba

19 CS61C L31 Caches II (19) Garcia, Spring 2008 © UCB No valid data... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000000 0000000011 0100 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba

20 CS61C L31 Caches II (20) Garcia, Spring 2008 © UCB Load that cache block, return word f... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000000 0000000011 0100 1 0hgfe Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 dcba 0xc-f 0x8-b0x4-70x0-3

21 CS61C L31 Caches II (21) Garcia, Spring 2008 © UCB 4. Read 0x00008014 = 0…10 0..001 0100... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000010 0000000001 0100 1 0 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba hgfe

22 CS61C L31 Caches II (22) Garcia, Spring 2008 © UCB So read Cache Block 1, Data is Valid... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000010 0000000001 0100 1 0 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba hgfe

23 CS61C L31 Caches II (23) Garcia, Spring 2008 © UCB Cache Block 1 Tag does not match (0 != 2)... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 0  000000000000000010 0000000001 0100 1 0 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 dcba hgfe

24 CS61C L31 Caches II (24) Garcia, Spring 2008 © UCB Miss, so replace block 1 with new data & tag... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 2lkji  000000000000000010 0000000001 0100 1 0 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 0xc-f 0x8-b0x4-70x0-3 hgfe

25 CS61C L31 Caches II (25) Garcia, Spring 2008 © UCB And return word J... Valid Tag 0 1 2 3 4 5 6 7 1022 1023... 1 2  000000000000000010 0000000001 0100 1 0 Index Tag fieldIndex fieldOffset 0 0 0 0 0 0 0 0 lkji 0xc-f 0x8-b0x4-70x0-3 hgfe

26 CS61C L31 Caches II (26) Garcia, Spring 2008 © UCB Do an example yourself. What happens?  Chose from: Cache: Hit, Miss, Miss w. replace Values returned:a,b, c, d, e,..., k, l  Read address 0x00000030 ? 000000000000000000 0000000011 0000  Read address 0x0000001c ? 000000000000000000 0000000001 1100... Valid Tag 0x0-3 0x4-70x8-b0xc-f 0 1 2 3 4 5 6 7... 1 2lkji 1 0hgfe Index 0 0 0 0 0 0 Cache

27 CS61C L31 Caches II (27) Garcia, Spring 2008 © UCB Answers  0x00000030 a hit Index = 3, Tag matches, Offset = 0, value = e  0x0000001c a miss Index = 1, Tag mismatch, so replace from memory, Offset = 0xc, value = d  Since reads, values must = memory values whether or not cached:  0x00000030 = e  0x0000001c = d Address (hex) Value of Word Memory 00000010 00000014 00000018 0000001C a b c d... 00000030 00000034 00000038 0000003C e f g h 00008010 00008014 00008018 0000801C i j k l...

28 CS61C L31 Caches II (28) Garcia, Spring 2008 © UCB Administrivia  Faux Exam 3 in one week  Performance competition went up today!

29 CS61C L31 Caches II (29) Garcia, Spring 2008 © UCB Peer Instruction A. Mem hierarchies were invented before 1950. (UNIVAC I wasn’t delivered ‘til 1951) B. If you know your computer’s cache size, you can often make your code run faster. C. Memory hierarchies take advantage of spatial locality by keeping the most recent data items closer to the processor. ABC 0: FFF 1: FFT 2: FTF 3: FTT 4: TFF 5: TFT 6: TTF 7: TTT

30 CS61C L31 Caches II (30) Garcia, Spring 2008 © UCB Peer Instruction Answer ABC 0: FFF 1: FFT 2: FTF 3: FTT 4: TFF 5: TFT 6: TTF 7: TTT A.“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 accessible.” – von Neumann, 1946 B.Certainly! That’s call “tuning” C.“Most Recent” items  Temporal locality A. Mem hierarchies were invented before 1950. (UNIVAC I wasn’t delivered ‘til 1951) B. If you know your computer’s cache size, you can often make your code run faster. C. Memory hierarchies take advantage of spatial locality by keeping the most recent data items closer to the processor.

31 CS61C L31 Caches II (31) Garcia, Spring 2008 © UCB Peer Instruction 1. All caches take advantage of spatial locality. 2. All caches take advantage of temporal locality. 3. On a read, the return value will depend on what is in the cache. ABC 0: FFF 1: FFT 2: FTF 3: FTT 4: TFF 5: TFT 6: TTF 7: TTT

32 CS61C L31 Caches II (32) Garcia, Spring 2008 © UCB Peer Instruction Answer 1. All caches take advantage of spatial locality. 2. All caches take advantage of temporal locality. 3. On a read, the return value will depend on what is in the cache. T R U E F A L S E 1. Block size = 1, no spatial! 2. That’s the idea of caches; We’ll need it again soon. 3. It better not! If it’s there, use it. Oth, get from mem F A L S E ABC 0: FFF 1: FFT 2: FTF 3: FTT 4: TFF 5: TFT 6: TTF 7: TTT

33 CS61C L31 Caches II (33) Garcia, Spring 2008 © UCB And in Conclusion…  Mechanism for transparent movement of data among levels of a storage hierarchy  set of address/value bindings  address  index to set of candidates  compare desired address with tag  service hit or miss  load new block and binding on miss Valid Tag 0xc-f 0x8-b0x4-70x0-3 0 1 2 3... 1 0dcba 000000000000000000 0000000001 1100 address: tag index offset

Download ppt "Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 31 – Caches II 2008-04-14 In this week’s Science, IBM researchers describe a new class."

Similar presentations

© Karen Miller, 2011 1 What do we want from our computers?  correct results we assume this feature, but consider... who defines what is correct?  fast.

© Karen Miller, What do we want from our computers?  correct results we assume this feature, but consider... who defines what is correct?  fast.
CS 430 – Computer Architecture

CS 430 – Computer Architecture
Modified from notes by Saeid Nooshabadi COMP3221: Microprocessors and Embedded Systems Lecture 25: Cache - I Lecturer:

Modified from notes by Saeid Nooshabadi COMP3221: Microprocessors and Embedded Systems Lecture 25: Cache - I Lecturer:
CS61C L35 VM I (1) Garcia © UCB Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.

CS61C L35 VM I (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.
CS61C L32 Caches II (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #20: Caches 2 2005-07-26 Andy.

CS61C L32 Caches II (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #20: Caches Andy.
15-447 Computer ArchitectureFall 2007 © November 14th, 2007 Majd F. Sakr CS-447– Computer Architecture.

Computer ArchitectureFall 2007 © November 14th, 2007 Majd F. Sakr CS-447– Computer Architecture.
CS61C L31 Caches II (1) Garcia, Fall 2006 © UCB GPUs >> CPUs?  Many are using graphics processing units on graphics cards for high-performance computing.

CS61C L31 Caches II (1) Garcia, Fall 2006 © UCB GPUs >> CPUs?  Many are using graphics processing units on graphics cards for high-performance computing.
CS61C L22 Caches II (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia www.cs.berkeley.edu/~ddgarcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.

CS61C L22 Caches II (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
Memory Subsystem and Cache Adapted from lectures notes of Dr. Patterson and Dr. Kubiatowicz of UC Berkeley.

Memory Subsystem and Cache Adapted from lectures notes of Dr. Patterson and Dr. Kubiatowicz of UC Berkeley.
Lecturer PSOE Dan Garcia

Lecturer PSOE Dan Garcia
CS61C L23 Cache II (1) Chae, Summer 2008 © UCB Albert Chae, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #23 – Cache II.

CS61C L23 Cache II (1) Chae, Summer 2008 © UCB Albert Chae, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #23 – Cache II.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 32 – Caches III 2008-04-16 Prem Kumar of Northwestern has created a quantum inverter.

Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 32 – Caches III Prem Kumar of Northwestern has created a quantum inverter.
CS 61C L20 Caches I (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.

CS 61C L20 Caches I (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS61C L34 Virtual Memory I (1) Garcia, Spring 2007 © UCB 3D chips from IBM  IBM claims to have found a way to build 3D chips by stacking them together.

CS61C L34 Virtual Memory I (1) Garcia, Spring 2007 © UCB 3D chips from IBM  IBM claims to have found a way to build 3D chips by stacking them together.
CS 61C L24 VM II (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia www.cs.berkeley.edu/~ddgarcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.

CS 61C L24 VM II (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
Modified from notes by Saeid Nooshabadi

Modified from notes by Saeid Nooshabadi
CS61C L22 Caches III (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c/su06 CS61C : Machine Structures Lecture #22: Caches 3 2006-08-07 Andy.

CS61C L22 Caches III (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c/su06 CS61C : Machine Structures Lecture #22: Caches Andy.
COMP3221 lec33-Cache-I.1 Saeid Nooshabadi COMP 3221 Microprocessors and Embedded Systems Lectures 12: Cache Memory - I

COMP3221 lec33-Cache-I.1 Saeid Nooshabadi COMP 3221 Microprocessors and Embedded Systems Lectures 12: Cache Memory - I
CS61C L24 Cache III, VM I(1) Chae, Summer 2008 © UCB Albert Chae, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #24 – Cache.

CS61C L24 Cache III, VM I(1) Chae, Summer 2008 © UCB Albert Chae, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #24 – Cache.
CS61C L23 Caches I (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #23 Cache I.

CS61C L23 Caches I (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #23 Cache I.

Similar presentations

Ads by Google