GraFBoost: Using Accelerated Flash Storage for External Graph Analytics
Autor: | Shuotao Xu, Sang-Woo Jun, Arvind, Sizhuo Zhang, Andrew Wright |
---|---|
Rok vydání: | 2018 |
Předmět: |
010302 applied physics
Vertex (graph theory) Xeon Computer science business.industry 02 engineering and technology Parallel computing External sorting 01 natural sciences 020202 computer hardware & architecture Software Analytics 0103 physical sciences 0202 electrical engineering electronic engineering information engineering Hardware acceleration Field-programmable gate array business Dram |
Zdroj: | ISCA |
DOI: | 10.1109/isca.2018.00042 |
Popis: | We describe GraFBoost, a flash-based architecture with hardware acceleration for external analytics of multi-terabyte graphs. We compare the performance of GraFBoost with 1 GB of DRAM against various state-of-the-art graph analytics software including FlashGraph, running on a 32-thread Xeon server with 128 GB of DRAM. We demonstrate that despite the relatively small amount of DRAM, GraFBoost achieves high performance with very large graphs no other system can handle, and rivals the performance of the fastest software platforms on sizes of graphs that existing platforms can handle. Unlike in-memory and semi-external systems, GraFBoost uses a constant amount of memory for all problems, and its performance decreases very slowly as graph sizes increase, allowing GraFBoost to scale to much larger problems than possible with existing systems while using much less resources on a single-node system. The key component of GraFBoost is the sort-reduce accelerator, which implements a novel method to sequentialize fine-grained random accesses to flash storage. The sort-reduce accelerator logs random update requests and then uses hardware-accelerated external sorting with interleaved reduction functions. GraFBoost also stores newly updated vertex values generated in each superstep of the algorithm lazily with the old vertex values to further reduce I/O traffic. We evaluate the performance of GraFBoost for PageRank, breadth-first search and betweenness centrality on our FPGA-based prototype (Xilinx VC707 with 1 GB DRAM and 1 TB flash) and compare it to other graph processing systems including a pure software implementation of GrapFBoost. |
Databáze: | OpenAIRE |
Externí odkaz: |