Presentation is loading. Please wait.

Presentation is loading. Please wait.

Tutorial Nine Cache CompSci 210 - Semester One 2016.

Published byGervais Hancock Modified over 6 years ago

Similar presentations

Presentation on theme: "Tutorial Nine Cache CompSci 210 - Semester One 2016."— Presentation transcript:

1 Tutorial Nine Cache CompSci Semester One 2016

2 Exercise 9.1 Answer the following questions for a direct-mapped cache with 8 cache lines, where each line has 1 word, each word is 2 bytes, and the address bus is 16 bits. How many bits are needed for the index field How many bits are there in the tag field How much data can be held in the cache

3 Exercise 9.1 Answer the following questions for a direct-mapped cache with 8 cache lines, where each line has 1 word, each word is 2 bytes, and the address bus is 16 bits. How many bits are needed for the index field How many bits are there in the tag field How much data can be held in the cache

4 Exercise 9.1 Answer the following questions for a direct-mapped cache with 8 cache lines, where each line has 1 word, each word is 2 bytes, and the address bus is 16 bits. How many bits are needed for the index field (3 bits) How many bits are there in the tag field How much data can be held in the cache

5 Exercise 9.1 Answer the following questions for a direct-mapped cache with 8 cache lines, where each line has 1 word, each word is 2 bytes, and the address bus is 16 bits. How many bits are needed for the index field (3 bits) How many bits are there in the tag field How much data can be held in the cache

6 Exercise 9.1 Answer the following questions for a direct-mapped cache with 8 cache lines, where each line has 1 word, each word is 2 bytes, and the address bus is 16 bits. How many bits are needed for the index field (3 bits) How many bits are there in the tag field (13 bits) How much data can be held in the cache

7 Exercise 9.1 Answer the following questions for a direct-mapped cache with 8 cache lines, where each line has 1 word, each word is 2 bytes, and the address bus is 16 bits. How many bits are needed for the index field (3 bits) How many bits are there in the tag field (13 bits) How much data can be held in the cache

8 Exercise 9.1 Answer the following questions for a direct-mapped cache with 8 cache lines, where each line has 1 word, each word is 2 bytes, and the address bus is 16 bits. How many bits are needed for the index field (3 bits) How many bits are there in the tag field (13 bits) How much data can be held in the cache (16 bytes)

9 Cache Trace Memory Access
Slot # Address Item 1 2 3 4 5 6 7 Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

10 Cache Trace Access 0x4503 Memory Access
Slot # Address Item 1 2 3 4 5 6 7 Access 0x4503 Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

11 Cache Trace Access 0x4503 0100 0101 0000 0011 Memory Access
Slot # Address Item 1 2 3 4 5 6 7 Access 0x4503 Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

12 Cache Trace Access 0x4503 0100 0101 0000 0011 Memory Access
Slot # Address Item 1 2 3 4 5 6 7 Access 0x4503 Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

13 Cache Trace Access 0x4503 Cache Miss! 0100 0101 0000 0011
Slot # Address Item 1 2 3 4 5 6 7 Access 0x4503 Cache Miss! Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

14 Cache Trace Access 0x4503 0100 0101 0000 0011 Memory Access
Slot # Address Item 1 2 3 0x4503 4 5 6 7 Access 0x4503 Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

15 Cache Trace Memory Access
Slot # Address Item 1 2 3 0x4503 4 5 6 7 Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

16 Cache Trace Access 0x450C Memory Access
Slot # Address Item 1 2 3 0x4503 4 5 6 7 Access 0x450C Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

17 Cache Trace Access 0x450C 0100 0101 0000 1100 Memory Access
Slot # Address Item 1 2 3 0x4503 4 5 6 7 Access 0x450C Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

18 Cache Trace Access 0x450C 0100 0101 0000 1100 Memory Access
Slot # Address Item 1 2 3 0x4503 4 5 6 7 Access 0x450C Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

19 Cache Trace Access 0x450C Cache Miss! 0100 0101 0000 1100
Slot # Address Item 1 2 3 0x4503 4 5 6 7 Access 0x450C Cache Miss! Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

20 Cache Trace Access 0x450C 0100 0101 0000 1100 Memory Access
Slot # Address Item 1 2 3 0x4503 4 0x450C 5 6 7 Access 0x450C Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

21 Cache Trace Access 0x4503 Memory Access
Slot # Address Item 1 2 3 0x4503 4 0x450C 5 6 7 Access 0x4503 Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

22 Cache Trace Access 0x4503 Cache Hit! Memory Access
Slot # Address Item 1 2 3 0x4503 1, 3 4 0x450C 5 6 7 Access 0x4503 Cache Hit! Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

23 Cache Trace Access 0x452B Memory Access
Slot # Address Item 1 2 3 0x4503 1, 3 4 0x450C 5 6 7 Access 0x452B Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

24 Cache Trace Access 0x452B Cache Miss! 0100 0101 0010 1011
Slot # Address Item 1 2 3 0x4503 1, 3 4 0x450C 5 6 7 Access 0x452B Cache Miss! Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

25 Cache Trace Access 0x5071 Memory Access
Slot # Address Item 1 2 3 0x452B 4 0x450C 5 6 7 Access 0x5071 Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

26 Cache Trace Access 0x5071 Cache Miss! Memory Access
Slot # Address Item 1 0x5071 5 2 3 0x452B 4 0x450C 6 7 Access 0x5071 Cache Miss! Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

27 Cache Trace Access 0x450C Cache Hit! Memory Access
Slot # Address Item 1 0x5071 5 2 3 0x452B 4 0x450C 2, 6 6 7 Access 0x450C Cache Hit! Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

