Presentation is loading. Please wait.

Presentation is loading. Please wait.

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.

Published byOphelia Williamson Modified over 9 years ago

Similar presentations

Presentation on theme: "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."— Presentation transcript:

1 Direct Map Cache Tracing Exercise

2 Exercise #1: Setup Information CS2100 Cache I 2 Memory 4GB Memory Address 310N-1N Block Number Offset 1 Block = 8 bytes Cache 32Bytes 1 Block = 8 bytes N+M-1 310N-1N Tag Offset Index Offset, N = Block Number = Number of Cache Blocks = Cache Index, M = Cache Tag =

3 Exercise #2: Tracing Memory Access Using the given setup, trace the following memory loads:  Load from addresses: 4, 0, 8, 12, 36, 0, 4 Note that “A”, “B”…. “J” represents word-size data CS2100 Cache I 3 Memory Content Address Data 0 A 4 B 8 C 12 D … … 32 I 36 J … …

4 CS2100 Exercise #2: Load #1  Addresses: 4, 0, 8, 12, 36, 0, 4 Address 4 = IndexValidTagWord0Word1 00 10 20 30 00000000000000000000000000100 TagOffset 00 Index Cache I 4

5 CS2100 Exercise #2: Load #2  Addresses: 4, 0, 8, 12, 36, 0, 4 Address 0 = IndexValidTagWord0Word1 00 10 20 30 00000000000000000000000000000 TagOffset 00 Index Cache I 5

6 CS2100 Exercise #2: Load #3  Addresses: 4, 0, 8, 12, 36, 0, 4 Address 8 = IndexValidTagWord0Word1 00 10 20 30 00000000000000000000000000000 TagOffset 01 Index Cache I 6

7 CS2100 Exercise #2: Load #4  Addresses: 4, 0, 8, 12, 36, 0, 4 Address 12 = IndexValidTagWord0Word1 00 10 20 30 00000000000000000000000000100 TagOffset 01 Index Cache I 7

8 CS2100 Exercise #2: Load #5  Addresses: 4, 0, 8, 12, 36, 0, 4 Address 36 = IndexValidTagWord0Word1 00 10 20 30 00000000000000000000000001100 TagOffset 00 Index Cache I 8

9 CS2100 Exercise #2: Load #6  Addresses: 4, 0, 8, 12, 36, 0, 4 Address 0 = IndexValidTagWord0Word1 00 10 20 30 00000000000000000000000000000 TagOffset 00 Index Cache I 9

10 CS2100 Exercise #2: Load #7  Addresses: 4, 0, 8, 12, 36, 0, 4 Address 4 = IndexValidTagWord0Word1 00 10 20 30 00000000000000000000000000100 TagOffset 00 Index Cache I 10

Download ppt "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."

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.
CS2100 Computer Organisation Cache II (AY2014/2015) Semester 2.

CS2100 Computer Organisation Cache II (AY2014/2015) Semester 2.
1 Memory Systems Virtual Memory Lecture 25 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.

1 Memory Systems Virtual Memory Lecture 25 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
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.
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.
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.
Virtual Memory. Why do we need VM? Program address space: 0 – 2^32 bytes –4GB of space Physical memory available –256MB or so Multiprogramming systems.

Virtual Memory. Why do we need VM? Program address space: 0 – 2^32 bytes –4GB of space Physical memory available –256MB or so Multiprogramming systems.
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.
Cache Organization Topics Background Simple examples.

Cache Organization Topics Background Simple examples.
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.
1 1999 ©UCB CS 161 Ch 7: Memory Hierarchy LECTURE 24 Instructor: L.N. Bhuyan www.cs.ucr.edu/~bhuyan.

©UCB CS 161 Ch 7: Memory Hierarchy LECTURE 24 Instructor: L.N. Bhuyan
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, ,
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.
MPC 555 Memory Controller and Chip Select

MPC 555 Memory Controller and Chip Select
Caches Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See P&H 5.1, 5.2 (except writes)

Caches Hakim Weatherspoon CS 3410, Spring 2012 Computer Science Cornell University See P&H 5.1, 5.2 (except writes)
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.
Paging Examples Assume a page size of 1K and a 15-bit logical address space. How many pages are in the system?

Paging Examples Assume a page size of 1K and a 15-bit logical address space. How many pages are in the system?
Virtual Memory CS 537 - Introduction to Operating Systems.

Virtual Memory CS Introduction to Operating Systems.

Similar presentations

Ads by Google