Heterogeneous multi-core thread scheduling method, heterogeneous multi-core thread scheduling system and heterogeneous multi-core processor

Abstract

The invention relates to a heterogeneous multi-core thread scheduling method. The heterogeneous multi-core thread scheduling method includes: respectively generating a ranking list for threads and cores according to dynamic characteristics of a program, finding out optimal stable match of the threads and the cores according to the ranking lists, and performing thread scheduling according to stable match. The heterogeneous multi-core thread scheduling method specifically includes: receiving characteristic vectors of the threads running in the cores, and selecting priority ranking of the cores for the threads according to the characteristic vectors; ranking each thread for each core; receiving the ranking lists of the threads and the cores, and finding out stable match results of the threads and the cores; and receiving the stable match results, scheduling by an operating system and allocating each thread to the corresponding core for running. Huge expenditure caused by sampling scheduling is avoided, the heterogeneous multi-core thread scheduling method takes more complex factors influencing performances and power consumption into consideration, and only relative relations rather than specific values need to be predicated, so that model complexity is lowered while scheduling precision is also improved.

Description

technical field [0001] The present invention relates to the field of a thread scheduling method (threads scheduling policy) under the condition that the number of threads and cores in Single-ISA heterogeneous multi-core processors (Single-ISA heterogeneous multi-core processors) is equal, and in particular relates to a method based on threads and After checking each other and sorting the selection priorities, the Gale-Shapley algorithm is used to complete the realization of the thread scheduling method. Background technique [0002] With the development of integrated circuit technology, more and more cores are integrated into the same system-on-chip, and chip multi-processors (CMP) gradually become a mainstream processor architecture. On-chip multi-core processors provide better performance for programs running in parallel in the system by integrating multiple identical general-purpose cores on the chip, but they are also limited by power consumption, heat dissipation, and c...

AI Technical Summary

Problems solved by technology

[0015] In order to solve the above-mentioned technical problems, the object of the present invention is to propose a thread scheduling method and a scheduling system for heterogeneous multi-core processors based on the Gale-Shapley algorithm. For the thread scheduling problem in heterogeneous multi-core processors, the present invention can Dynamic scheduling of changes in characteristics effectively avoids the huge overhead brought by the sampling-based scheduling method, and the heuristic scheduling method is difficult to accurately predict the performance of the flaws that lead to unsatisfactory scheduling, and both threads and cores are used as decision-making participants. In the process of scheduling, the needs of threads and cores can be considered at the same time

Images