X hits on this document

Powerpoint document

Chapter 10 : Case Study - UNIX - page 27 / 48

110 views

0 shares

0 downloads

0 comments

27 / 48

Ceng 334 - Operating Systems

10-27

Two-handed Clock Algorithm (2)

Page daemon has to do two passes with one core map pointer. Pass 1 clears all R bits, second pass removes pages (R bits are set between pass 1 and 2)

Page daemon maintains two pointers into the core map to speed up the process (one pass instead of two) for large memories

When page daemon runs, it first clears the R bit at the front hand, and then checks the R bit at the back hand, after which it advances both hands

Each time the page daemon runs, the hands rotate less than a full revolution, the amount depending on the number of pages needed to reach lotsfree

Document info
Document views110
Page views110
Page last viewedSun Dec 04 21:46:23 UTC 2016
Pages48
Paragraphs407
Words2238

Comments