SCIENCE CHINA Information Sciences, Volume 60 , Issue 12 : 126102(2017) https://doi.org/10.1007/s11432-017-9226-8

Towards dataflow based graph processing

More info
  • ReceivedMay 18, 2017
  • AcceptedAug 21, 2017
  • PublishedNov 8, 2017


There is no abstract available for this article.


This work was supported by National High Technology Research and Development Program of China (863 Program) (Grant No. 2015AA015303).


[1] Malewicz G, Austern M H, Bik A J, et al. Pregel: a system for large-scale graph processing. In: Proceedings of ACM SIGMOD International Conference on Management of Data. Indiana: ACM, 2010. 135--146. Google Scholar

[2] Zhang Z Y. Community structure detection in social networks based on dictionary learning. Sci China Inf Sci, 2013, 56: 078103. Google Scholar

[3] Gonzalez J E, Low Y, Gu H, et al. Powergraph: distributed graph-parallel computation on natural graphs. In: Proceedings of USENIX Symposium on Operating Systems Design and Implementation. Hollywood: USENIX, 2012. 17--30. Google Scholar

[4] Beamer S, Asanovic K, Patterson D. Locality exists in graph processing: workload characterization on an Ivy bridge server. In: Proceedings of IEEE International Symposium on Workload Characterization, Atlanta, 2015. 56--65. Google Scholar

[5] Ham T J, Wu L, Sundaram N, et al. Graphicionado: a high-performance and energy-efficient accelerator for graph analytics. In: Proceedings of International Symposium on Microarchitecture, Taipei, 2016. 1--13. Google Scholar

[6] Ozdal M M, Yesil S, Kim T, et al. Energy efficient architecture for graph analytics accelerators. In: Proceedings of Annual International Symposium on Computer Architecture, Seoul, 2016. 166--177. Google Scholar

[7] Jouppi N P, Young C, Patil N, et al. In-datacenter performance analysis of a tensor processing unit. In: Proceedings of Annual International Symposium on Computer Architecture. Toronto: ACM, 2017. 1--12. Google Scholar


Contact and support