CoChat

In-Memory Data Parallel Processor

Fujiki, Daichi, Mahlke, Scott, Das, Reetuparna · 2018 · Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

Recent developments in Non-Volatile Memories (NVMs) have opened up a new horizon for in-memory computing. Despite the significant performance gain offered by computational NVMs, previous works have relied on manual mapping of specialized kernels to the memory arrays, making it infeasible to execute more general workloads. We combat this problem by proposing a programmable in-memory processor architecture and data-parallel programming framework. The efficiency of the proposed in-memory processor comes from two sources: massive parallelism and reduction in data movement. A compact instruction set provides generalized computation capabilities for the memory array. The proposed programming framework seeks to leverage the underlying parallelism in the hardware by merging the concepts of data-flow and vector processing. To facilitate in-memory programming, we develop a compilation framework that takes a TensorFlow input and generates code for our in-memory processor. Our results demonstrate 7.5x speedup over a multi-core CPU server for a set of applications from Parsec and 763x speedup over a server-class GPU for a set of Rodinia benchmarks.

Overview

Integrity signals

Registry

Crossref · 10.1145/3173162.3173171

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 5 references

Research works printed but not linked: 2

  1. Shaizeen Aga , Supreet Jeloka , Arun Subramaniyan , Satish Narayanasamy , David Blaauw , and Reetuparna Das . 2017 . Compute Caches 2017 IEEE International Symposium on High Performance Computer Architecture, HPCA 2017 , Austin, TX, USA, February 4--8 , 2017. IEEE. Shaizeen Aga, Supreet Jeloka, Arun Subramaniyan, Satish Narayanasamy, David Blaauw, and Reetuparna Das. 2017. Compute Caches 2017 IEEE International Symposium on High Performance Computer Architecture, HPCA 2017, Austin, TX, USA, February 4--8, 2017. IEEE.
  2. Chris Yakopcic and Tarek M Taha . 2013 . Energy efficient perceptron pattern recognition using segmented memristor crossbar arrays. In Neural Networks (IJCNN) , The 2013 International Joint Conference on. IEEE, 1--8. Chris Yakopcic and Tarek M Taha. 2013. Energy efficient perceptron pattern recognition using segmented memristor crossbar arrays. In Neural Networks (IJCNN), The 2013 International Joint Conference on. IEEE, 1--8.

Cited by

See all 109

Metadata

Authors
Fujiki, D., Mahlke, S., & Das, R.
Affiliations
University of Michigan (US)
Venue
Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems
Publisher
ACM
Published
2018-03-19
Pages
1-14
OpenAlex
W2794243109
Cited by
109
References
5
Citations by year
2026: 2 · 2025: 3 · 2024: 3 · 2023: 9 · 2022: 16 · 2021: 27 · 2020: 24 · 2019: 19 · 2018: 6
FWCI
16.34
Type
conference paper
Language
en
Open access
closed
Locations
International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (publishedVersion)
Funders
NSF (1652294)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Memory and Neural Computing
  • Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
Keywords
in-memory computing, non-volatile memory, data-parallel programming, dataflow programming, vector processing, TensorFlow, data movement reduction, parallelism

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: In-Memory Data Parallel Processor. https://app.cochat.ai/papers/10.1145/3173162.3173171
The paper
Fujiki, D., Mahlke, S., & Das, R. (2018). In-Memory Data Parallel Processor. Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems. https://doi.org/10.1145/3173162.3173171

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.