Cache-Fair Thread Scheduling for Multicore Processors

DSpace/Manakin Repository

Cache-Fair Thread Scheduling for Multicore Processors

Citable link to this page


Title: Cache-Fair Thread Scheduling for Multicore Processors
Author: Fedorova, Alexandra; Seltzer, Margo I.; Smith, Michael D.

Note: Order does not necessarily reflect citation order of authors.

Citation: Fedorova, Alexandra, Margo Seltzer, and Michael D. Smith. 2006. Cache-Fair Thread Scheduling for Multicore Processors. Harvard Computer Science Group Technical Report TR-17-06.
Full Text & Related Files:
Abstract: 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.
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at
Citable link to this page:
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search