一句话：提出 pulse，将指针遍历下推至靠近分离式内存处执行的分布式框架，实现低延迟、高吞吐与高能效。
分离式内存架构在 CPU 节点设置缓存以摊薄跨网络访问的高延迟，但对于需要沿链式数据结构进行指针遍历（pointer traversal）的负载，缓存本质上是无效的。作者主张把这类遍历加速放到更靠近分离式内存的位置，同时满足三点要求：保持对多种链式结构的表达力、保证能效与性能、支持分布式执行。为此设计了 pulse——一个面向机架级分离式内存的分布式指针遍历框架。评测表明，对于仅靠缓存表现很差的多种指针遍历负载，pulse 能够提供低延迟、高吞吐且高能效的执行。
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.
DOI 原文 · arXiv · PDF（开放获取） · DBLP
@inproceedings{TangLBK25,
title = {<scp>pulse:</scp>
Accelerating Distributed Pointer-Traversals on Disaggregated Memory},
author = {Yupeng Tang and Seung-seob Lee and Abhishek Bhattacharjee and Anurag Khandelwal},
booktitle = {ASPLOS},
year = {2025},
doi = {10.1145/3669940.3707253}
}