Task-Aware Priority Scheduling for Multicore Processors

Abstract

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.