A Tale of Two Paths: Toward a Hybrid Data Plane for Efficient Far-Memory Applications
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913402418364416 |
|---|---|
| author | Chen, Lei Liu, Shi Wang, Chenxi Ma, Haoran Qiao, Yifan Wang, Zhe Wu, Chenggang Lu, Youyou Feng, Xiaobing Cui, Huimin Lu, Shan Xu, Harry |
| author_facet | Chen, Lei Liu, Shi Wang, Chenxi Ma, Haoran Qiao, Yifan Wang, Zhe Wu, Chenggang Lu, Youyou Feng, Xiaobing Cui, Huimin Lu, Shan Xu, Harry |
| contents | With rapid advances in network hardware, far memory has gained a great deal of traction due to its ability to break the memory capacity wall. Existing far memory systems fall into one of two data paths: one that uses the kernel's paging system to transparently access far memory at the page granularity, and a second that bypasses the kernel, fetching data at the object granularity. While it is generally believed that object fetching outperforms paging due to its fine-grained access, it requires significantly more compute resources to run object-level LRU and eviction.
We built Atlas, a hybrid data plane enabled by a runtime-kernel co-design that simultaneously enables accesses via these two data paths to provide high efficiency for real-world applications. Atlas uses always-on profiling to continuously measure page locality. For workloads already with good locality, paging is used to fetch data, whereas for those without, object fetching is employed. Object fetching moves objects that are accessed close in time to contiguous local space, dynamically improving locality and making the execution increasingly amenable to paging, which is much more resource-efficient. Our evaluation shows that Atlas improves the throughput (e.g., by 1.5x and 3.2x) and reduces the tail latency (e.g., by one and two orders of magnitude) when using remote memory, compared with AIFM and Fastswap, the state-of-the-art techniques respectively in the two categories. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_16005 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Tale of Two Paths: Toward a Hybrid Data Plane for Efficient Far-Memory Applications Chen, Lei Liu, Shi Wang, Chenxi Ma, Haoran Qiao, Yifan Wang, Zhe Wu, Chenggang Lu, Youyou Feng, Xiaobing Cui, Huimin Lu, Shan Xu, Harry Distributed, Parallel, and Cluster Computing With rapid advances in network hardware, far memory has gained a great deal of traction due to its ability to break the memory capacity wall. Existing far memory systems fall into one of two data paths: one that uses the kernel's paging system to transparently access far memory at the page granularity, and a second that bypasses the kernel, fetching data at the object granularity. While it is generally believed that object fetching outperforms paging due to its fine-grained access, it requires significantly more compute resources to run object-level LRU and eviction. We built Atlas, a hybrid data plane enabled by a runtime-kernel co-design that simultaneously enables accesses via these two data paths to provide high efficiency for real-world applications. Atlas uses always-on profiling to continuously measure page locality. For workloads already with good locality, paging is used to fetch data, whereas for those without, object fetching is employed. Object fetching moves objects that are accessed close in time to contiguous local space, dynamically improving locality and making the execution increasingly amenable to paging, which is much more resource-efficient. Our evaluation shows that Atlas improves the throughput (e.g., by 1.5x and 3.2x) and reduces the tail latency (e.g., by one and two orders of magnitude) when using remote memory, compared with AIFM and Fastswap, the state-of-the-art techniques respectively in the two categories. |
| title | A Tale of Two Paths: Toward a Hybrid Data Plane for Efficient Far-Memory Applications |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2406.16005 |