Hybrid BFS Approach Using Semi-External Memory

Hybrid BFS Approach Using Semi-External Memory
复制标题

使用半外部存储器的混合 BFS 方法

DOI:
10.1109/ipdpsw.2014.189
复制
发表时间:
2014
期刊:
The 3rd High Performance Data Intensive Computing Workshop (HPDIC2014 ) in conjunction with IEEE International Conference on Parallel and Distributed Processing Symposium 2014 (IPDPS2014)
影响因子:
--
通讯作者:
Satoshi Matsuoka
Satoshi Matsuoka
中科院分区:
--
文献类型:
--
作者:
Keita Iwabuchi;Hitoshi Sato;Ryo Mizote;Yuichiro Yasui;Katsuki Fujisawa;Satoshi Matsuoka

文献摘要

相似文献

NVM devices will greatly expand the possibility of processing extremely large-scale graphs that exceed the DRAM capacity of the nodes, however, efficient implementation based on detailed performance analysis of access patterns of unstructured graph kernel on systems that utilize a mixture of DRAM and NVM devices has not been well investigated. We introduce a graph data offloading technique using NVMs that augment the hybrid BFS (Breadth-first search) algorithm widely used in the Graph500 benchmark, and conduct performance analysis to demonstrate the utility of NVMs for unstructured data. Experimental results of a Scale27 problem of a Kronecker graph compliant to the Graph500 benchmark show that our approach maximally sustains 4.22 Giga TEPS (Traversed Edges Per Second), reducing DRAM size by half with only 19.18% performance degradation on a 4-way AMD Opteron 6172 machine heavily equipped with NVM devices. Although direct comparison is difficult, this is significantly greater than the result of 0.05 GTEPS for a SCALE 36 problem by using 1TB of DRAM and 12 TB of NVM as reported by Pearce et al. Although our approach uses higher DRAM to NVM ratio, we show that a good compromise is achievable between performance vs. capacity ratio for processing large-scale graphs. This result as well as detailed performance analysis of the proposed technique suggests that we can process extremely large-scale graphs per node with minimum performance degradation by carefully considering the data structures of a given graph and the access patterns to both DRAM and NVM devices. As a result, our implementation has achieved 4.35 MTEPS/W(Mega TEPS per Watt) and ranked 4th on November 2013 edition of the Green Graph500 list in the Big Data category by using only a single fat server heavily equipped with NVMs.