Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Making caches work for graph analytics

Making caches work for graph analytics

Thumbnail Image
Download
Name

bigdata_making_caches_work.pdf

Description
Accepted version
Size

480.3 KB

Format

Adobe PDF

Checksum (MD5)

6c95c072a02415f40b18d2bebf82f1f6

sword-2019-05-02T17:13:33.original.xml (130 B)
Original SWORD entry document
Author(s)
Zhang, Yunming
•
Kiriansky, Vladimir
•
Mendis, Charith
•
Amarasinghe, Saman
•
Zaharia, Matei A
Date Issued
December 2017
Publisher
IEEE
Citation
Zhang, Yunming, Kiriansky, Vladimir, Mendis, Charith, Amarasinghe, Saman and Zaharia, Matei. 2017. "Making caches work for graph analytics."
Version
Author's final manuscript
Abstract
© 2017 IEEE. Large-scale applications implemented in today's high performance graph frameworks heavily underutilize modern hardware systems. While many graph frameworks have made substantial progress in optimizing these applications, we show that it is still possible to achieve up to 5× speedups over the fastest frameworks by greatly improving cache utilization. Previous systems have applied out-of-core processing techniques from the memory/disk boundary to the cache/DRAM boundary. However, we find that blindly applying such techniques is ineffective because the much smaller performance gap between cache and DRAM requires new designs for achieving scalable performance and low overhead. We present Cagra, a cache optimized inmemory graph framework. Cagra uses a novel technique, CSR Segmenting, to break the vertices into segments that fit in last level cache, and partitions the graph into subgraphs based on the segments. Random accesses in each subgraph are limited to one segment at a time, eliminating the much slower random accesses to DRAM. The intermediate updates from each subgraph are written into buffers sequentially and later merged using a low overhead parallel cache-aware merge. Cagra achieves speedups of up to 5× for PageRank, Collaborative Filtering, Label Propagation and Betweenness Centrality over the best published results from state-of-the-art graph frameworks, including GraphMat, Ligra and GridGraph.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/137371
DOI of Published Version
https://doi.org/10.1109/bigdata.2017.8257937
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.