MFU-Most Frequently Used
based on the argument that the page with smallest count is brought in and has yet to be used.
implementation of this algorithm is expensive
they do not approximate OPT replacement well
based on the argument that the page with smallest count is brought in and has yet to be used.
implementation of this algorithm is expensive
they do not approximate OPT replacement well
No comments:
Post a Comment