P AG E

REP L AC EM E N T
RY
WAP -OUT BETW EEN M AIN AND SECONDARY MEMOO
SWAP-IN &S
OVERVIEW

1 2 3 4
Page need FOR page Page Be lady's
replacement replacement replacement anomaly
algorithms
WHAT IS PAGE REPLACEMENT?
• WHAT HAPPENS IF THERE IS NO FREE FRAME TO ALLOCATE?
• HERE COMES THE PAGE REPLACEMENT – FIND SOME PAGE IN THE MEMORY THAT IS “NOT
THE USED” AND SWAP IT OUT. A FREE SPACE IS ALLOCATED AND SWAP IN FRESH PAGES.

• PROCESS OF STORING DATA FROM MAIN MEMORY T SECONDARY MEMORY  SWAPPING

OUT

• RETRIEVING DATA BACK TO MAIN MEMORY  SWAPPING IN

• NOTE THAT THE SAME PAGE MAY BE BROUGHT INTO MEMORY SEVERAL TIMES OVER THE
LIFE OF A PROCESS
 PAGE
REPLACEMENT
WHY WE NEED PAGE REPLACEMENT?

• THE MAIN GOAL OF PAGE REPLACEMENT IS TO PROVIDE LOWEST PAGE FAULT

RATE.
WHAT IS PAGE FAULT AND WHEN DOES IT OCCUR?

• WHEN THE PAGE(DATA) REQUESTED BY A PROGRAM IS NOT AVAILABLE IN THE

MEMORY, IT IS CALLD AS A PAGE FAULT

• THIS USUALLY RESULTS IN THE APPLICATION BEING SHUT DOWN

WHAT IS PAGE FAULT AND WHEN DOES IT OCCUR?

• IT IS A TYPE OF INTERRUPT, RAISED WHEN A RUNNING PROCESS ACCESSSES A

MOEMORY PAGE , THAT IS MAPPED INTO VIRTUAL MEMORY BUT NOT LOADED IN
MAIN MEMORY

• THUS WE NEED VARIOUS PAGE REPLACEMENT ALGORITHMS

 START

Send page
request

FAULT Page HIT

found

Fetch page
STOP
PAGE REPLACEMENT ALGORITRHMS
• IT IS THE TECHNIQUE USED BY OPERATING SYSTEM TO DECIDE WHICH MEMORY
PAGE TO SWAP OUT

• IT IS ALSO DECIDED THAT IN MEMORY, HOW MANY FRAMES TO ALLOCATE TO

EACH PROCESS

• WHEN PAGE REPLACEMENT IS REQUIRED, WE MUST SELECT THE FRAMES THAT

ARE TO BE REPLACED
 PAGE REPLACEMENT ALGORITHMS
FOLLOWING ARE SOME ALGORITHMS OF PAGE REPLACEMENT:

• FIRST IN FIRST OUT (FIFO)

• LEAST RECENTLY USED (LRU)
• NOT RECENTLY USED (NRU)
ANOTHER ALGORITHMS:

• OPTIMAL REPLACEMENT
• SECOND CHANCE
• RANDOM REPLACEMENT
• WORKING SET REPLACEMENT
FIRST-IN FIRST-OUT (FIFO)
• FIFO PAGE REPLACEMET TECHNIQUE IS ONE OF THE SIMPLEST ONE TO
IMPLEMENT AMONGST OTHER PAGE REPLACEMENT ALGORITHMS

• IT IS A CONSERVATIVE ALGORITHM
• IT IS LOW- OVERHEAD ALGORITHM THAT MAINTAINS A QUEUE TO KEEP TRACK
OF ALL THE PAGES IN A MEMORY

• WHEN A PAGE NEED TO BE REPLACED, THE PAGE AT THE FRONT OF THE QUEUE
WILL BE REPLACED.
FIFO EXAMPLE:

• REFERENCE STRING IS : 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5
• USING 3 FRAMES
• PAGE FAULT IS: 9
BELADY’S ANOMALY

• FIFO IS SUFFERING FROM THE BELADY’S ANOMALY

• BELADY’S ANOMALY IS -- WHEN NUMBER OF FRAMES INCREASES MORE PAGE
FAULTS OCCURS
MORE FRAMES  MORE PAGE FAULTS
BELADY’S ANOMALY
FOR EXAMPLE:
IF THE SAME STRING REFERENCE IS IMPLEMENTED USING 4 FRAMES
REFERENCE STRING IS : 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5
THEN PAGE FAULTS ARE: 10
HENCE PROVED THAT WHEN FRAMES INCREASES FAULTS ARE ALSO INCREASES
DRAWBACKS:

• A PAGE WHICH IS BEING ACCESSED QUITE OFTEN MAY ALSO GET REPLACED
BECAUSE IT ARRIVED EARLIER THAN THOSE PRESENT

• SUFFERS FROM BE LADY'S ANOMALY:

PAGE FAULT INCREASES WITH THE INCREASE IN NUMBER OF FRAMES