Page Replacement Flashcards

1
Q

What is demand paging?

A

Puts pages in memory when needed.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Trying to access a page not currently in memory is called what?

A

A page fault

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What swaps unnecessary pages?

A

Optimal Page Replacement

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the advantages and disadvantages of Optimal page replacement.

A

Advantage
- Minimal Damage
-Looks forward in time

Disadvantage
- Unimplementable because it requires knowledge of future memory

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Describe how each page replacement kicks out a page.

A

Optimal - Kicks out page with longest time before used again.

FIFO - Kicks out oldest page

LRU - kicks out page used less recently

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What are the advantages and disadvantages of FIFO page replacement.

A

Advantages
- simple and easy to use
- very active

Disadvantages
- increase of page faults
- might throw out important pages

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What are the advantages and disadvantages of LRU page replacement.

A

Advantages
-Gives less page faults

Disadvantages
- expensive and more complex
-very consuming

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

When processes have excessive page faults and spend more time swapping than working it is called __________.

A

Thrashing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What is a working set?

A

Pages used by a process

How well did you know this?
1
Not at all
2
3
4
5
Perfectly