Survey of scheduling techniques for addressing shared resources in multicore processors

  • Authors:
  • Sergey Zhuravlev;Juan Carlos Saez;Sergey Blagodurov;Alexandra Fedorova;Manuel Prieto

  • Affiliations:
  • Simon Fraser University, Canada;Complutense University of Madrid, Madrid, Spain;Simon Fraser University, Canada;Simon Fraser University, Canada;Complutense University of Madrid, Madrid, Spain

  • Venue:
  • ACM Computing Surveys (CSUR)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Chip multicore processors (CMPs) have emerged as the dominant architecture choice for modern computing platforms and will most likely continue to be dominant well into the foreseeable future. As with any system, CMPs offer a unique set of challenges. Chief among them is the shared resource contention that results because CMP cores are not independent processors but rather share common resources among cores such as the last level cache (LLC). Shared resource contention can lead to severe and unpredictable performance impact on the threads running on the CMP. Conversely, CMPs offer tremendous opportunities for mulithreaded applications, which can take advantage of simultaneous thread execution as well as fast inter thread data sharing. Many solutions have been proposed to deal with the negative aspects of CMPs and take advantage of the positive. This survey focuses on the subset of these solutions that exclusively make use of OS thread-level scheduling to achieve their goals. These solutions are particularly attractive as they require no changes to hardware and minimal or no changes to the OS. The OS scheduler has expanded well beyond its original role of time-multiplexing threads on a single core into a complex and effective resource manager. This article surveys a multitude of new and exciting work that explores the diverse new roles the OS scheduler can successfully take on.