MAP-numa: Access Patterns Used to Characterize the NUMA Memory Access Optimization Techniques and Algorithms - Network and Parallel Computing Access content directly
Conference Papers Year : 2012

MAP-numa: Access Patterns Used to Characterize the NUMA Memory Access Optimization Techniques and Algorithms

Abstract

Some typical memory access patterns are provided and programmed in C, which can be used as benchmark to characterize the various techniques and algorithms aim to improve the performance of NUMA memory access. These access patterns, called MAP-numa (Memory Access Patterns for NUMA), currently include three classes, whose working data sets are corresponding to 1-dimension array, 2-dimension matrix and 3-dimension cube. It is dedicated for NUMA memory access optimization other than measuring the memory bandwidth and latency. MAP-numa is an alternative to those exist benchmarks such as STREAM, pChase, etc. It is used to verify the optimizations’ (made automatically/manually to source code/executive binary) capacities by investigating what locality leakage can be remedied. Some experiment results are shown, which give an example of using MAP-numa to evaluate some optimizations based on Oprofile sampling.
Fichier principal
Vignette du fichier
978-3-642-35606-3_24_Chapter.pdf (373.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01551378 , version 1 (30-06-2017)

Licence

Attribution

Identifiers

Cite

Qiuming Luo, Chenjian Liu, Chang Kong, Ye Cai. MAP-numa: Access Patterns Used to Characterize the NUMA Memory Access Optimization Techniques and Algorithms. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. pp.208-216, ⟨10.1007/978-3-642-35606-3_24⟩. ⟨hal-01551378⟩
56 View
160 Download

Altmetric

Share

Gmail Facebook X LinkedIn More