articleMay 26, 2015Closed access

A scalable processing-in-memory accelerator for parallel graph processing

Seoul National University · Carnegie Mellon University

Indexed incrossref

Abstract

The explosion of digital data and the ever-growing need for fast data analysis have made in-memory big-data processing in computer systems increasingly important. In particular, large-scale graph processing is gaining attention due to its broad applicability from social science to machine learning. However, scalable hardware design that can efficiently process large graphs in main memory is still an open problem. Ideally, cost-effective and scalable graph processing systems can be realized by building a system whose performance increases proportionally with the sizes of graphs that can be stored in the system, which is extremely challenging in conventional systems due to severe memory bandwidth limitations.

Citation impact

757
total citations
FWCI
46.41
Percentile
100%
References
58
Citations per year

Authors

5

Topics & keywords

Keywords
  • Computer science
  • Scalability
  • Graph
  • Parallel computing
  • Big data
  • Computer architecture
  • Distributed memory
  • Data processing
No related works found for this paper.

Funding