Please help transcribe this video using our simple transcription tool. You need to be logged in to do so.


The parallel performance of applications running on Non-Uniform Memory Access (NUMA) platforms is strongly in- ?uenced by the relative placement of memory pages to the threads that access them. As a consequence there are Linux application programmer interfaces (APIs) to control this. For large parallel codes it can, however, be dif?cult to determine how and when to use these APIs. In this paper we introduce the NUMAgrind pro?ling tool which can be used to simplify this process. It extends the Valgrind binary translation framework to include a model which incorporates cache coherency, memory locality domains and interconnect traf?c for arbitrary NUMA topologies. Using NUMAgrind, cache misses can be mapped to memory locality domains, page access modes determined, and pages that are referenced by multiple threads quickly determined. We show how the NUMAgrind tool can be used to guide the use of Linux memory and thread placement APIs in the Gaussian computational chemistry code. The performance of the code before and after use of these APIs is also presented for three different commodity NUMA platforms.

Questions and Answers

You need to be logged in to be able to post here.