An efficient memory data organization strategy for application-characteristic graph processing

<正>1 Introduction Graph processing has received significant attention for its ability to cope with large-scale and complex unstructured data in the real-world.However,most of the graph processing applications exhibit an irregular memory access pattern which leads to a poor locality in the memory access stream [1],and [2] reveals that the sub-optimal use of the cache hierarchy can result in the CPU only works in the range of 10%to 45%of the overall graph processing time.