Concurrent Graph Queries on the Lucata Pathfinder

  title={Concurrent Graph Queries on the Lucata Pathfinder},
  author={Emory Smith and Shannon K. Kuntz and Jason Riedy and Martin M. Deneroff},
—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… 

Figures and Tables from this paper



CongraPlus: Towards Efficient Processing of Concurrent Graph Queries on NUMA Machines

This work proposes CongraPlus, a NUMA-aware scheduler that intelligently manages concurrent graph analytics queries for better system throughput and memory bandwidth efficiency and implements it in C++ on top of the Ligra graph processing framework.

Congra: Towards Efficient Processing of Concurrent Graph Queries on Shared-Memory Machines

This work investigates the management of multiple graph processing queries on shared-memory machines, and proposes Congra, a dynamic graph scheduler that intelligently manages multiple concurrent graph queries for better system throughput and resource efficiency.

Low-latency graph streaming using compressed purely-functional trees

This paper designs theoretically-efficient and practical algorithms for performing batch updates to C-trees, and shows that it can store massive dynamic real-world graphs using only a few bytes per edge, thereby achieving space usage close to that of the best static graph processing frameworks.

GraphX: a resilient distributed graph system on Spark

GraphX is introduced, which combines the advantages of both data-parallel and graph-par parallel systems by efficiently expressing graph computation within the Spark data- parallel framework and provides powerful new operations to simplify graph construction and transformation.

A New Algorithmic Model for Graph Analysis of Streaming Data

A new and practical algorithm model is formalized that includes both single-run analysis as well as efficiently updating analysis results only around changed data, the first formal model for graph analysis with concurrent changes.

Wukong+G: Fast and Concurrent RDF Query Processing Using RDMA-assisted GPU Graph Exploration

Wukong+G is presented, the first graph-based distributed RDF query processing system that efficiently exploits the hybrid parallelism of CPU and GPU and can improve both latency and throughput by more than one order of magnitude when facing hybrid workloads.

ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms

The ConnectIt framework is designed, which provides different sampling strategies as well as various tree linking and compression schemes, and is able to compute connectivity on the largest publicly-available graph in under 10 seconds using a 72-core machine.

PowerLyra: Differentiated Graph Computation and Partitioning on Skewed Graphs

It is argued that skewed distributions in natural graphs also necessitate differentiated processing on high-degree and low-degree vertices, and PowerLyra, a new distributed graph processing system that embraces the best of both worlds of existing graph-parallel systems is introduced.

Optimizing Parallel Graph Connectivity Computation via Subgraph Sampling

Afforest is proposed: an extension of the Shiloach-Vishkin connected components algorithm that approaches optimal work efficiency by processing subgraphs in each iteration, and it is shown that the algorithm exhibits higher memory locality than existing methods.

Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs

The implications of the skewed degree distribution of real-world graphs on their connectivity are investigated and these features are used to introduce Thrifty Label Propagation as a structure-aware CC algorithm obtained by incorporating 4 fundamental optimization techniques in the Labelpropagation CC algorithm.