Reinventing Scheduling for Multicore Systems
High performance on multicore processors requires that schedulers be reinvented. Traditional schedulers focus on keeping execution units busy by assigning each core a thread to run. Schedulers ought to focus, however, on high utilization of on-chip memory, rather than of execution cores, to red...
Main Authors: | Boyd-Wickizer, Silas, Morris, Robert Tappan, Kaashoek, M. Frans |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
IEEE Computer Society Press
2011
|
Online Access: | http://hdl.handle.net/1721.1/65870 https://orcid.org/0000-0001-7098-586X https://orcid.org/0000-0003-2700-9286 |
Similar Items
-
A Software Approach to Unifying Multicore Caches
by: Boyd-Wickizer, Silas, et al.
Published: (2011) -
OpLog: a library for scaling update-heavy data structures
by: Boyd-Wickizer, Silas, et al.
Published: (2014) -
Optimizing MapReduce for Multicore Architectures
by: Kaashoek, Frans, et al.
Published: (2010) -
The scalable commutativity rule: designing scalable software for multicore processors
by: Clements, Austin T., et al.
Published: (2014) -
An Analysis of Linux Scalability to Many Cores
by: Boyd-Wickizer, Silas, et al.
Published: (2011)