Cache-Fair Thread Scheduling for Multicore Processors
Alexandra Fedorova, Margo Seltzer, Michael D. Smith · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · 2006
We present a new operating system scheduling algorithm for multicore processors. Our algorithm reduces the effects of unequal CPU cache sharing that occur on these processors and cause unfair CPU sharing, priority inversion, and inadequate CPU accounting. We describe the implementation of our algorithm in the Solaris operating system and demonstrate that it produces fairer schedules enabling better priority enforcement and improved performance stability for applications. With conventional scheduling algorithms, application performance on multicore processors varies by up to 36% depending on the runtime characteristics of concurrent processes. We reduce this variability by up to a factor of seven.
Cited by 57 works. Open-access PDF
Authors
References
- An introduction to probability theory and its applications
- Piranha
- An analytical cache model
- Fair Cache Sharing and Partitioning in a Chip Multiprocessor Architecture
- Predicting Inter-Thread Cache Contention on a Chip Multi-Processor Architecture
- A new memory monitoring scheme for memory-aware scheduling and partitioning
- Analysis of multithreaded architectures for parallel computing
- Tornado: maximizing locality and concurrency in a shared memory multiprocessor operating system
- Locality phase prediction
- Analytic evaluation of shared-memory systems with ILP processors