First In First Out (FIFO)

Replace the oldest page in memory.

Assume 4 frames and the following reference string:

1 2 3 2 4 3 5 1 5 2 4 5

1

1

2

1

2

3

1

2

3

1

2

3

4

1

2

3

4

5

2

3

4

5

1

3

4

5

1

3

4

5

1

2

4

5

1

2

4

5

1

2

4

f

f

f

f

f

f

f

Easy to understand and program.

Will adding memory always improve things?

Previous slide Next slide Back to first slide View graphic version