Concurrent Graph Queries on the Lucata Pathfinder
Emory Smith, Shannon Kuntz, Jason Riedy, Martin Deneroff

TL;DR
The paper introduces the Lucata Pathfinder architecture, which enables highly concurrent graph queries with significant speed-ups over traditional systems, improving efficiency for large-scale graph analysis.
Contribution
The novel Lucata Pathfinder architecture combines migratory threads and memory-side processing to significantly enhance concurrent graph query performance.
Findings
Achieves 81-97% speed-up for 522M-edge BFS queries
19× faster than RedisGraph on large server for 128 concurrent BFS
Efficiently supports mixed analyses like connected components and BFS
Abstract
High-performance analysis of unstructured data like graphs now is critical for applications ranging from business intelligence to genome analysis. Towards this, data centers hold large graphs in memory to serve multiple concurrent queries from different users. Even a single analysis often explores multiple options. Current computing architectures often are not the most time- or energy-efficient solutions. The novel Lucata Pathfinder architecture tackles this problem, combining migratory threads for low-latency reading with memory-side processing for high-performance accumulation. One hundred to 750 concurrent breadth-first searches (BFS) all achieve end-to-end speed-ups of 81% to 97% over one-at-a-time queries on a graph with 522M edges. Comparing to RedisGraph running on a large Intel-based server, the Pathfinder achieves a 19 speed-up running 128 BFS queries concurrently. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Caching and Content Delivery · Distributed systems and fault tolerance
