The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers
Abstract
Modern chip multiprocessor (CMP) systems employ multiple memory controllers to control access to main memory. The scheduling algorithm employed by these memory controllers has a significant effect on system throughput, so choosing an efficient scheduling algorithm is important. The scheduling algorithm also needs to be scalable - as the number of cores increases, the number of memory controllers shared by the cores should also increase to provide sufficient bandwidth to feed the cores. Unfortunately, previous memory scheduling algorithms are inefficient with respect to system throughput and/or are designed for a single memory controller and do not scale well to multiple memory controllers, requiring significant finegrained coordination among controllers. This paper proposes ATLAS (Adaptive per-Thread Least-Attained-Service memory scheduling), a fundamentally new memory scheduling technique that improves system throughput without requiring significant coordination among memory controllers. The key idea is to periodically order threads based on the service they have attained from the memory controllers so far, and prioritize those threads that have attained the least service over others in each period. The idea of favoring threads with least-attained-service is borrowed from the queueing theory literature, where, in the context of a single-server queue it is known that least-attained-service optimally schedules jobs, assuming a Pareto (or any decreasing hazard rate) workload distribution. After verifying that our workloads have this characteristic, we show that our implementation of least-attained-service thread prioritization reduces the time the cores spend stalling and significantly improves system throughput. Furthermore, since the periods over which we accumulate the attained service are long, the controllers coordinate very infrequently to form the ordering of threads, thereby making ATLAS scalable to many controllers. We evaluate ATLAS on a wide variety of multiprogrammed SPEC 2006 workloads and systems with 4-32 cores and 1-16 memory controllers, and compare its performance to five previously proposed scheduling algorithms. Averaged over 32 workloads on a 24-core system with 4 controllers, ATLAS improves instruction throughput by 10.8%, and system throughput by 8.4%, compared to PAR-BS, the best previous CMP memory scheduling algorithm. ATLAS's performance benefit increases as the number of cores increases.
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
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
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) · ACM SIGPLAN Notices · doi:10.1145/1064978.1065034 · Cited by 3,180
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
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
Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
Schrage, L. E. (1968) · Operations Research · doi:10.1287/opre.16.3.687 · Cited by 561
Symbiotic jobscheduling for a simultaneous mutlithreading processor
Snavely, A., & Tullsen, D. M. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.357011 · Cited by 535
Symbiotic jobscheduling for a simultaneous multithreaded processor
Snavely, A., & Tullsen, D. M. (2000) · Proceedings of the ninth international conference on Architectural support for programming languages and operating systems · doi:10.1145/378993.379244 · Cited by 484
Exploiting process lifetime distributions for dynamic load balancing
Harchol-Balter, M., & Downey, A. B. (1997) · ACM Transactions on Computer Systems · doi:10.1145/263326.263344 · Cited by 442
Self-citationLebeck, A. R., Fan, X., Zeng, H., & Ellis, C. (2000) · ACM SIGPLAN Notices · doi:10.1145/356989.356999 · Cited by 370
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-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-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-citationGoogle Workloads for Consumer Devices: Mitigating Data Movement Bottlenecks
Boroumand, A., Ghose, S., Kim, Y., Ausavarungnirun, R., Shiu, E., Thakur, R., Kim, D., Kuusela, A., Knies, A., Ranganathan, P., et al. (2018) · Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3173162.3173177 · Cited by 273
Self-citation
Metadata
- Authors
- Kim, Y., Han, D., Mutlu, O., & Harchol-Balter, M.
- Venue
- HPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture
- Publisher
- IEEE
- Published
- 2010-01
- Pages
- 1-12
- OpenAlex
- W1964316448
- Cited by
- 430
- References
- 22
- FWCI
- 22.77
- 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: ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers. https://app.cochat.ai/papers/10.1109/hpca.2010.5416658
- The paper
- Kim, Y., Han, D., Mutlu, O., & Harchol-Balter, M. (2010). ATLAS: A scalable and high-performance scheduling algorithm for multiple memory controllers. HPCA - 16 2010 The Sixteenth International Symposium on High-Performance Computer Architecture. https://doi.org/10.1109/hpca.2010.5416658
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.