Kazuhiro Saito, Hiroko Midorikawa, Munenori Kai
IPSJ SIG Notes, Jun 10, 2010
The authors already revealed that a user-level remote memory paging system, which provides a larger size of memory beyond that of local physical memory by using remote memory distributed over cluster nodes, is higher performance and more stable than a kernel-level one. It requires an efficient page replacement algorithm because the remote page swap is critical in performance for using the remote memory. However, an user-level software can be hardly apply its page replacement algorithm using memory access information in OS. If it uses pseudo memory access information, it can be applied the efficient page replacement algorithm. But this cost and performance are not evaluated sufficiently. In this paper, we implement and evaluate pseudo memory access bits, and reveal that it can be used actually. Furthermore, we compare page replacement algorithms using them and not using, the Clock algorithm, the NRU and pseudo-LRU, Simple algorithm, page replacement algorithm using swap-in history, the Random algorithm and the FIFO.