The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Self-Optimizing Memory Controllers: A Reinforcement Learning Approach
Abstract
Efficiently utilizing off-chip DRAM bandwidth is a critical issuein designing cost-effective, high-performance chip multiprocessors(CMPs). Conventional memory controllers deliver relativelylow performance in part because they often employ fixed,rigid access scheduling policies designed for average-case applicationbehavior. As a result, they cannot learn and optimizethe long-term performance impact of their scheduling decisions,and cannot adapt their scheduling policies to dynamic workloadbehavior.We propose a new, self-optimizing memory controller designthat operates using the principles of reinforcement learning (RL)to overcome these limitations. Our RL-based memory controllerobserves the system state and estimates the long-term performanceimpact of each action it can take. In this way, the controllerlearns to optimize its scheduling policy on the fly to maximizelong-term performance. Our results show that an RL-basedmemory controller improves the performance of a set of parallelapplications run on a 4-core CMP by 19% on average (upto 33%), and it improves DRAM bandwidth utilization by 22%compared to a state-of-the-art controller.
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
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Barto, A. G. (1998) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)38315-5 · Cited by 2,976
The SPLASH-2 programs: characterization and methodological considerations
Woo, S. C., Ohara, M., Torrie, E., Singh, J. P., & Gupta, A. (2002) · Proceedings 22nd Annual International Symposium on Computer Architecture · doi:10.1109/isca.1995.524546 · Cited by 1,601
Generalization in Reinforcement Learning: Successful Examples Using Sparse Coarse Coding
Sutton, R. S. (1995) · Cited by 1,072
Caruana, R., & Freitag, D. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50012-x · Cited by 545
Self-citationDynamic branch prediction with perceptrons
Jiménez, D. A., & Lin, C. (2002) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2001.903263 · Cited by 427
Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors
Mutlu, O., & Moscibroda, T. (2007) · 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007) · doi:10.1109/micro.2007.21 · Cited by 327
Self-citationA Q-learning-based dynamic channel assignment technique for mobile communication systems
Nie, J., & Haykin, S. (1999) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.790549 · Cited by 181
Ghosh, M., & Lee, H.-H. S. (2007) · Proceedings of the ... annual International Symposium on Microarchitecture/Proceedings of the annual International Symposium on Microarchitecture · doi:10.1109/micro.2007.13 · Cited by 148
ScalParC: a new scalable and efficient parallel classification algorithm for mining large datasets
Joshi, M. V., Karypis, G., & Kumar, V. (2002) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipps.1998.669983 · Cited by 147
Cited by
Reinforcement Learning and Its Applications in Modern Power and Energy Systems: A Review
Cao, D., Hu, W., Zhao, J., Zhang, G., Zhang, B., Liu, Z., Chen, Z., & Blaabjerg, F. (2020) · Journal of Modern Power Systems and Clean Energy · doi:10.35833/mpce.2020.000552 · Cited by 460
ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers
Kim, Y., Han, D., Mutlu, O., & Harchol-Balter, M. (2010) · HPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture · doi:10.1109/hpca.2010.5416658 · Cited by 430
Self-citationThread Cluster Memory Scheduling: Exploiting Differences in Memory Access Behavior
Kim, Y., Papamichael, M., Mutlu, O., & Harchol-Balter, M. (2010) · 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1109/micro.2010.51 · Cited by 408
Self-citationRowClone: fast and energy-efficient in-DRAM bulk data copy and initialization
Seshadri, V., Kim, Y., Fallin, C., Lee, D., Ausavarungnirun, R., Pekhimenko, G., Luo, Y., Mutlu, O., Gibbons, P. B., Kozuch, M. A., et al. (2013) · Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/2540708.2540725 · Cited by 337
Self-citationA case for exploiting subarray-level parallelism (SALP) in DRAM
Kim, Y., Seshadri, V., Lee, D., Liu, J., & Mutlu, O. (2012) · ACM SIGARCH Computer Architecture News · doi:10.1145/2366231.2337202 · Cited by 259
Self-citation
Metadata
- Authors
- Ipek, E., Mutlu, O., Martínez, J. F., & Caruana, R.
- Venue
- 2008 International Symposium on Computer Architecture
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 39-50
- ISSN
- 1063-6897 (ISSN-L)
- OpenAlex
- W3147501999
- Cited by
- 278
- References
- 14
- FWCI
- 10.63
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Self-Optimizing Memory Controllers: A Reinforcement Learning Approach. https://app.cochat.ai/papers/10.1109/isca.2008.21
- The paper
- Ipek, E., Mutlu, O., Martínez, J. F., & Caruana, R. (2008). Self-Optimizing Memory Controllers: A Reinforcement Learning Approach. 2008 International Symposium on Computer Architecture. https://doi.org/10.1109/isca.2008.21
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.