The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Symbiotic jobscheduling for a simultaneous multithreaded processor
Open accessAbstract
Simultaneous Multithreading machines fetch and execute instructions from multiple instruction streams to increase system utilization and speedup the execution of jobs. When there are more jobs in the system than there is hardware to support simultaneous execution, the operating system scheduler must choose the set of jobs to coscheduleThis paper demonstrates that performance on a hardware multithreaded processor is sensitive to the set of jobs that are coscheduled by the operating system jobscheduler. Thus, the full benefits of SMT hardware can only be achieved if the scheduler is aware of thread interactions. Here, a mechanism is presented that allows the scheduler to significantly raise the performance of SMT architectures. This is done without any advance knowledge of a workload's characteristics, using sampling to identify jobs which run well together.We demonstrate an SMT jobscheduler called SOS. SOS combines an overhead-free sample phase which collects information about various possible schedules, and a symbiosis phase which uses that information to predict which schedule will provide the best performance. We show that a small sample of the possible schedules is sufficient to identify a good schedule quickly. On a system with random job arrivals and departures, response time is improved as much as 17% over a schedule which does not incorporate symbiosis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Proof for the Queuing Formula: L = λ W
Little, J. D. C. (1961) · Operations Research · doi:10.1287/opre.9.3.383 · Cited by 2,777
Simultaneous multithreading: maximizing on-chip parallelism
Tullsen, D. M., Eggers, S. J., & Levy, H. M. (1995) · Proceedings of the 22nd annual international symposium on Computer architecture - ISCA '95 · doi:10.1145/223982.224449 · Cited by 1,405
Self-citationRitchie, D. M., & Thompson, K. (1974) · Communications of the ACM · doi:10.1145/361011.361061 · Cited by 826
Tullsen, D. M., Eggers, S. J., Emer, J. S., Levy, H. M., Lo, J. L., & Stamm, R. L. (1996) · Proceedings of the 23rd annual international symposium on Computer architecture · doi:10.1145/232973.232993 · Cited by 779
Self-citationProceedings of the 56th Hawaii International Conference on System Sciences
(2023) · Proceedings of the Annual Hawaii International Conference on System Sciences · doi:10.24251/hicss.2023.000 · Cited by 749
Scheduling multithreaded computations by work stealing
Blumofe, R. D., & Leiserson, C. E. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365680 · Cited by 409
Converting thread-level parallelism to instruction-level parallelism via simultaneous multithreading
Lo, J. L., Emer, J. S., Levy, H. M., Stamm, R. L., Tullsen, D. M., & Eggers, S. J. (1997) · ACM Transactions on Computer Systems · doi:10.1145/263326.263382 · Cited by 233
Self-citationUNIX Time-Sharing System: UNIX Implementation
Thompson, K. (1978) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1978.tb02137.x · Cited by 178
Improving throughput and utilization in parallel machines through concurrent gang
da Silva, F. A. B., & Scherson, I. D. (2002) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2000.845973 · Cited by 14
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
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
Thread 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
Bubble-flux: precise online QoS management for increased utilization in warehouse scale computers
Yang, H., Breslow, A., Mars, J., & Tang, L. (2013) · Proceedings of the 40th Annual International Symposium on Computer Architecture · doi:10.1145/2485922.2485974 · Cited by 345
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
Metadata
- Authors
- Snavely, A., & Tullsen, D. M.
- Venue
- Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
- Publisher
- ACM
- Published
- 2000-11-12
- Pages
- 234-244
- OpenAlex
- W4238816702
- Cited by
- 484
- References
- 9
- FWCI
- 3.43
- Type
- conference paper
- Language
- en
- Open access
- bronze
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
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.