X hits on this document

Powerpoint document

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

136 views

0 shares

0 downloads

0 comments

26 / 48

Ceng 334 - Operating Systems

10-26

Basic Clock Algorithm (1)

The pointer (hand) points to the oldest page

When a page fault occurs,

if the R bit of the pointed page is 0 (page not referred), this page is evicted (the new page replaces this page - written to disk first if it is dirty)

if the R bit is 1 (page accessed), R bit is cleared and the hand is advanced to the next page

Document info
Document views136
Page views136
Page last viewedSat Dec 10 15:08:52 UTC 2016
Pages48
Paragraphs407
Words2238

Comments