The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors
Abstract
DRAM memory is a major resource shared among cores in a chip multiprocessor (CMP) system. Memory requests from different threads can interfere with each other. Existing memory access scheduling techniques try to optimize the overall data throughput obtained from the DRAM and thus do not take into account inter-thread interference. Therefore, different threads running together on the same chip can experience extremely different memory system performance: one thread can experience a severe slowdown or starvation while another is unfairly prioritized by the memory scheduler. This paper proposes a new memory access scheduler, called the Stall-Time Fair Memory scheduler (STFM), that provides quality of service to different threads sharing the DRAM memory system. The goal of the proposed scheduler is to "equalize " the DRAM-related slowdown experienced by each thread due to interference from other threads, without hurting overall system performance. As such, STFM takes into account inherent memory characteristics of each thread and does not unfairly penalize threads that use the DRAM system without interfering with other threads. We show that STFM significantly reduces the unfairness in the DRAM system while also improving system throughput (i.e., weighted speedup of threads) on a wide variety of workloads and systems. For example, averaged over 32 different workloads running on an 8-core CMP, the ratio between the highest DRAM-related slowdown and the lowest DRAM-related slowdown reduces from 5.26X to 1.4X, while the average system throughput improves by 7.6%. We qualitatively and quantitatively compare STFM to one new and three previously- proposed memory access scheduling algorithms, including network fair queueing. Our results show that STFM provides the best fairness, system throughput, and scalability.
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
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Daubechies, I., & Heil, C. (1992) · Computers in Physics · doi:10.1063/1.4823127 · Cited by 15,631
Scheduling algorithms for multiprogramming in a hard-real-time environment
Liu, C. L., & Layland, J. W. (1973) · Journal of the ACM · doi:10.1145/321738.321743 · Cited by 8,433
Orthonormal bases of compactly supported wavelets
Daubechies, I. (1988) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160410705 · Cited by 8,190
Wattch: a framework for architectural-level power analysis and optimizations
Brooks, D., Tiwari, V., & Martonosi, M. (2000) · Proceedings of the 27th annual international symposium on Computer architecture - ISCA '00 · doi:10.1145/339647.339657 · Cited by 2,578
Graphical Methods for Data Analysis.
Healy, M. J. R., Chambers, J. M., Cleveland, W. S., Kleiner, B., & Tukey, P. A. (1984) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2981587 · Cited by 2,315
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065034 · Cited by 2,310
Graphical Methods for Data Analysis.
Fisher, N. I., Chambers, J. M., Cleveland, W. S., Kleiner, B., & Tukey, P. A. (1984) · Biometrics · doi:10.2307/2531418 · Cited by 1,982
Multifrequency channel decompositions of images and wavelet models
Mallat, S. G. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.45554 · Cited by 1,955
Cited by
RAIDR: Retention-Aware Intelligent DRAM Refresh
Liu, J., Jaiyen, B., Veras, R., & Mutlu, O. (2012) · ACM SIGARCH Computer Architecture News · doi:10.1145/2366231.2337161 · Cited by 444
Self-citationATLAS: 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-citationSelf-Optimizing Memory Controllers: A Reinforcement Learning Approach
Ipek, E., Mutlu, O., Martínez, J. F., & Caruana, R. (2008) · ACM SIGARCH Computer Architecture News · doi:10.1145/1394608.1382172 · Cited by 362
Self-citationParallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems
Mutlu, O., & Moscibroda, T. (2008) · 2008 International Symposium on Computer Architecture · doi:10.1109/isca.2008.7 · Cited by 345
Self-citation
Metadata
- Authors
- Mutlu, O., & Moscibroda, T.
- Venue
- 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007)
- Publisher
- IEEE
- Published
- 2007
- Pages
- 146-160
- ISSN
- 1072-4451 (ISSN-L)
- OpenAlex
- W2132269953
- Cited by
- 327
- References
- 23
- FWCI
- 8.84
- 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: Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors. https://app.cochat.ai/papers/10.1109/micro.2007.21
- The paper
- Mutlu, O., & Moscibroda, T. (2007). Stall-Time Fair Memory Access Scheduling for Chip Multiprocessors. 40th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO 2007). https://doi.org/10.1109/micro.2007.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.