Block replacement algorithm fcs n belady anomaly

BinduAgarwal4 95 views 54 slides Mar 16, 2021
Slide 1
Slide 1 of 54
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15
Slide 16
16
Slide 17
17
Slide 18
18
Slide 19
19
Slide 20
20
Slide 21
21
Slide 22
22
Slide 23
23
Slide 24
24
Slide 25
25
Slide 26
26
Slide 27
27
Slide 28
28
Slide 29
29
Slide 30
30
Slide 31
31
Slide 32
32
Slide 33
33
Slide 34
34
Slide 35
35
Slide 36
36
Slide 37
37
Slide 38
38
Slide 39
39
Slide 40
40
Slide 41
41
Slide 42
42
Slide 43
43
Slide 44
44
Slide 45
45
Slide 46
46
Slide 47
47
Slide 48
48
Slide 49
49
Slide 50
50
Slide 51
51
Slide 52
52
Slide 53
53
Slide 54
54

About This Presentation

Block replacement algorithm in cache memory: FCFS and Belady's Anomaly


Slide Content

Block Replacement Algorithms FIFO & Belady's Anomaly Bindu Agarwalla

Block Replacement A replacement policy determines, out of all possible candidates, which one should be evicted from the cache upon arrival of a new piece of data. We evaluate an algorithm by running it on a particular string of memory references and computing the number of block misses. The string of memory references is called a reference string . Reference strings can be generated. Artifically (By using a random-number generator). We can trace a given system and record the address of each memory reference.

Block Replacement Algorithms First-in, First-out (FIFO) . Optimal. Least Recently used (LRU). For each algorithm, we will calculate The number of Hits. The number of misses. Hit Ratio (The number of Hits / Total number of attempts) The algorithm, that gives the more number of hits, will also increase the system performance by reducing the effective access time.

Block Replacement Algorithms Assumptions: Three blocks are given to the process. Initially all three blocks are empty. First-in, First-out (FIFO): When a block must be replaced, the oldest is chosen. Implementation: By using a FIFO Queue: We replace the block at the head of the queue. When a block is brought into memory we insert it at the tail of the queue.

First in First Out (FIFO) 7 1 2 3 4 2 3 3 2 1 2 1 7 1 Blocks : 3 Nos

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 7 *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 7 7 * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 7 7 7 * * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 7 7 7 2 * * * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 7 7 7 2 2 * * * * Hit

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 7 7 7 2 2 2 * * * * Hit *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 7 7 7 2 2 2 2 * * * * Hit * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 7 7 7 2 2 2 2 4 * * * * Hit * * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 2 7 7 7 2 2 2 2 4 4 * * * * Hit * * * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 2 *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 2 2 * Hit

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 3 2 2 2 * Hit Hit

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 3 3 2 2 2 1 * Hit Hit *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 3 3 2 2 2 2 1 1 * Hit Hit * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 3 3 2 2 2 2 2 1 1 1 * Hit Hit * * Hit

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 3 3 2 2 2 2 2 2 1 1 1 1 * Hit Hit * * Hit Hit

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 3 3 2 2 2 2 2 2 2 1 1 1 1 1 7 * Hit Hit * * Hit Hit *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 3 3 2 2 2 2 2 2 2 2 1 1 1 1 1 7 7 * Hit Hit * * Hit Hit * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 3 3 2 2 2 2 2 1 2 2 2 1 1 1 1 1 7 7 7 * Hit Hit * * Hit Hit * * *

First in First Out (FIFO).. 7 1 2 3 4 2 3 3 2 1 2 1 7 1 1 1 1 1 3 3 3 3 2 2 7 7 7 2 2 2 2 4 4 4 * * * * Hit * * * * * 3 3 3 3 2 2 2 2 2 1 2 2 2 1 1 1 1 1 7 7 7 * Hit Hit * * Hit Hit * * * HIT = 5 Miss = 15 Hit Ratio = 25% (5/20)

Belady's Anomaly As we know, the number of BLOCK misses decreases with the increase in number of available blocks, but for some block- replacement algorithms, the block - misses may increase as the number of allocated blocks increases. This most unexpected result is known as Belady's Anomaly . The FIFO Algorithm suffers from this Anomaly. Consider the following reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 USING 3 BLOCK S

BELADY’S ANOMALY 1 * 1 2 3 4 1 2 5 1 2 3 4 5

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 2 1 1 * *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 2 2 1 1 1 * * *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 2 2 2 1 1 1 4 * * * *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 3 2 2 2 1 1 1 1 4 4 * * * * *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 3 2 2 2 2 1 1 1 1 1 4 4 4 * * * * * *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 3 2 2 2 2 2 1 1 1 1 1 1 4 4 4 5 * * * * * * *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 3 2 2 2 2 2 2 1 1 1 1 1 1 1 4 4 4 5 5 * * * * * * * Hit

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 3 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 4 4 4 5 5 5 * * * * * * * Hit Hit

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 3 2 2 2 2 2 2 2 2 1 1 1 1 1 3 1 1 1 4 4 4 5 5 5 5 * * * * * * * Hit Hit *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 3 2 2 2 2 2 2 2 2 1 1 1 1 1 3 1 1 1 4 4 4 5 5 5 5 * * * * * * * Hit Hit * 4 3 5 *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 3 2 2 2 2 2 2 2 2 1 1 1 1 1 3 1 1 1 4 4 4 5 5 5 5 * * * * * * * Hit Hit * 4 4 3 3 5 5 * Hit Total no of misses = 9

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 USING 4 BLOCK S

BELADY’S ANOMALY 1 * 1 2 3 4 1 2 5 1 2 3 4 5

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 2 1 1 * *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 2 2 1 1 1 * * *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 * * * * 4 3 3 2 2 2 1 1 1 1

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 * * * * Hit 4 4 3 3 3 2 2 2 2 1 1 1 1 1

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 * * * * Hit 4 4 4 3 3 3 3 2 2 2 2 2 1 1 1 1 1 1 Hit

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 * * * * * Hit 4 4 4 4 3 3 3 3 3 2 2 2 2 2 2 1 1 1 1 1 1 5 Hit

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 * * * * * Hit 4 4 4 4 4 3 3 3 3 3 3 2 2 2 2 2 2 1 1 1 1 1 1 1 5 5 Hit *

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 * * * * * * * Hit 4 4 4 4 4 4 3 3 3 3 3 3 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 5 5 5 Hit

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 * * * * * * * * Hit 4 4 4 4 4 4 3 3 3 3 3 3 3 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 5 5 5 5 Hit

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 2 1 4 * * * * * * * * * Hit 4 4 4 4 4 4 3 3 3 3 3 3 3 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 5 5 5 5 Hit

BELADY’S ANOMALY 1 2 3 4 1 2 5 1 2 3 4 5 3 3 2 2 1 5 4 4 * * * * * * * * * Hit 4 4 4 4 4 4 3 3 3 3 3 3 3 2 2 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 5 5 5 5 Hit * No of Misses=10

THANK YOU