map-numa: access patterns used to characterize the numa memory access optimization techniques and algorithms

ISCAS OpenIR

	map-numa: access patterns used to characterize the numa memory access optimization techniques and algorithms
	Luo Qiuming; Liu Chenjian; Kong Chang; Cai Ye
	2012
会议名称	9th IFIP International Conference on Network and Parallel Computing, NPC 2012
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	208-216
会议日期	September 6, 2012 - September 8, 2012
会议地点	Gwangju, Korea, Republic of
收录类别	EI
ISSN	0302-9743
ISBN	9783642356056
部门归属	(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
摘要	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.
关键词	Algorithms Optimization Parallel Architectures
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15956
专题	中国科学院软件研究所
推荐引用方式 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.