Abstract: Post-copy algorithm needs process to resume running while address space is incomplete. Due to the frequently occurring page faults， it would cause process executing intermittently which may significantly reduce migration efficiency. So， a new migration algorithm named as Pre-record was proposed to solve this problem. Based on the proposed algorithm， process execution on host node would be prolonged and the visited memory pages would be recorded. Host node will migrate these recorded pages preferentially， and then continue to push the rest of the address space. This can guarantee that the needed memory pages could have been acquired at the beginning phase of process resume running in which phase page faults have the highest frequency. Analysis and simulation experiments show that Pre-record algorithm can reduce the occurrence rate of page faults effectively and improve the efficiency of process migration， and it also has the advantages of short freeze time and less residual dependence.

Key words: address space, distributed system, process migration, post-copy algorithm, page fault