NUMA policies and their relation to memory architecture
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
| Hi-index | 0.00 |
An important issue in NonUniform memory Access, NUMA, multiprocessors is the extent to which dynamic placement of pages can improve performance. We argue that empirical results concerning reference patterns imply that much of the proper page placement can be done initially (and statically). Consequently, intelligent intelligent initial placement causes a significant limit on the additional improvement due to dynamic placement. We quantify this limitation in the case of NUMA machines with two levels of memory access times such as the BBN Butterfly GP1000. This result implies that useful comparisons of dynamic placement policies have to assume intelligent initial placement policies.