Modeling memory access behavior for data mapping. (May 2017)

• Record Type: Journal Article
• Authors: Diener, Matthias; Cruz, Eduardo HM; Navaux, Philippe OA
• Other Names: Aldinucci Marco guest-editor.; Brorsson Mats guest-editor.; D'Agostino Daniele guest-editor.; Daneshtalab Masoud guest-editor.; Kilpatrick Peter guest-editor.; Leppänen Ville guest-editor.
• Is Part Of: International journal of high performance computing applications. Volume 31:Number 3(2017)
• Page Start: 212
• Page End: 228
• Publication Date: 2017-05
• Subjects: NUMA -- data mapping -- locality -- balance -- memory access behavior; High performance computing -- Periodicals; Supercomputers -- Periodicals; 004.1105
• DOI: 10.1177/1094342016640056
• Languages: English
• ISSNs: 1094-3420

Abstract

Many modern parallel architectures feature a nonuniform memory access (NUMA) behavior since they contain several memory controllers. In such architectures, deciding where to place memory pages has a high influence on the performance of parallel applications. This placement of pages to NUMA nodes is called data mapping. Two basic types of data mapping policies exist, focusing on improving the locality or the balance of memory accesses. In this article, we introduce a comprehensive set of metrics to characterize the memory access behavior of parallel applications with the aim of describing their suitability for different data mapping policies. We present and evaluate different policies that improve locality, balance, or both. Experiments were performed on three highly different NUMA architectures with two parallel benchmark suites. Results show that the improvements of the policies depend on the characteristics of the architectures and applications, and that our characterization has a high accuracy regarding the behavior. We also find that a mixed policy, which takes both locality and balance into account, can lead to the highest gains overall, while avoiding the performance losses that are caused by applying simple policies that focus only on one metric.