Heterogeneous Multiprocessor Matching Degree Scheduling Algorithm Based on OpenCL Framework

Abstract

In a heterogeneous multi-core system, the merits of the task scheduling algorithm have a great impact on the efficiency of the system. This paper implements a matching degree scheduling algorithm based on heterogeneous multiprocessor. Before the actual scheduling, the static task feature value and the processor core configuration feature value are mapped into the same European space, and the “program-core-distance” matching value is calculated by using the WED. In the actual scheduling, the matching value and the size of the input byte are obtained, and the tasks are matched with the processor under the influence of the two to determine the execution order of the tasks on each processor. The scheduling method based on OpenCL framework is compared with the traditional scheduling algorithm. It shows that the scheduling scheme implemented in this paper has significantly improved efficiency when executing tasks.