The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Parallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems
Abstract
In a chip-multiprocessor (CMP) system, the DRAM system is shared among cores. In a shared DRAM system, requests from a thread can not only delay requests from other threads by causing bank/bus/row-buffer conflicts but they can also destroy other threadspsilaDRAM-bank-level parallelism. Requests whose latencies would otherwise have been overlapped could effectively become serialized. As are sult both fairness and system throughput degrade, and some thread scan starve for long time periods. This paper proposes a fundamentally new approach to designing a shared DRAM controller that provides quality of service to threads,while also improving system throughput. Our parallelism-aware batch scheduler (PAR-BS) design is based on two key ideas. First, PARBS processes DRAM requests in batches to provide fairness and to avoid starvation of requests. Second, to optimize system throughput,PAR-BS employs a parallelism-aware DRAM scheduling policy that aims to process requests from a thread in parallel in the DRAM banks, thereby reducing the memory-related stall-time experienced by the thread. PAR-BS seamlessly incorporates support for system-level thread priorities and can provide different service levels, including purely opportunistic service, to threads with different priorities.We evaluate the design trade-offs involved in PAR-BS and compare it to four previously proposed DRAM scheduler designs on 4-, 8-, and16-core systems. Our evaluations show that, averaged over 100 4-core workloads, PAR-BS improves fairness by 1.11X and system through put by 8.3% compared to the best previous scheduling technique, Stall-Time Fair Memory (STFM) scheduling. Based on simple request prioritization rules, PAR-BS is also simpler to implement than STFM.
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
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
Various optimizers for single‐stage production
Smith, W. E. (1956) · Naval Research Logistics Quarterly · doi:10.1002/nav.3800030106 · Cited by 1,831
An Efficient Algorithm for Exploiting Multiple Arithmetic Units
Tomasulo, R. M. (1967) · IBM Journal of Research and Development · doi:10.1147/rd.111.0025 · Cited by 898
Runahead execution: an alternative to very large instruction windows for out-of-order processors
Mutlu, O., Stark, J., Wilkerson, C., & Patt, Y. N. (2003) · The Ninth International Symposium on High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings. · doi:10.1109/hpca.2003.1183532 · Cited by 440
Self-citationStall-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-citationMicroarchitecture Optimizations for Exploiting Memory-Level Parallelism
Chou, Y., Fahs, B. M., & Abraham, S. G. (2004) · ACM SIGARCH Computer Architecture News · doi:10.1145/1028176.1006708 · Cited by 205
Efficient Runahead Execution: Power-Efficient Memory Latency Tolerance
Mutlu, O., Kim, H., & Patt, Y. N. (2006) · IEEE Micro · doi:10.1109/mm.2006.10 · Cited by 57
Self-citation
Cited by
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-citationError Characterization, Mitigation, and Recovery in Flash-Memory-Based Solid-State Drives
Cai, Y., Ghose, S., Haratsch, E. F., Luo, Y., & Mutlu, O. (2017) · Proceedings of the IEEE · doi:10.1109/jproc.2017.2713127 · Cited by 343
Self-citationMemory power management via dynamic voltage/frequency scaling
David, H., Fallin, C., Gorbatov, E., Hanebutte, U. R., & Mutlu, O. (2011) · Proceedings of the 8th ACM international conference on Autonomic computing · doi:10.1145/1998582.1998590 · Cited by 334
Self-citationTiered-latency DRAM: A low latency and low cost DRAM architecture
Lee, D., Kim, Y., Seshadri, V., Liu, J., Subramanian, L., & Mutlu, O. (2013) · 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2013.6522354 · Cited by 263
Self-citation
Metadata
- Authors
- Mutlu, O., & Moscibroda, T.
- Venue
- 2008 International Symposium on Computer Architecture
- Publisher
- IEEE
- Published
- 2008-06
- Pages
- 63-74
- ISSN
- 1063-6897 (ISSN-L)
- OpenAlex
- W4236382111
- Cited by
- 345
- References
- 7
- FWCI
- 13.58
- 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: Parallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems. https://app.cochat.ai/papers/10.1109/isca.2008.7
- The paper
- Mutlu, O., & Moscibroda, T. (2008). Parallelism-Aware Batch Scheduling: Enhancing both Performance and Fairness of Shared DRAM Systems. 2008 International Symposium on Computer Architecture. https://doi.org/10.1109/isca.2008.7
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.