2016 IEEE International Conference on Cluster Computing (CLUSTER) 2016
DOI: 10.1109/cluster.2016.42
|View full text |Cite
|
Sign up to set email alerts
|

Exploring Data Migration for Future Deep-Memory Many-Core Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 21 publications
0
6
0
Order By: Relevance
“…A solution based on re-purposing arenabased heap management to keep locality among related data structures that are used together is discussed in [23]. Two mechanisms available on modern Linux systems for migrating data between physical locations are analysed in [24]. Memory migration mechanisms within the Linux kernel are far behind a simple user-space memory copy, and, with additional software degradation, a regular NUMA system can reasonably approach the bandwidth of a deep-memory architecture.…”
Section: B Migrationmentioning
confidence: 99%
“…A solution based on re-purposing arenabased heap management to keep locality among related data structures that are used together is discussed in [23]. Two mechanisms available on modern Linux systems for migrating data between physical locations are analysed in [24]. Memory migration mechanisms within the Linux kernel are far behind a simple user-space memory copy, and, with additional software degradation, a regular NUMA system can reasonably approach the bandwidth of a deep-memory architecture.…”
Section: B Migrationmentioning
confidence: 99%
“…This section will summarize some upcoming changes to the existing technologies but also the expected impact of more speculative technologies that require more research before they find their way into data centers. An important trend is the addition of wider buses and asynchronous protocols for data movement in the form of NVMe and also the support for highbandwidth memory (HBM) [74]. HBM requires architecture changes, which are not backwards compatible with older hardware, but will bring significant benefit to bandwidth-bound applications [73].…”
Section: Technologiesmentioning
confidence: 99%
“…We use this graph as input for the simulations and run the scheduling and mapping heuristics presented in Section 5. For the experiments, we extend the previous study developed for parallel stencil applications in [19] and provide a deep-memory implementation of the 1D Gauss-Seidel kernel for the KNL architecture. First, we copy tiles to migrate input and output data between slow and fast memory.…”
Section: Experimental Settingsmentioning
confidence: 99%
“…Data migration addresses the issue of moving data dynamically across memories during the execution of the application. Preliminary work [19] on this approach showcased that performance of a simple stencil benchmark can be improved by migration, using a scheme similar to out-of-core algorithms, when the computedensity of the application kernel is high enough to provide compute/migration overlapping. Closer to the focus of this paper, another study [6] discussed a runtime method to schedule tasks with data dependencies on a deep memory platform.…”
Section: Introductionmentioning
confidence: 99%