Institutional Repository
| map-numa: access patterns used to characterize the numa memory access optimization techniques and algorithms | |
| Luo Qiuming; Liu Chenjian; Kong Chang; Cai Ye | |
| 2012 | |
| Conference Name | 9th IFIP International Conference on Network and Parallel Computing, NPC 2012 |
| Source | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 208-216 |
| Conference Date | September 6, 2012 - September 8, 2012 |
| Conference Place | Gwangju, Korea, Republic of |
| Indexed Type | EI |
| ISSN | 0302-9743 |
| ISBN | 9783642356056 |
| Department | (1) National High Performance Computing Center (NHPCC) Shenzhen China; (2) College of Computer Science and Software Engineering Shenzhen University China; (3) State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China |
| English 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. © IFIP International Federation for Information Processing 2012.; 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. © IFIP International Federation for Information Processing 2012. |
| Keyword | Algorithms Optimization Parallel Architectures |
| Language | 英语 |
| Content Type | 会议论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15956 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Luo Qiuming,Liu Chenjian,Kong Chang,et al. map-numa: access patterns used to characterize the numa memory access optimization techniques and algorithms[C],2012:208-216. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment