arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.01406cs.DBcs.DScs.SI
收藏

M-Flash:使用双峰块处理模型的快速十亿级图形计算

M-Flash: Fast Billion-scale Graph Computation Using a Bimodal Block Processing Model

Hugo Gualdron, Robson Cordeiro, Jose Rodrigues-Jr, Duen Chau, Minsuk Kahng, U Kang

摘要:

最近的图形计算方法已经证明,一台PC可以有效地执行十亿规模的图形。虽然这些方法通过优化I/O操作实现了可扩展性,但它们没有充分利用现代硬盘驱动器和处理器的功能。为了克服它们的性能,在这项工作中,我们引入了双峰块处理(BBP),这是一项创新,能够通过进一步最小化I/O成本来提高图形计算。通过这种策略,我们实现了以下贡献:(1)M-Flash,迄今为止最快的图形计算框架;(2)灵活简单的编程模型,可以轻松实现流行的基本图形算法,包括第一个单机十亿级特征值求解器;(3)在多达66亿条边的真实图形上进行了广泛的实验,证明了M-Flash的一致性和显着的加速。

英文摘要:

Recent graph computation approaches have demonstrated that a single PC can perform efficiently on billion-scale graphs. While these approaches achieve scalability by optimizing I/O operations, they do not fully exploit the capabilities of modern hard drives and processors. To overcome their performance, in this work, we introduce the Bimodal Block Processing (BBP), an innovation that is able to boost the graph computation by minimizing the I/O cost even further. With this strategy, we achieved the following contributions: (1) M-Flash, the fastest graph computation framework to date; (2) a flexible and simple programming model to easily implement popular and essential graph algorithms, including the first single-machine billion-scale eigensolver; and (3) extensive experiments on real graphs with up to 6.6 billion edges, demonstrating M-Flash's consistent and significant speedup.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