
First-in first-out
(FIFO) policy: a page replacement policy that removes from main memory the pages that were brought in first.
*KEY = Identify what are FIRST PAGE
REQUEST for in and out?

Least recently used
(LRU) policy: a page-replacement policy that removes from main memory the pages that show the least amount of recent activity.
*KEY=Identify what are the LATEST PAGE to standby for out?

2.
3.
4.
5.
6.
7.
1.
Identify how much PAGE FRAMES are available.
Identify how much JOB PAGES.
Identify job to process (PAGE REQUESTED).
Identify PAGE swapped IN to and OUT of memory (from Page Frames)
Marks each interrupt with an asterisk.
Count the number of page interrupts.
Compute the FAILURE rate and the
SUCCESS rate.

Example form Textbook;
Figure 3.8

1.
2.
3.
PAGE FRAMES = 2
JOB PAGES = 4 (A,B,C,D)
Arrangement PAGE REQUESTED =
A, B, A, C, A, B, D, B, A, C, D
So, Total number Page Requested are 11.
QUESTION : Using the FIFO page removal algorithm, does a page trace analysis indicating page faults with asterisks
(*). Then compute the failure and success ratios.

Time
Page Request
Page fault/Interrupt
Page Frame 1
1 2 3 4 5 6 7 8 9
A B A
* *
A A A
C
*
C
A
*
C
B
*
B
D
*
B
B
B
A
*
A
10
C
*
11
D
*
A D
B B B A A D D D C C
Page Frame 2

1.
2.
3.
4.
5.
6.
7.
Identify how much PAGE FRAMES are available.
Identify how much JOB PAGES.
Identify job to process (PAGE REQUESTED).
Identify LEAST RECENTLY USED PAGE of memory (standby to out)
Marks each interrupt with an asterisk.
Count the number of page interrupts.
Compute the FAILURE rate and the
SUCCESS rate.
LRU chooses the page that has not been used for the longest period of time .

Time
Page Request
Page fault/Interrupt
1 2 3 4 5 6 7 8 9
A
*
B
*
A C
*
A B
*
D
*
B A
*
10
C
*
11
D
*
Page Frame 1
A A A A A A D D A A D
Page Frame 2
B B C C B B B B C
C