User-level dynamic page migration for multiprogrammed shared-memory multipropcessors

This paper presents algorithms for improving the performance of parallel programs on multiprogrammed shared-memory NUMA multiprocessors, via the use of user-level dynamic page migration. The idea that drives the algorithms is that a page migration engine call perform accurate and timely page migrations in a multiprogrammed system if it can correlate page reference information with scheduling information obtained from the operating system. The necessary page migrations can be performed as a response to scheduling events that break the implicit association between threads and their memory affinity sets. We present two algorithms that use feedback from the kernel scheduler to aggressively migrate pages upon thread migrations. The first algorithm exploits the iterative nature of parallel programs, while the second targets generic codes without making assumptions on their structure.. Performance evaluation on an SGI Origin 2000 shows that our page migration algorithms provide substantial improvements in throughput Of up to 264% compared to the native IRIX 6.5.5 page placement and migration schemes.