Hieroglyph: Locally-Sufficient Graph Processing via Compute-Sync-Merge
Despite their widespread adoption, large-scale graph processing systems do not fully decouple computation and communication, often yielding suboptimal performance. Locally-sufficient computation-computation that relies only on the graph state local to a computing host-can mitigate the effects of thi...
Gespeichert in:
Veröffentlicht in: | Proceedings of the ACM on measurement and analysis of computing systems 2017-06, Vol.1 (1), p.1-25 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!