skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

Conference ·

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.

Research Organization:
City of Los Angeles Department
Sponsoring Organization:
USDOE Office of Electricity (OE)
DOE Contract Number:
OE0000192
OSTI ID:
1332680
Report Number(s):
DOE-USC-00192-87
Resource Relation:
Journal Volume: 8632; Conference: Euro-Par Porto, Portugal August 25-26, 2014
Country of Publication:
United States
Language:
English

Similar Records

Scalable Pattern Matching in Metadata Graphs via Constraint Checking
Journal Article · Mon Jan 04 00:00:00 EST 2021 · ACM Transactions on Parallel Computing · OSTI ID:1332680

Synchronization-Avoiding Graph Algorithms
Conference · Mon Dec 17 00:00:00 EST 2018 · OSTI ID:1332680

Graph Mining Meets the Semantic Web
Conference · Thu Jan 01 00:00:00 EST 2015 · OSTI ID:1332680

Related Subjects