Task-Aware Priority Scheduling for Multicore Processors

DOI

10.2991/ceis-16.2016.21How to use a DOI?

Keywords

Task Scheduling; Multicore Processors

Abstract

Task scheduling is a key issue in multicore processors, especially for the multicore processor in parallel framework. However, few state-of-art task scheduling strategies solve these important issues simultaneously: assignment of task to CPU core, task types, task order and resource conflict of task. To the best of our knowledge, the schedule problem is more complicated in the node of parallel framework. To settle this problem, we propose a method of task-aware priority scheduling for multicore processors. First, we introduce our scheduling framework, including four modules: Kernel Scheduler, Resource Management, Synchronization, Node Coordinator. Then follow two key algorithms: Task-to-core assignment algorithm and Resource distribution algorithm. Finally, we show that our method obtains good performance in contrast with Work-stealing algorithm.

Copyright

© 2017, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Qiu-Wei Shi
PY  - 2016/11
DA  - 2016/11
TI  - Task-Aware Priority Scheduling for Multicore Processors
BT  - Proceedings of the 2016 International Conference on Computer Engineering and Information Systems
PB  - Atlantis Press
SP  - 106
EP  - 110
SN  - 2352-538X
UR  - https://doi.org/10.2991/ceis-16.2016.21
DO  - 10.2991/ceis-16.2016.21
ID  - Shi2016/11
ER  -