CS411/511. Operating Systems

Maillist Archive, Spring 1999

Thread Index | Author Index | Subject Index | Date Index

Mail Index [Date Prev][Date Next][Thread Prev][Thread Next]

second chance

For the LFU second chance algorithm for project #2:

Find the LFU frame (the frame with the least number of reference counts).
If that frame is clean, take it as the victim.
If that frame is dirty, skip it.  Go on to the next LFU frame.

You do NOT want to reset the dirty bit when you skip it, OSP will not like

So essentially you'll be taking the clean frame with the lowest count.  In
the unlikely event that all the frames are dirty (which can't
happen in a real OS, but might happen in OSP), take the dirty page with
the lowest count.

It is just that simple (and was mentioned in class several times I

Keith D. Vertanen                         "To know is nothing at all; 
Oregon State University	                   to imagine is everything."
vertanen@cs.orst.edu	                      -Anatole Thibault

Thread Index | Author Index | Subject Index | Date Index