FastBFS: Fast Breadth-First Graph Search on a Single Server

@article{Cheng2016FastBFSFB,
  title={FastBFS: Fast Breadth-First Graph Search on a Single Server},
  author={Shu-han Cheng and Guangyan Zhang and Jiwu Shu and Qingda Hu and Weimin Zheng},
  journal={2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
  year={2016},
  pages={303-312}
}
Big graph computing can be performed over a single node, using recent systems such as GraphChi and XStream. Breadth-first graph search (a.k.a., BFS) has a pattern of marking each vertex only once as “visited” and then not using them in further computations. Existing single-server graph computing systems fail to take advantage of such access pattern of BFS for performance optimization, hence suffering from a lot of extra I/O latencies due to accessing no longer useful data elements of a big… CONTINUE READING
1 Extracted Citations
28 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 28 references

Directionoptimizing breadth-first search

  • S. Beamer, C K.Asanovi, D. Patterson
  • SC’12, 2012, pp. 12:1– 12:10.
  • 2012
Highly Influential
3 Excerpts

Benchmarking x-stream and graphchi

  • L. Bindschaedler, R. Amitabha
  • LABOS, EPFL, Tech. Rep., 2015.
  • 2015
1 Excerpt

Similar Papers

Loading similar papers…