CIC-PIM: Trading spare computing power for memory space in graph processing
Authors:
- Yongxuan ZhangYZYongxuan Zhang
- Hong JiangHJHong Jiang
- Fang WangFWFang Wang
- Yu HuaYHYu Hua
- Dan FengDFDan Feng
- Yongli ChengYCYongli Cheng
- Yuchong HuYHYuchong Hu
- Renzhi XiaoRenzhi Xiao
- 1 January 2021
- journal article
- research article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 147, 152-165
Abstract
No abstract availableKeywords
Funding Information
- National Key Research and Development Program of China
- National Major Science and Technology Projects of China
This publication has 22 references indexed in Scilit:
- Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+2015
- Faster set intersection with SIMD instructions by reducing branch mispredictionsProceedings of the VLDB Endowment, 2014
- Using the Intel Many Integrated Core to accelerate graph traversalThe International Journal of High Performance Computing Applications, 2014
- Counting Triangles in Massive Graphs with MapReduceSIAM Journal on Scientific Computing, 2014
- Counting triangles in real-world networks using projectionsKnowledge and Information Systems, 2010
- Efficient index compression in DB2 LUWProceedings of the VLDB Endowment, 2009
- Main-memory triangle computations for very large (sparse (power-law)) graphsTheoretical Computer Science, 2008
- Scientific Computing Kernels on the Cell ProcessorInternational Journal of Parallel Programming, 2007
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Matrix methods for calculating the triad censusSocial Networks, 1998