2 papers
cs.AR2025
PIM-FW: Hardware-Software Co-Design of All-pairs Shortest Paths in DRAM
Tsung-Han Lu, Zheyu Li, Minxuan Zhou +1
All-pairs shortest paths (APSP) is a fundamental algorithm used for routing, logistics, and network analysis, but the cubic time complexity and heavy data movement of the canonical…
cs.AR2025
RAPID-Graph: Recursive All-Pairs Shortest Paths Using Processing-in-Memory for Dynamic Programming on Graphs
Yanru Chen, Zheyu Li, Keming Fan +5
All-pairs shortest paths (APSP) remains a major bottleneck for large-scale graph analytics, as data movement with cubic complexity overwhelms the bandwidth of conventional memory h…