Simple graph algorithms such as PageRank have been the target of numerous hardware accelerators. Yet, there also exist much more complex graph mining algorithms for problems …
The performance of large-scale graph processing suffers from challenges including poor locality, lack of scalability, random access pattern, and heavy data conflicts. Some …
J Zhao, K Yang, X Wei, Y Ding, L Hu… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Aiming at the current problems that most physical hosts in the cloud data center are so overloaded that it makes the whole cloud data center'load imbalanced and that existing load …
A critical step of genome sequence analysis is the mapping of sequenced DNA fragments (ie, reads) collected from an individual to a known linear reference genome sequence (ie …
Graph analytics is an emerging application which extracts insights by processing large volumes of highly connected data, namely graphs. The parallel processing of graphs has …
Non-relational database systems (NRDS) such as graph and key-value have gained attention in various trending business and analytical application domains. However, while …
In this paper, we propose a novel design for large-scale graph processing on FPGA. Our design uses large external memory for storing massive graph data and FPGA for …
J Ma, G Zuo, K Loughlin, X Cheng, Y Liu… - Proceedings of the …, 2020 - dl.acm.org
Cloud providers widely deploy FPGAs as application-specific accelerators for customer use. These providers seek to multiplex their FPGAs among customers via virtualization, thereby …
S Zhou, VK Prasanna - 2017 29th International Symposium on …, 2017 - ieeexplore.ieee.org
Hardware accelerators for graph analytics have gained increasing interest. Vertex-centric and edge-centric paradigms are widely used to design graph analytics accelerators …