Presentation
PairGraph: An Efficient Search-space-aware Accelerator for High-performance Concurrent Pairwise Queries
DescriptionPairwise queries have been widely used in various applications. However, existing methods still face challenges in handling Concurrent Pairwise Queries (CPQ) due to irregular memory access and fragmented data sharing. To address this, we propose PairGraph, an accelerator that identifies frequently traversed graph structure data and fully reuse the data worth sharing to minimize off-chip communications. Experimental results show that PairGraph achieves 5.59×∼14.25× and 3.76×∼7.58× speedups over software systems Gemini and Gunrock, respectively. It also outperforms the cutting-edge accelerators (LCCG, ScalaGraph, and ReGraph), achieving speedups of 1.67×∼2.72×, 1.93×∼4.26×, and 2.66×∼4.28×, respectively.
Event Type
Research Manuscript
TimeMonday, June 234:45pm - 5:00pm PDT
Location3003, Level 3
DES3: Emerging Models of ComputatioN