Graph Analytics on Manycore Memory Systems
Graphs are ubiquitous, and graph analytics has been widely adopted in many big data applications such as social computation and natural language processing, as well as web-search and recommendation systems. Prior research focuses on processing large-scale graphs on distributed environments or a sing...
Gespeichert in:
Veröffentlicht in: | IEEE access 2018-01, Vol.6, p.51429-51439 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Graphs are ubiquitous, and graph analytics has been widely adopted in many big data applications such as social computation and natural language processing, as well as web-search and recommendation systems. Prior research focuses on processing large-scale graphs on distributed environments or a single multi-core machine with several terabytes of RAM. Increasing complex memory systems and on-chip interconnects are developed to mitigate the data movement bottlenecks in manycore processors such as Xeon Phi KNL CPU with heterogeneous memory, with up to 72 dual-core tiles. This paper presents a detailed study on the characteristics of manycore memory systems and their impact on the efficiency of graph analytics. Based on this paper, we introduce Ants, the first graph analytics platform on manycore memory systems. First, Ants differentially allocates graph data according to their access patterns and the behavior of heterogeneous memory. Second, to reduce excessive memory access and ease congestion on interconnects and memory controllers, Ants develops a fine-grained and effective task partitioning strategy for many cores. A detailed experiment on a 64 dual-core tile machine shows that Ants outperforms the state-of-the-art graph analytics platform-Ligra by up to 8.97X for real-world graphs. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2018.2869463 |