article · 2000
Symbiotic Jobscheduling for a Simultaneous Multithreading Processor
Allan Snavely, Dean M. Tullsen, Multithreading Processor
Cited by 0Abstract and details only
Abstract
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 coschedule This 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 anyadvance 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 variou...
Cite this paper
Snavely, A., Tullsen, D. M., & Processor, M. (2000). Symbiotic Jobscheduling for a Simultaneous Multithreading Processor.
Snavely, Allan, et al. “Symbiotic Jobscheduling for a Simultaneous Multithreading Processor.” 2000.
Snavely, Allan, Dean M. Tullsen, and Multithreading Processor. 2000. “Symbiotic Jobscheduling for a Simultaneous Multithreading Processor.”
Snavely, A., Tullsen, D.M. and Processor, M. (2000) ‘Symbiotic Jobscheduling for a Simultaneous Multithreading Processor’.
@article{snavely2000symbiotic,
title = {{Symbiotic Jobscheduling for a Simultaneous Multithreading Processor}},
author = {Snavely, Allan and Tullsen, Dean M. and Processor, Multithreading},
year = {2000}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.