PULSE: Accelerating Distributed Pointer-Traversals on Disaggregated Memory (Extended Version)

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Tang, Yupeng, Lee, Seung-seob, Bhattacharjee, Abhishek, Khandelwal, Anurag
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866913610828087296
author Tang, Yupeng
Lee, Seung-seob
Bhattacharjee, Abhishek
Khandelwal, Anurag
author_facet Tang, Yupeng
Lee, Seung-seob
Bhattacharjee, Abhishek
Khandelwal, Anurag
contents Caches at CPU nodes in disaggregated memory architectures amortize the high data access latency over the network. However, such caches are fundamentally unable to improve performance for workloads requiring pointer traversals across linked data structures. We argue for accelerating these pointer traversals closer to disaggregated memory in a manner that preserves expressiveness for supporting various linked structures, ensures energy efficiency and performance, and supports distributed execution. We design PULSE, a distributed pointer-traversal framework for rack-scale disaggregated memory to meet all the above requirements. Our evaluation of PULSE shows that it enables low-latency, high-throughput, and energy-efficient execution for a wide range of pointer traversal workloads on disaggregated memory that fare poorly with caching alone.
format Preprint
id arxiv_https___arxiv_org_abs_2305_02388
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle PULSE: Accelerating Distributed Pointer-Traversals on Disaggregated Memory (Extended Version)
Tang, Yupeng
Lee, Seung-seob
Bhattacharjee, Abhishek
Khandelwal, Anurag
Distributed, Parallel, and Cluster Computing
Caches at CPU nodes in disaggregated memory architectures amortize the high data access latency over the network. However, such caches are fundamentally unable to improve performance for workloads requiring pointer traversals across linked data structures. We argue for accelerating these pointer traversals closer to disaggregated memory in a manner that preserves expressiveness for supporting various linked structures, ensures energy efficiency and performance, and supports distributed execution. We design PULSE, a distributed pointer-traversal framework for rack-scale disaggregated memory to meet all the above requirements. Our evaluation of PULSE shows that it enables low-latency, high-throughput, and energy-efficient execution for a wide range of pointer traversal workloads on disaggregated memory that fare poorly with caching alone.
title PULSE: Accelerating Distributed Pointer-Traversals on Disaggregated Memory (Extended Version)
topic Distributed, Parallel, and Cluster Computing
url https://arxiv.org/abs/2305.02388