Diferencia entre revisiones de «Sol 8»
De Wiki de Sistemas Operativos
| Línea 10: | Línea 10: | ||
Acceso Fallo | Acceso Fallo | ||
a Marco Marco Marco Marco de | a Marco Marco Marco Marco de | ||
| − | página 1 2 3 4 página Tiempo Cola | + | página 1 2 3 4 página Tiempo Cola (FIFO por orden de acceso) |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 2 | 2 | | | | x | 1 | + | 2 | 2 | | | | x | 1 2 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 2 | = | | | | | 2 | + | 2 | = | | | | | 2 2 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 3 | = | 3 | | | x | 3 | + | 3 | = | 3 | | | x | 3 2 <- 3 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 1 | = | = | 1 | | x | 4 | + | 1 | = | = | 1 | | x | 4 2 <- 3 <- 1 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 1 | = | = | = | | | 5 | + | 1 | = | = | = | | | 5 2 <- 3 <- 1 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 3 | = | = | = | | | 6 | + | 3 | = | = | = | | | 6 2 <- 1 <- 3 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 4 | = | = | = | 4 | x | 7 | + | 4 | = | = | = | 4 | x | 7 2 <- 1 <- 3 <- 4 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 5 | 5 | = | = | = | x | 8 | + | 5 | 5 | = | = | = | x | 8 1 <- 3 <- 4 <- 5 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 1 | = | = | = | = | | 9 | + | 1 | = | = | = | = | | 9 3 <- 4 <- 5 <- 1 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 1 | = | = | = | = | | 10 | + | 1 | = | = | = | = | | 10 3 <- 4 <- 5 <- 1 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 2 | = | 2 | = | = | x | 11 | + | 2 | = | 2 | = | = | x | 11 4 <- 5 <- 1 <- 2 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 3 | = | = | = | 3 | x | 12 | + | 3 | = | = | = | 3 | x | 12 5 <- 1 <- 2 <- 3 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | 4 | 4 | = | = | = | x | 13 | + | 4 | 4 | = | = | = | x | 13 1 <- 2 <- 3 <- 4 |
+-----+-----+-----+-----+--------+ | +-----+-----+-----+-----+--------+ | ||
| − | |||
| − | |||
[[Criterios_de_reemplazo|Volver]] | [[Criterios_de_reemplazo|Volver]] | ||
Revisión del 15:17 30 dic 2015
Solución:
nº fallos de página 8
Tasa de fallos de página = --------------------- = ---- = 0,615
nº accesos a páginas 13
La lista de paginas a la que se acceden son las siguientes : 2--2--3--1--1--3--4--5--1--1--2--3--4
Criterio LRU (Least Recently Used): justo lo contrario a MRU. Se selecciona la página que lleve más tiempo sin ser accedida. Se implementa mediante una FIFO que mantiene el orden de acceso a las páginas (añadimos una cola al cronograma).
Acceso Fallo
a Marco Marco Marco Marco de
página 1 2 3 4 página Tiempo Cola (FIFO por orden de acceso)
+-----+-----+-----+-----+--------+
2 | 2 | | | | x | 1 2
+-----+-----+-----+-----+--------+
2 | = | | | | | 2 2
+-----+-----+-----+-----+--------+
3 | = | 3 | | | x | 3 2 <- 3
+-----+-----+-----+-----+--------+
1 | = | = | 1 | | x | 4 2 <- 3 <- 1
+-----+-----+-----+-----+--------+
1 | = | = | = | | | 5 2 <- 3 <- 1
+-----+-----+-----+-----+--------+
3 | = | = | = | | | 6 2 <- 1 <- 3
+-----+-----+-----+-----+--------+
4 | = | = | = | 4 | x | 7 2 <- 1 <- 3 <- 4
+-----+-----+-----+-----+--------+
5 | 5 | = | = | = | x | 8 1 <- 3 <- 4 <- 5
+-----+-----+-----+-----+--------+
1 | = | = | = | = | | 9 3 <- 4 <- 5 <- 1
+-----+-----+-----+-----+--------+
1 | = | = | = | = | | 10 3 <- 4 <- 5 <- 1
+-----+-----+-----+-----+--------+
2 | = | 2 | = | = | x | 11 4 <- 5 <- 1 <- 2
+-----+-----+-----+-----+--------+
3 | = | = | = | 3 | x | 12 5 <- 1 <- 2 <- 3
+-----+-----+-----+-----+--------+
4 | 4 | = | = | = | x | 13 1 <- 2 <- 3 <- 4
+-----+-----+-----+-----+--------+