28 Cache Trace Access 0x45FE Cache Miss! Memory Access
Slot # Address Item 1 0x5071 5 2 3 0x452B 4 0x450C 2, 6 6 0x45FE 7 Access 0x45FE Cache Miss! Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

29 Cache Trace Access 0x450C Cache Hit! Memory Access
Slot # Address Item 1 0x5071 5 2 3 0x452B 4 0x450C 2, 6, 8 6 0x45FE 7 Access 0x450C Cache Hit! Memory Access 0x4503, 0x450C, 0x4503, 0x452B, 0x5071, 0x450C, 0x45FE, 0x450C

Download ppt "Tutorial Nine Cache CompSci 210 - Semester One 2016."

Similar presentations

Cache Memory Exercises. Questions I Given: –memory is little-endian and byte addressable; memory size; –number of cache blocks, size of cache block –An.

Cache Memory Exercises. Questions I Given: –memory is little-endian and byte addressable; memory size; –number of cache blocks, size of cache block –An.
Practical Caches COMP25212 cache 3. Learning Objectives To understand: –Additional Control Bits in Cache Lines –Cache Line Size Tradeoffs –Separate I&D.

Practical Caches COMP25212 cache 3. Learning Objectives To understand: –Additional Control Bits in Cache Lines –Cache Line Size Tradeoffs –Separate I&D.
Using one level of Cache:

Using one level of Cache:
Homework 2 Review Cornell CS 3410. Calling Conventions int gcd(int x, int y) { int t, a = x, b = y; while(b != 0) { t = b; b = mod(a, b); a = t; } return.

Homework 2 Review Cornell CS Calling Conventions int gcd(int x, int y) { int t, a = x, b = y; while(b != 0) { t = b; b = mod(a, b); a = t; } return.
The Lord of the Cache Project 3. Caches Three common cache designs: Direct-Mapped store in exactly one cache line Fully Associative store in any cache.

The Lord of the Cache Project 3. Caches Three common cache designs: Direct-Mapped store in exactly one cache line Fully Associative store in any cache.
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.
6/12/2015Page 1 Exploiting Memory Hierarchy Chapter 7 B.Ramamurthy.

6/12/2015Page 1 Exploiting Memory Hierarchy Chapter 7 B.Ramamurthy.
How caches take advantage of Temporal locality

How caches take advantage of Temporal locality
Memory Hierarchies Exercises [7.1-7.3] Describe the general characteristics of a program that would exhibit very little spatial or temporal locality with.

Memory Hierarchies Exercises [ ] Describe the general characteristics of a program that would exhibit very little spatial or temporal locality with.
COMP3221: Microprocessors and Embedded Systems Lecture 26: Cache - II Lecturer: Hui Wu Session 2, 2005 Modified from.

COMP3221: Microprocessors and Embedded Systems Lecture 26: Cache - II Lecturer: Hui Wu Session 2, 2005 Modified from.
Configuration Information Discuss caches with properties … 32-bit addresses 16-byte lines 256-byte capacity Memory references are either Read/Write.

Configuration Information Discuss caches with properties … 32-bit addresses 16-byte lines 256-byte capacity Memory references are either Read/Write.
15-447 Computer ArchitectureFall 2007 © November 12th, 2007 Majd F. Sakr CS-447– Computer Architecture.

Computer ArchitectureFall 2007 © November 12th, 2007 Majd F. Sakr CS-447– Computer Architecture.
Caches The principle that states that if data is used, its neighbor will likely be used soon.

Caches The principle that states that if data is used, its neighbor will likely be used soon.
COMP3221 lec34-Cache-II.1 Saeid Nooshabadi COMP 3221 Microprocessors and Embedded Systems Lectures 34: Cache Memory - II

COMP3221 lec34-Cache-II.1 Saeid Nooshabadi COMP 3221 Microprocessors and Embedded Systems Lectures 34: Cache Memory - II
Direct Map Cache Tracing Exercise. Exercise #1: Setup Information CS2100 Cache I 2 Memory 4GB Memory Address 310N-1N Block Number Offset 1 Block = 8 bytes.

Direct Map Cache Tracing Exercise. Exercise #1: Setup Information CS2100 Cache I 2 Memory 4GB Memory Address 310N-1N Block Number Offset 1 Block = 8 bytes.
CDA 3103 Computer Organization Review Instructor: Hao Zheng Dept. Comp. Sci & Eng. USF.

CDA 3103 Computer Organization Review Instructor: Hao Zheng Dept. Comp. Sci & Eng. USF.
CSCE 212 Quiz 11 – 4/13/11 Given a direct-mapped cache with 8 one-word blocks and the following 32-bit memory address references: 1 2, 10000110 2, 11010100.

CSCE 212 Quiz 11 – 4/13/11 Given a direct-mapped cache with 8 one-word blocks and the following 32-bit memory address references: 1 2, ,
COEN 180 Main Memory Cache Architectures. Basics Speed difference between cache and memory is small. Therefore:  Cache algorithms need to be implemented.

COEN 180 Main Memory Cache Architectures. Basics Speed difference between cache and memory is small. Therefore:  Cache algorithms need to be implemented.
Caches – basic idea Small, fast memory Stores frequently-accessed blocks of memory. When it fills up, discard some blocks and replace them with others.

Caches – basic idea Small, fast memory Stores frequently-accessed blocks of memory. When it fills up, discard some blocks and replace them with others.
Caches – basic idea Small, fast memory Stores frequently-accessed blocks of memory. When it fills up, discard some blocks and replace them with others.

Caches – basic idea Small, fast memory Stores frequently-accessed blocks of memory. When it fills up, discard some blocks and replace them with others.

Similar presentations

Ads by Google