Introducing
Your new presentation assistant.
Refine, enhance, and tailor your content, source relevant images, and edit visuals quicker than ever before.
Trending searches
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1
------------------------------------------------
F
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1
5
------------------------------------------------
F F
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1
5 5
3
------------------------------------------------
F F F
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1
5 5 5
3 3
2
------------------------------------------------
F F F F
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1
5 5 5 5
3 3 3
2 2
------------------------------------------------
F F F F H
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1
5 5 5 5 5
3 3 3 3
2 2 2
------------------------------------------------
F F F F H H
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1 4
5 5 5 5 5 5
3 3 3 3 3
2 2 2 2
------------------------------------------------
F F F F H H F
O número 4 sai para entrar no lugar o 1. Isso acontece porque nos anteriores utilizados 3 e 5 são utilizados por 2 vezes. Já o 2 foi usado depois do 1 e ambos apenas 1 vez. Portanto, trocamos 1 pelo 4, seguindo o conceito do LRU, onde as páginas antigas e menos usadas são as preferenciais para troca.
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1 4 1
5 5 5 5 5 5 5
3 3 3 3 3 3
2 2 2 2 2
------------------------------------------------
F F F F H H F F
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1 4 1 0
5 5 5 5 5 5 5 5
3 3 3 3 3 3 3
2 2 2 2 2 2
------------------------------------------------
F F F F H H F F F
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1 4 1 0 0
5 5 5 5 5 5 5 5 5
3 3 3 3 3 3 3 3
2 2 2 2 2 2 2
------------------------------------------------
F F F F H H F F F H
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1 4 1 0 0 0
5 5 5 5 5 5 5 5 5 5
3 3 3 3 3 3 3 3 3
2 2 2 2 2 2 2 2
------------------------------------------------
F F F F H H F F F H H
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1 4 1 0 0 0 4
5 5 5 5 5 5 5 5 5 5 5
3 3 3 3 3 3 3 3 3 3
2 2 2 2 2 2 2 2 2
------------------------------------------------
F F F F H H F F F H H F
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1 4 1 0 0 0 4 4
5 5 5 5 5 5 5 5 5 5 5 5
3 3 3 3 3 3 3 3 3 3 3
2 2 2 2 2 2 2 2 2 2
------------------------------------------------
F F F F H H F F F H H F H
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1 4 1 0 0 0 4 4 1
5 5 5 5 5 5 5 5 5 5 5 5 5
3 3 3 3 3 3 3 3 3 3 3 3
2 2 2 2 2 2 2 2 2 2 2
------------------------------------------------
F F F F H H F F F H H F H F
Algoritmo LRU (Least Recently Used)
1 5 3 2 5 3 4 1 0 5 2 4 3 1 2
------------------------------------------------
1 1 1 1 1 1 4 1 0 0 0 4 4 1 1
5 5 5 5 5 5 5 5 5 5 5 5 5 5
3 3 3 3 3 3 3 3 3 3 3 3 3
2 2 2 2 2 2 2 2 2 2 2 2
------------------------------------------------
F F F F H H F F F H H F H F H
Considerações finais
Páginas de referencia: 15
Páginas de falta: 9