DH-Falcon: A Language for Large-Scale Graph Processing on Distributed Heterogeneous Systems

Graph models of social information systems typically contain trillions of edges. Such big graphs cannot beprocessed on a single machine. The graph object must bepartitioned and distributed among machines and processedin parallel on a computer cluster. Programming such systemsis very challenging. In...

Full description

Saved in:
Bibliographic Details
Main Authors: Cheramangalath, Unnikrishnan, Nasre, Rupesh, Srikant, Y. N.
Format: Conference Proceeding
Language:English
Subjects:
Clustering algorithms
Computational modeling
CUDA
Distribute systems
Distributed graph processing
Domain-specific languages
DSL
Dynamic graph algorithms
Falcon
Graphics processing units
Heuristic algorithms
Mirrors
MPI
OpenMP
Partitioning algorithms
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Graph models of social information systems typically contain trillions of edges. Such big graphs cannot beprocessed on a single machine. The graph object must bepartitioned and distributed among machines and processedin parallel on a computer cluster. Programming such systemsis very challenging. In this work, we present DH-Falcon, a graph DSL (domain-specific language) which can be usedto implement parallel algorithms for large-scale graphs, tar-geting Distributed Heterogeneous (CPU and GPU) clusters. DH-Falcon compiler is built on top of the Falcon compiler, which targets single node devices with CPU and multipleGPUs. An important facility provided by DH-Falcon is that itsupports mutation of graph objects, which allows programmerto write dynamic graph algorithms. Experimental evaluationshows that DH-Falcon matches or outperforms state-of-the-art frameworks and gains a speedup of up to 13×.
ISSN:2168-9253
DOI:10.1109/CLUSTER.2017.72