The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
GraphR: Accelerating Graph Processing Using ReRAM
Open accessAbstract
Graph processing recently received intensive interests in light of a wide range of needs to understand relationships. It is well-known for the poor locality and high memory bandwidth requirement. In conventional architectures, they incur a significant amount of data movements and energy consumption which motivates several hardware graph processing accelerators. The current graph processing accelerators rely on memory access optimizations or placing computation logics close to memory. Distinct from all existing approaches, we leverage an emerging memory technology to accelerate graph processing with analog computation. This paper presents GRAPHR, the first ReRAM-based graph processing accelerator. GRAPHR follows the principle of near-data processing and explores the opportunity of performing massive parallel analog operations with low hardware and energy cost. The analog computation is suitable for graph processing because: 1) The algorithms are iterative and could inherently tolerate the imprecision; 2) Both probability calculation (e.g., PageRank and Collaborative Filtering) and typical graph algorithms involving integers (e.g., BFS/SSSP) are resilient to errors. The key insight of GRAPHR is that if a vertex program of a graph algorithm can be expressed in sparse matrix vector multiplication (SpMV), it can be efficiently performed by ReRAM crossbar. We show that this assumption is generally true for a large set of graph algorithms. GRAPHR is a novel accelerator architecture consisting of two components: memory ReRAM and graph engine (GE). The core graph computations are performed in sparse matrix format in GEs (ReRAM crossbars). The vector/matrix-based graph computation is not new, but ReRAM offers the unique opportunity to realize the massive parallelism with unprecedented energy efficiency and low hardware cost. With small subgraphs processed by GEs, the gain of performing parallel operations overshadows the wastes due to sparsity. The experiment results show that GRAPHR achieves a 16.01× (up to 132.67×) speedup and a 33.82× energy saving on geometric mean compared to a CPU baseline system. Compared to GPU, GRAPHR achieves 1.69× to 2.19× speedup and consumes 4.77× to 8.91× less energy. GRAPHR gains a speedup of 1.16× to 4.12×, and is 3.67× to 10.96× more energy efficiency compared to PIM-based architecture.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1999) · Cited by 12,854
Conesa, A., Götz, S., García-Gómez, J. M., Terol, J., Talón, M., & Robles, M. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti610 · Cited by 11,495
(2012) · Cited by 9,062
Grossman, P. (2009) · Discrete Mathematics for Computing · doi:10.1007/978-0-230-37405-8_1 · Cited by 8,834
Amazon.com recommendations: item-to-item collaborative filtering
Linden, G., Smith, B., & York, J. (2003) · IEEE Internet Computing · doi:10.1109/mic.2003.1167344 · Cited by 5,403
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601981851 · Cited by 2,959
Wong, H.-S. P., Lee, H.-Y., Yu, S., Chen, Y.-S., Wu, Y., Chen, P.-S., Lee, B., Chen, F. T., & Tsai, M.-J. (2012) · Proceedings of the IEEE · doi:10.1109/jproc.2012.2190369 · Cited by 2,757
Self-citationThe Network Data Repository with Interactive Graph Analytics and Visualization
Rossi, R., & Ahmed, N. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9277 · Cited by 2,412
Lee, M.-J., Lee, C. B., Lee, D., Lee, S. R., Chang, M., Hur, J. H., Kim, Y.-B., Kim, C.-J., Seo, D. H., Seo, S., et al. (2011) · Nature Materials · doi:10.1038/nmat3070 · Cited by 2,228
Collaborative Filtering Recommender Systems
Schafer, J. B., Frankowski, D., Herlocker, J., & Sen, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-72079-9_9 · Cited by 2,120
Graphical Models, Exponential Families, and Variational Inference
Wainwright, M. J., & Jordan, M. I. (2008) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000001 · Cited by 1,820
Distributed GraphLab: a framework for machine learning and data mining in the cloud
Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., & Hellerstein, J. M. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2212351.2212354 · Cited by 1,653
ISAAC: a convolutional neural network accelerator with in-situ analog arithmetic in crossbars
Shafiee, A., Nag, A., Muralimanohar, N., Balasubramonian, R., Strachan, J. P., Hu, M., Williams, R. S., & Srikumar, V. (2016) · ACM SIGARCH Computer Architecture News · doi:10.1145/3007787.3001139 · Cited by 1,536
DaDianNao: A Machine-Learning Supercomputer
Chen, Y., Luo, T., Liu, S., Zhang, S., He, L., Wang, J., Li, L., Chen, T., Xu, Z., Sun, N., et al. (2014) · 2014 47th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1109/micro.2014.58 · Cited by 1,492
Self-citationPowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
Chi, P., Li, S., Xu, C., Zhang, T., Zhao, J., Liu, Y., Wang, Y., & Xie, Y. (2016) · ACM SIGARCH Computer Architecture News · doi:10.1145/3007787.3001140 · Cited by 1,231
Finding high-quality content in social media
Agichtein, E., Castillo, C., Donato, D., Gionis, A., & Mishne, G. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341557 · Cited by 1,230
NVSim: A Circuit-Level Performance, Energy, and Area Model for Emerging Nonvolatile Memory
Dong, X., Xu, C., Xie, Y., & Jouppi, N. P. (2012) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2012.2185930 · Cited by 1,217
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,134
GraphChi: Large-Scale Graph Computation on Just a PC
Kyrola, A., Blelloch, G. E., & Guestrin, C. (2018) · Figshare · doi:10.1184/r1/6605999 · Cited by 868
PipeLayer: A Pipelined ReRAM-Based Accelerator for Deep Learning
Song, L., Qian, X., Li, H., & Chen, Y. (2017) · 2017 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2017.55 · Cited by 833
Self-citationA scalable processing-in-memory accelerator for parallel graph processing
Ahn, J., Hong, S., Yoo, S., Mutlu, O., & Choi, K. (2015) · Proceedings of the 42nd Annual International Symposium on Computer Architecture · doi:10.1145/2749469.2750386 · Cited by 767
Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling
Qureshi, M. K., Karidis, J., Franceschini, M., Srinivasan, V., Lastras, L., & Abali, B. (2009) · Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/1669112.1669117 · Cited by 762
Chesler, E. J., Lu, L., Shou, S., Qu, Y., Gu, J., Wang, J., Hsu, H. C., Mountz, J. D., Baldwin, N. E., Langston, M. A., et al. (2005) · Nature Genetics · doi:10.1038/ng1518 · Cited by 719
Hu, M., Strachan, J. P., Li, Z., Grafals, E. M., Davila, N., Graves, C., Lam, S., Ge, N., Yang, J. J., & Williams, R. S. (2016) · Proceedings of the 53rd Annual Design Automation Conference · doi:10.1145/2897937.2898010 · Cited by 686
X-Stream: edge-centric graph processing using streaming partitions
Roy, A., Mihailovic, I., & Zwaenepoel, W. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522740 · Cited by 673
Cnvlutin: ineffectual-neuron-free deep neural network computing
Albericio, J., Judd, P., Hetherington, T., Aamodt, T., Jerger, N. E., & Moshovos, A. (2016) · ACM SIGARCH Computer Architecture News · doi:10.1145/3007787.3001138 · Cited by 614
Xin, R., Gonzalez, J. E., Franklin, M. J. M., & Stoica, I. G. (2013) · doi:10.1145/2484425.2484427 · Cited by 581
High precision tuning of state for memristive devices by adaptable variation-tolerant algorithm
Alibart, F., Gao, L., Hoskins, B. D., & Strukov, D. B. (2012) · Nanotechnology · doi:10.1088/0957-4484/23/7/075201 · Cited by 557
A Comparative Study into Distributed Load Balancing Algorithms for Cloud Computing
Randles, M., Lamb, D. J., & Taleb-Bendiab, A. (2010) · International Conference on Advanced Information Networking and Applications Workshops (WAINA) · doi:10.1109/waina.2010.85 · Cited by 533
ZSim: fast and accurate microarchitectural simulation of thousand-core systems
Sanchez, D., & Kozyrakis, C. (2013) · Proceedings of the 40th Annual International Symposium on Computer Architecture · doi:10.1145/2485922.2485963 · Cited by 460
Graphical models for machine learning and digital communication
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)90253-5 · Cited by 454
PIM-enabled instructions: a low-overhead, locality-aware processing-in-memory architecture
Ahn, J., Yoo, S., Mutlu, O., & Choi, K. (2015) · Proceedings of the 42nd Annual International Symposium on Computer Architecture · doi:10.1145/2749469.2750385 · Cited by 436
GraphLab: A New Framework For Parallel Machine Learning
Low, Y., Gonzalez, J. E., Kyrola, A., Bickson, D., Guestrin, C., & Hellerstein, J. M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.2041 · Cited by 425
SAP HANA database: data management for modern business applications
Färber, F., Cha, S. K., Primsch, J., Bornhövd, C., Sigg, S., & Lehner, W. (2012) · ACM SIGMOD Record · doi:10.1145/2094114.2094126 · Cited by 396
Pawlowski, J. T. (2011) · 2011 IEEE Hot Chips 23 Symposium (HCS) · doi:10.1109/hotchips.2011.7477494 · Cited by 391
A model of a trust-based recommendation system on a social network
Walter, F. E., Battiston, S., & Schweitzer, F. (2008) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-007-9021-x · Cited by 386
Fast crash recovery in RAMCloud
Ongaro, D., Rumble, S. M., Stutsman, R., Ousterhout, J., & Rosenblum, M. (2011) · Proceedings of the Twenty-Third ACM Symposium on Operating Systems Principles · doi:10.1145/2043556.2043560 · Cited by 360
Graphical Models for Machine Learning and Digital Communication
Frey, B. J. (1998) · The MIT Press eBooks · doi:10.7551/mitpress/3348.001.0001 · Cited by 352
Overcoming the challenges of crossbar resistive memory architectures
Xu, C., Niu, D., Muralimanohar, N., Balasubramonian, R., Zhang, T., Yu, S., & Xie, Y. (2015) · 2015 IEEE 21st International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2015.7056056 · Cited by 340
Biemann, C. (2006) · doi:10.3115/1654758.1654774 · Cited by 322
PowerLyra: differentiated graph computation and partitioning on skewed graphs
Chen, R., Shi, J., Chen, Y., & Chen, H. (2015) · Proceedings of the Tenth European Conference on Computer Systems · doi:10.1145/2741948.2741970 · Cited by 299
Self-citationGunrock: a high-performance graph processing library on the GPU
Wang, Y., Davidson, A., Pan, Y., Wu, Y., Riffel, A., & Owens, J. D. (2015) · Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2688500.2688538 · Cited by 287
Graphicionado: A high-performance and energy-efficient accelerator for graph analytics
Ham, T. J., Wu, L., Sundaram, N., Satish, N., & Martonosi, M. (2016) · 2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2016.7783759 · Cited by 277
GraphPIM: Enabling Instruction-Level PIM Offloading in Graph Computing Frameworks
Nai, L., Hadidi, R., Sim, J., Kim, H., Kumar, P., & Kim, H. (2017) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2017.54 · Cited by 275
Practical Near-Data Processing for In-Memory Analytics Frameworks
Gao, M., Ayers, G., & Kozyrakis, C. (2015) · 2015 International Conference on Parallel Architecture and Compilation (PACT) · doi:10.1109/pact.2015.22 · Cited by 266
GridGraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning
Zhu, X., Han, W., & Chen, W. (2015) · Cited by 261
Graph-based Natural Language Processing and Information Retrieval
Mihalcea, R., & Radev, D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511976247 · Cited by 259
19.7 A 16Gb ReRAM with 200MB/s write and 1GB/s read in 27nm technology
Fackenthal, R., Kitagawa, M., Otsuka, W., Prall, K., Mills, D., Tsutsui, K., Javanifard, J., Tedrow, K., Tsushima, T., Shibahara, Y., et al. (2014) · 2014 IEEE International Solid-State Circuits Conference Digest of Technical Papers (ISSCC) · doi:10.1109/isscc.2014.6757460 · Cited by 217
Hardware realization of BSB recall function using memristor crossbar arrays
Hu, M., Li, H., Wu, Q., & Rose, G. S. (2012) · Proceedings of the 49th Annual Design Automation Conference · doi:10.1145/2228360.2228448 · Cited by 187
Self-citationA 130.7-$\hbox{mm}^{2}$ 2-Layer 32-Gb ReRAM Memory Device in 24-nm Technology
Liu, T.-Y., Yan, T. H., Scheuerlein, R., Chen, Y., Lee, J. K., Balakrishnan, G., Yee, G., Zhang, H., Yap, A., Ouyang, J., et al. (2014) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2013.2280296 · Cited by 179
Self-citationGraphicionado: a high-performance and energy-efficient accelerator for graph analytics
Ham, T. J., Wu, L., Sundaram, N., Satish, N., & Martonosi, M. (2016) · doi:10.5555/3195638.3195707 · Cited by 165
TABLA: A unified template-based framework for accelerating statistical machine learning
Mahajan, D., Park, J., Amaro, E., Sharma, H., Yazdanbakhsh, A., Kim, J. K., & Esmaeilzadeh, H. (2016) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2016.7446050 · Cited by 157
RENO: a high-efficient reconfigurable neuromorphic computing accelerator design
Liu, X., Mao, M., Liu, B., Li, H. H., Chen, Y., Li, B., Wang, Y., Jiang, H., Barnell, M. D., Wu, Q., et al. (2015) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2744769.2744900 · Cited by 145
Self-citationA scalable processing-in-memory accelerator for parallel graph processing
Ahn, J., Hong, S., Yoo, S., Mutlu, O., & Choi, K. (2015) · ACM SIGARCH Computer Architecture News · doi:10.1145/2872887.2750386 · Cited by 134
Hsu, C.-W., Wang, I., Lo, C., et al. (2013) · Symposium on VLSI Technology · Cited by 97
Load the edges you need: a generic I/O optimization for disk-based graph processing
Vora, K., Xu, G. H., & Gupta, R. (2016) · USENIX Annual Technical Conference · Cited by 78
Design of cross-point metal-oxide ReRAM emphasizing reliability and cost
Niu, D., Xu, C., Muralimanohar, N., Jouppi, N. P., & Xie, Y. (2013) · International Conference on Computer Aided Design · doi:10.1109/iccad.2013.6691092 · Cited by 58
Replication-Based Fault-Tolerance for Large-Scale Graph Processing
Wang, P., Zhang, K., Chen, R., Chen, H., & Guan, H. (2014) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2014.58 · Cited by 47
Cited by
AWB-GCN: A Graph Convolutional Network Accelerator with Runtime Workload Rebalancing
Geng, T., Li, A., Shi, R., Wu, C., Wang, T., Li, Y., Haghi, P., Tumeo, A., Che, S., Reinhardt, S., et al. (2020) · 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00079 · Cited by 301
Echo state graph neural networks with analogue random resistive memory arrays
Wang, S., Li, Y., Wang, D., Zhang, W., Chen, X., Dong, D., Wang, S., Zhang, X., Lin, P., Gallicchio, C., et al. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-023-00609-5 · Cited by 84
On the Accuracy of Analog Neural Network Inference Accelerators
Xiao, T. P., Feinberg, B., Bennett, C. H., Prabhakar, V., Saxena, P., Agrawal, V., Agarwal, S., & Marinella, M. J. (2022) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2022.3214409 · Cited by 76
Metadata
- Authors
- Song, L., Zhuo, Y., Qian, X., Li, H., & Chen, Y.
- Venue
- 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA)
- Publisher
- IEEE
- Published
- 2018-02
- Pages
- 531-543
- ISSN
- 1530-0897 (ISSN-L)
- OpenAlex
- W2962903741
- Cited by
- 295
- References
- 60
- FWCI
- 54.27
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.