logo

SCIENCE CHINA Information Sciences, Volume 63 , Issue 12 : 229101(2020) https://doi.org/10.1007/s11432-019-2807-4

Demystifying graph processing frameworks and benchmarks

More info
  • ReceivedAug 13, 2019
  • AcceptedFeb 16, 2020
  • PublishedJun 30, 2020

Abstract

There is no abstract available for this article.


Acknowledgment

This work was supported by National Natural Science Foundation of China (Grant Nos. 61602377, 61834005), National Natural Science Foundation of USA (Grant Nos. 1745813, 1725743), and International Science and Technology Cooperation Program of Shaanxi (Grant No. 2018KW-006).


Supplement

Appendixes A–G.


References

[1] Gui C Y, Zheng L, He B. A Survey on Graph Processing Accelerators: Challenges and Opportunities. J Comput Sci Technol, 2019, 34: 339-371 CrossRef Google Scholar

[2] Song S, Liu X, Wu Q. Start late or finish early. Proc VLDB Endow, 2018, 12: 154-168 CrossRef Google Scholar

  • Figure 1

    (Color online) (a) and (b), (c) and (d) are the values of execution time. (a) BFS OK (w/o cross-socket communication); (b) BFS OK (with cross-socket communication); (c) SSSP CA (w/o cross-socket communication); (d) SSSP CA (with cross-socket communication).

Copyright 2020  CHINA SCIENCE PUBLISHING & MEDIA LTD.  中国科技出版传媒股份有限公司  版权所有

京ICP备14028887号-23       京公网安备11010102003388号