- LFU-LEAST FREQUENTLY USED
- The page with smallest count can be replaced
- actively used page have a large reference count.
- problem:a page which is used heavily in initial stage of a process, is never used again and remains in memory.
- implementation of this algorithm is expensive
- they do not approximate OPT replacement well
- solution:shift the counts right by 1 at regular intervals,to decay average usage count.
COUNTING-LFU PAGE REPLACEMENT ALGORITHM
Subscribe to:
Posts (Atom)
No comments:
Post a Comment