English

DFOGraph: An I/O- and Communication-Efficient System for Distributed Fully-out-of-Core Graph Processing

Distributed, Parallel, and Cluster Computing 2021-01-19 v1

Abstract

With the magnitude of graph-structured data continually increasing, graph processing systems that can scale-out and scale-up are needed to handle extreme-scale datasets. While existing distributed out-of-core solutions have made it possible, they suffer from limited performance due to excessive I/O and communication costs. We present DFOGraph, a distributed fully-out-of-core graph processing system that applies and assembles multiple techniques to enable I/O- and communication-efficient processing. DFOGraph builds upon two-level column-oriented partition with adaptive compressed representations to allow fine-grained selective computation and communication, and it only issues necessary disk and network requests. Our evaluation shows DFOGraph achieves performance comparable to GridGraph and FlashGraph (>2.52x and 1.06x) on a single machine and outperforms Chaos and HybridGraph significantly (>12.94x and >10.82x) when scaling out.

Keywords

Cite

@article{arxiv.2101.06911,
  title  = {DFOGraph: An I/O- and Communication-Efficient System for Distributed Fully-out-of-Core Graph Processing},
  author = {Jiping Yu and Wei Qin and Xiaowei Zhu and Zhenbo Sun and Jianqiang Huang and Xiaohan Li and Wenguang Chen},
  journal= {arXiv preprint arXiv:2101.06911},
  year   = {2021}
}

Comments

12 pages, 5 figures, 7 tables

R2 v1 2026-06-23T22:15:42.626Z