CSCI2510 Computer Organization Tutorial 09:Associative ...mcyang/csci2510/2018F/Tut09... ·...

CSCI2510 Computer Organization

Tutorial 09:Associative mapping

in MASM

Yuhong LIANG

yhliang@cse.cuhk.edu.hk

Outline

• LRU Algorithm

• First-In-First-Out Algorithm

CSCI2510 Tut09: Associative mapping implementation 2

LRU Algorithm

CSCI2510 Tut09: Associative mapping in MASM 3

LRU Algorithm

7 7 7 7 7 3 3 3 3 3 3 3 3 3 3 3 3 7 7 7

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

1 1 1 1 1 4 4 4 4 4 4 1 1 1 1 1 1 1

2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2

States

1 1 1 1 1 6 6 6 6 10 10 12 12 12 12 12 12 18 18 18

2 2 2 5 5 7 7 7 7 11 11 11 11 11 16 16 16 19 19

3 3 3 3 3 8 8 8 8 8 8 14 14 14 17 17 17 20

4 4 4 4 4 9 9 9 9 13 13 15 15 15 15 15 15

States

The cache block has not been used for the longest period of time!

LRU Algorithm: Replace the CB that has not been used for the longest

period of time (in the past).

LRU Algorithm

Input cachesize or the command or address

The input number is equel to -1

Check the cache

Cache hit?

Update the time tableReplacement using LRU

Algorithm(update cache and time table)

Exityes

print the cache and time table status

LRU Algorithm

.data:cacheBlocks dd 32 dup(-1); hold the address

time dd 32 dup(-1); hold the count

cacheSize dd 32, 0; the size of cache

CPUAccess dd "%d", 0; the address that cpu access

count dd 0, 0; the current time

LRU Algorithm

Check the cache

Cache hit?

Update the time table

Replacement using LRU Algorithm(update cache and time table)

Exityes

Part 1: check the cachesize

Start:

mov ECX, cacheSize

cmp ECX, -1

je exitprogram

jmp input

Part 2: check the CPUAccess

Input:

mov ECX, CPUAccess

cmp ECX, -1

je exitprogram

mov EAX, 0

jmp check

LRU Algorithm

Check the cache

Cache hit?

Exityes

Input:

mov EAX, 0

check:

cmp ECX, [EBP + EAX*4]

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

cacheBlocks(cachesize = 4,cpu access(ECX) 2)

EBP + EAX*4

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

ECX != 1

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

EAX!=4

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

ECX = 2

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

Jump to hit

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

ECX != 4

If CPU access(ECX) 5

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

cacheBlocks(cachesize = 4,cpu access(ECX) 5)EAX

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

EAX = 4

LRU Algorithm

Input:

mov EAX, 0

check:

je hit

add EAX,1

cmp EAX, cacheSize

je replace

jmp check

Jump to replace

LRU Algorithm

Check the cache

Cache hit?

Exityes

mov EBX ,count

mov [ESI + EAX*4], EBX

jmp printcachestatus

LRU Algorithm

Check the cache

Cache hit?

Exityes

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov [EBP + EDI*4], EBX

mov EBX ,count

mov [ESI + EDI*4], EBX

findLRU:

mov EBX, [ESI + EDI*4]

add EAX, 1

cmp EBX, [ESI + EAX*4]

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

cacheBlocks, count = 64, cpu access 5

Time table, count = 64

ESI + EAX*4 ESI + EDI*4

EBP + EDI*4EBP + EAX*4

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EAX EDI

EBX = 63

EAX EDI

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 63

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 63

EBX > 3

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

Jump to record LRU

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EAX EDI

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EAX EDI

EBX = 4

EAX EDI

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EAX EDI

EBX = 3

EAX EDI

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EAX EDI

EBX = 3

EAX = 1

EBX != 1

EAX EDI

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EAX EDI

Jump to findLRU

EAX EDI

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EAX EDI

EBX = 3

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 3

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 3 THEN EBX < 55

Not jmp

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 4

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 3

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 3 EAX=2 SO

EBX != EAX

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 3

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 3

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 3 THEN EBX < 54

Not jmp

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 4

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 3

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

cacheBlocks, count = 64,cpu access 5

EBX = 3 EAX=3 SO

LRU Algorithm

replace:

mov EAX, 0

mov EDI, 0

call findLRU

mov EBX, CPUAccess

mov EBX ,count

findLRU:

add EAX, 1

jg recordLRU

mov EBX, cacheSize

sub EBX, 1

cmp EAX, EBX

jne findLRU

recordLRU:

mov EDI, EAX

mov EBX, cacheSize

dec EBX

cmp EAX, EBX

jne findLRU

EBX = 5

EBX = 64

LRU Algorithm

Check the cache

Cache hit?

Update the time tableReplacement using LRU Algorithm(update cache and time table)

Exityes

printcachestatus:

mov EDI, 0

invoke crt_printf, addr stateFormat

call printstate

invoke crt_printf, addr countFormat

mov EDI, 0

call printcount

invoke crt_printf, addr endFormat

jmp input

