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...

Full description

Bibliographic Details
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
_version_ 1826209702869991424
author Boyd-Wickizer, Silas
Morris, Robert Tappan
Kaashoek, M. Frans
author2 Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
author_facet Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Boyd-Wickizer, Silas
Morris, Robert Tappan
Kaashoek, M. Frans
author_sort Boyd-Wickizer, Silas
collection MIT
description 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 reduce the impact of expensive DRAM and remote cache accesses. A challenge in achieving good use of on-chip memory is that the memory is split up among the cores in the form of many small caches. This paper argues for a form of scheduling that assigns each object and its operations to a specific core, moving a thread among the cores as it uses different objects.
first_indexed 2024-09-23T14:27:28Z
format Article
id mit-1721.1/65870
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T14:27:28Z
publishDate 2011
publisher IEEE Computer Society Press
record_format dspace
spelling mit-1721.1/658702022-10-01T21:25:15Z Reinventing Scheduling for Multicore Systems Boyd-Wickizer, Silas Morris, Robert Tappan Kaashoek, M. Frans Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Morris, Robert Tappan Morris, Robert Tappan Kaashoek, M. Frans 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 reduce the impact of expensive DRAM and remote cache accesses. A challenge in achieving good use of on-chip memory is that the memory is split up among the cores in the form of many small caches. This paper argues for a form of scheduling that assigns each object and its operations to a specific core, moving a thread among the cores as it uses different objects. 2011-09-16T17:42:17Z 2011-09-16T17:42:17Z 2009-05 Article http://purl.org/eprint/type/ConferencePaper 1530-1621 http://hdl.handle.net/1721.1/65870 Boyd-Wickizer, Silas, Robert Morris, and M. Frans Kaashoek. "Reinventing Scheduling for Multicore Systems." 12th Workshop on Hot Topics in Operating Systems, HotOS XII, May 18-20, 2009, Monte Verita, Switzerland. https://orcid.org/0000-0001-7098-586X https://orcid.org/0000-0003-2700-9286 en_US http://www.usenix.org/event/hotos09/tech/full_papers/boyd-wickizer/boyd-wickizer.pdf Proceedings of the 12th Workshop on Hot Topics in Operating Systems, HotOS XII Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf IEEE Computer Society Press MIT web domain
spellingShingle Boyd-Wickizer, Silas
Morris, Robert Tappan
Kaashoek, M. Frans
Reinventing Scheduling for Multicore Systems
title Reinventing Scheduling for Multicore Systems
title_full Reinventing Scheduling for Multicore Systems
title_fullStr Reinventing Scheduling for Multicore Systems
title_full_unstemmed Reinventing Scheduling for Multicore Systems
title_short Reinventing Scheduling for Multicore Systems
title_sort reinventing scheduling for multicore systems
url http://hdl.handle.net/1721.1/65870
https://orcid.org/0000-0001-7098-586X
https://orcid.org/0000-0003-2700-9286
work_keys_str_mv AT boydwickizersilas reinventingschedulingformulticoresystems
AT morrisroberttappan reinventingschedulingformulticoresystems
AT kaashoekmfrans reinventingschedulingformulticoresystems