DFA-G: A Unified Programming Model for Vertex-centric Parallel Graph Processing

Introduction

Many systems have been built for vertex-centric parallel graph processing. Based on the Bulk Synchronous Parallel (BSP) model, they execute user-defined operations at vertices iteratively and exchange information between vertices by messages. Even though the native BSP systems (e.g. Pregel and Giraph) execute the operations on vertices synchronously within an iteration, many other platforms (e.g. Grace, Blogel and GraphHP) have proposed asynchronous execution for improved efficiency. However, they also bring about an undesirable side effect: a program designed for synchronous platforms may not run properly on asynchronous platforms. DFA-G (Deterministic Finite Automaton for Graph processing) is a unified programming model for vertex-centric parallel graph processing. Built on DFA, DFA-G expresses the computation at a vertex as a process of message-driven state transition. A program modeled after DFA-G can run properly on both synchronous and asynchronous platforms. DFA-G models can be built on a graphical user interface then translated into BSP programs.

Architecture

Documents

• DFA-G Technical Report. More details about the DFA-G programming model.

Download

• DFA-G version 0.6(keep updating). A prototype of DFA-G programming model.