FiFo uses the oldest page first. We do not need to know how long it has been in memory if the pages are placed in a FIFI queue. This is easy to implement but suffers from being to simple and does not always give good results.
FiFo uses the oldest page first. We do not need to know how long it has been in memory if the pages are placed in a FIFI queue. This is easy to implement but suffers from being to simple and does not always give good results.
Понравилась статья? Добавь ее в закладку (CTRL+D) и не забудь поделиться с друзьями:
|