Vertex-Centric Visual Programming for Graph Neural Networks
Graph neural networks (GNNs) have achieved remarkable performance in many graph analytics tasks such as node classification, link prediction and graph clustering. Existing GNN systems (e.g., PyG and DGL) adopt a tensor-centric programming model and train GNNs with manually written operators. Such design results in poor usability due to the large semantic gap between the API and the GNN models, and suffers from inferior efficiency because of high memory consumption and massive data movement. We demonstrateSeastar, a novel GNN training framework that adopts avertex-centric programming paradigm and supportsautomatic kernel generation, to simplify model development and improve training efficiency. We will (i) show how to express GNN models succinctly using a visual "drag-and-drop'' interface or Seastar's vertex-centric python API; (ii) demonstrate the performance advantage of Seastar over existing GNN systems in convergence speed, training throughput and memory consumption; and (iii) illustrate how Seastar's optimizations (e.g., operator fusion and constant folding) improve training efficiency by profiling the run-time performance.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph ClusteringLink PredictionNode ClassificationSimilar Papers 제목 키워드 기반
Cavs: A Vertex-centric Programming Interface for Dynamic Neural Networks
Recent deep learning (DL) models have moved beyond static network architectures to dynamic ones, handling data where the network structure changes every example, such as sequences of variable lengths, trees, and graphs. …
Dynamic neural networksgraph constructionManagementSchedulingSeastar: vertex-centric programming for graph neural networks
Graph neural networks (GNNs) have achieved breakthrough performance in graph analytics such as node classification, link prediction and graph clustering. Many GNN training frameworks have been developed, but they are usu…
GPUGraph ClusteringLink PredictionNode ClassificationVMap: An Interactive Rectangular Space-filling Visualization for Map-like Vertex-centric Graph Exploration
We present VMap, a map-like rectangular space-filling visualization, to perform vertex-centric graph exploration. Existing visualizations have limited support for quality optimization among rectangular aspect ratios, ver…
Layout GenerationRhizomes and Diffusions for Processing Highly Skewed Graphs on Fine-Grain Message-Driven Systems
The paper provides a unified co-design of 1) a programming and execution model that allows spawning tasks from within the vertex data at runtime, 2) language constructs for \textit{actions} that send work to where the da…
A Hypergraph-Partitioned Vertex Programming Approach for Large-scale Consensus Optimization
In modern data science problems, techniques for extracting value from big data require performing large-scale optimization over heterogenous, irregularly structured data. Much of this data is best represented as multi-re…
hypergraph partitioning