Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler

ASAP 2011
Pages: 223 - 226
Published: Sep 11, 2011
Abstract
This paper presents an extension of the Completely Fair Scheduler (CFS) to support cooperative multitasking with time-sharing for heterogeneous processing elements in Linux. We extend the kernel to be aware of accelerators, hold different run queues for these components and perform scheduling decisions using application provided meta information and a fairness measure. Our additional programming model allows the integration of checkpoints into...
Paper Details
Title
Cooperative multitasking for heterogeneous accelerators in the Linux Completely Fair Scheduler
Published Date
Sep 11, 2011
Journal
Pages
223 - 226
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.