2013 3rd IEEE International Advance Computing Conference (IACC) 2013
DOI: 10.1109/iadcc.2013.6506812
|View full text |Cite
|
Sign up to set email alerts
|

Performance enhancement of NUMA multiprocessor systems with on-demand memory migration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…Task placement affects contention between resources for the cache and cores, and data placement affects the memory access cost for a task. To utilize system resources more efficiently and increase performance, many studies [7][8][9][10][11][12][13][14][15] design specific placements of tasks and data to decrease resource contention, balance the loads in the cores, and reduce access to remote memory. The solutions focus on improving the performance of Symmetric Multi-processing (SMP) and Non-Uniform Memory Access (NUMA) [2] systems.…”
Section: Technological Background and Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Task placement affects contention between resources for the cache and cores, and data placement affects the memory access cost for a task. To utilize system resources more efficiently and increase performance, many studies [7][8][9][10][11][12][13][14][15] design specific placements of tasks and data to decrease resource contention, balance the loads in the cores, and reduce access to remote memory. The solutions focus on improving the performance of Symmetric Multi-processing (SMP) and Non-Uniform Memory Access (NUMA) [2] systems.…”
Section: Technological Background and Related Workmentioning
confidence: 99%
“…Migrating memory pages to the NUMA node on which their requesting task is currently running reduces remote memory access. Mishra and Mehta [15] proposed an on-demand memory migration policy that migrates only the referenced pages to the current node where the requesting task is running. Terboven et al [11] proposed a user-level implementation of a Next-touch approach in Linux.…”
Section: Related Workmentioning
confidence: 99%
“…Their experiments showed that the kernel‐based implementation is 30% faster than the user‐space model and has much lower overhead when migrating small memory. Mishra and Mehta also presented a memory migration on‐demand policy similar to the Next‐touch approach. Their implementation is also performed using the madvise() system call invoked by applications and a modified kernel page fault handler.…”
Section: Technology Background and Related Workmentioning
confidence: 99%