printstate:

mov EAX, [EBP + EDI*4]

invoke crt_printf, addr outputFormat, EAX

add EDI, 1

cmp EDI, cacheSize

jne printstate

printcount:

mov EAX, [ESI + EDI*4]

invoke crt_printf, addr outputFormat, EAX

add EDI, 1

cmp EDI, cacheSize

jne printcount

Associative mapping implementation

First-In-First-Out Algorithm

7 7 7 7 7 3 3 3 3 3 3 3 3 3 2 2 2 2 2 2

0 0 0 0 0 0 4 4 4 4 4 4 4 4 4 4 7 7 7

1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0

2 2 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1

States

1 1 1 1 1 6 6 6 6 6 6 6 6 6 15 15 15 15 15 15

2 2 2 2 2 2 8 8 8 8 8 8 8 8 8 8 18 18 18

3 3 3 3 3 3 3 3 11 11 11 11 11 11 11 11 11 11

4 4 4 4 4 4 4 4 4 4 14 14 14 14 14 14 14

States

The cache block has arrived for the longest period of time!

First-In-First-Out Algorithm: Replace the CB that has arrived for the longest period

of time (in the past)

Check the cache

Cache hit?

Replacement using FIFO Algorithm(update cache and time table)

Exityes

Assignment3

• Implement the FIFO Algorithm

• Fill the five code segments:

check, hit, replace, find first,

recordfirst

• Don’t change the start, input and

Output(printstate/printcachestatus/

printcount) code segments!!!

Summary

• LRU Algorithm

• First-In-First-Out Algorithm

52CSCI2510 Tut09: Associative mapping in MASM

CSCI2510 Computer Organization Tutorial 09:Associative ...mcyang/csci2510/2018F/Tut09... ·...

Documents

CSCI2510 Computer Organization Lecture 00: Course …mcyang/csci2510/2018F/Lec00 Course Information.pdfmodern computer system and its components. •To acquire the ability of differentiating

Associative Learning. Simple Associative Network

CSCI2510 Computer Organization Lecture 04: Machine Instructionsmcyang/csci2510/2019F/Lec04 Machine... · 2019-09-23 · CSCI2510 Computer Organization Lecture 04: Machine Instructions

Associative Patent

CSCI2510 Computer Organization Lecture 05: …mcyang/csci2510/2019F/Lec05 Program...Outline • Revisit: Assembly Language Basics • Program Execution –Flow for Generating/Executing

CSCI2510 Computer Organization Lecture 13: Basic Input ...mcyang/csci2510/2019F/Lec13 Basic Input and Output... · CSCI2510 Computer Organization Lecture 13: Basic Input & Output

CSCI2510 Computer Organization Lecture 06: Memory Hierarchymcyang/csci2510/2018F/Lec06... · distinct memory locations. • Most machines are byte-addressable. –Each memory address

Associative Mapping

CSCI2510 - Computer Organization

CSCI2510 Computer Organization Lecture 04: Machine Instructionsmcyang/csci2510/2018F/Lec04 Machine... · 2018-10-15 · CSCI2510 Computer Organization Lecture 04: Machine Instructions

CSCI2510 Computer Organization Lecture 02: …mcyang/csci2510/2019F/Lec02 Number...Lecture 02: Number and Character Representation Ming-Chang YANG mcyang@cse.cuhk.edu.hk Reading: Chap

CSCI2510 Computer Organization Lecture 01: Basic Structure ...mcyang/csci2510/2020F/Lec01 Basic Structu… · CSCI2510 Computer Organization Lecture 01: Basic Structure of Computers

Associative (prosop)agnosia without (apparent) perceptual deﬁcits…psych.utoronto.ca/Neuropsychologylab/PDF/Associative (prosop... · Associative (prosop)agnosia without (apparent)

CSCI2510 Computer Organization Lecture 03: Memory Basicsmcyang/csci2510/2019F/Lec03 Memory... · 2019-09-23 · Memory Address (1/2) • Accessing the contents of memory requires

CSCI2510 Computer Organization Lecture 08: Cache Performancemcyang/csci2510/2018F/Lec08 Cache... · 2018. 11. 5. · Cache Hit/Miss Rate and Miss Penalty • A successful access to

CSCI2510 Computer Organization Lecture 11: Control Unit ...mcyang/csci2510/2019F/Lec11...• The control sequences of different instructions may consist of a different number of steps

Name____________________________€¦ · Web viewCommutative Property of Multiplication: Associative Property: _ ___ Associative Property of Addition: Associative Property

CSCI2510 Computer Organization Tutorial 08: Direct Mapping ...mcyang/csci2510/2018F/Tut08 Direct...CSCI2510 Tut08: Direct Mapping in MASM 5 Assignment 2 Solution • If inputnumber

CSCI2510 Computer Organization Lecture 12: Pipeliningmcyang/csci2510/2019F/Lec12... · 2019-12-07 · • Assume the computer is controlled by a clock. –The fetch and execute steps

1 CSCI2510 Computer Organization Introduction Terrence Sui-tung Mak stmak