Solución ejercicio 1 memoria virtual
De Wiki de Sistemas Operativos
FIFO
accesos a páginas ------------------------------------------------------------------------- | 1 | 1 | 1 | 2 | 3 | 4 | 5 | 3 | 1 | 2 | 3 | 4 | --------------------------------------------------------------------------------- | 1 | 1 | = | = | = | = | = | 5 | = | = | = | = | 4 | --------------------------------------------------------------------------------- marcos | 2 | | | | 2 | = | = | = | = | 1 | = | = | = | -------------------------------------------------------------------------------- | 3 | | | | | 3 | = | = | = | = | 2 | = | = | --------------------------------------------------------------------------------- | 4 | | | | | | 4 | = | = | = | = | 3 | = | --------------------------------------------------------------------------------- fallo | X | | | X | X | X | X | | X | X | X | X | página ------------------------------------------------------------------------- tiempo -> 9 talla de fallos de página = ------ = 0.75 12
NRU
En caso de empate, se emplea LRU.
accesos a páginas | r | r | w | r | r | r | r | w | w | w | r | r | ------------------------------------------------------------------------------------------------- | 1 | 1 | 1 | 2 | 3 | 4 | 5 | 3 | 1 | 2 | 3 | 4 | --------------------------------------------------------------------------------------------------------- | 1 | 1 | = | = | = | = | = | = | = | = | = | = | = | | |-------|-------|-------|-------|-------|-------|-------|-------|-------|-------|-------|-------| | R | M | 1 | 0 | = | = | 1 | 1 | = | = | = | = | = | = | = | = | = | = | = | = | = | = | = | = | = | = | --------------------------------------------------------------------------------------------------------- marcos | 2 | | | | 2 | = | = | 5 | = | = | = | = | 4 | | |-------|-------|-------|-------|-------|-------|-------|-------|-------|-------|-------|-------| | R | M | | | | | | | 1 | 0 | = | = | = | = | 1 | 0 | = | = | = | = | = | = | = | = | 1 | 0 | --------------------------------------------------------------------------------------------------------- | 3 | | | | | 3 | = | = | 3 | = | = | = | = | | |-------|-------|-------|-------|-------|-------|-------|-------|-------|-------|-------|-------| | R | M | | | | | | | | | 1 | 0 | = | = | = | = | 1 | 1 | = | = | = | = | = | = | = | = | --------------------------------------------------------------------------------------------------------- | 4 | | | | | | 4 | = | = | = | 2 | = | = | | |-------|-------|-------|-------|-------|-------|-------|-------|-------|-------|-------|-------| | R | M | | | | | | | | | | | 1 | 0 | = | = | = | = | = | = | 1 | 1 | = | = | = | = | --------------------------------------------------------------------------------------------------------- fallo | X | | | X | X | X | X | | | X | | X | página ------------------------------------------------------------------------------------------------- tiempo -> 7 talla de fallos de página = ------ = 0.583 12
NRU con 2º oportunidad
Pendiente solución.
LRU
Pendiente solución.
LFU
Pendiente solución.
Sustitución por envejecimiento
Pendiente solución.