Hi, no this this should not be the case. Note that a process will always replace one of its own pages if the RAM is full and there is one available to replace (as local replacement is prioritised over global). As a result of this, once 1 page of each process is in the RAM and the RAM is full each process will have a consistent number of pages. In this case you would end up with 3 process 0, 2 process 1 pages, 2 process 2 pages and 1 process 3 page. You are correct that you can update the last access time of the page 0 process 0 after the 5th 0 though.