Single-task and multi-core scheduling method based on critical path and task duplication

Abstract

The invention discloses a single-task and multi-core scheduling method based on critical path and task duplication. A conventional multi-core task scheduling algorithm cannot perform effective scheduling when inner cores of a processor are insufficient. The method comprises the following steps that a directed acyclic graph (DAG) task graph processing module duplicates a fork node in a DAG task graph to a subsequent task node by using a task duplication method, forms a join structure graph, and further converts the join graph into a product processing tree; a task node scheduling allocation module introduces a key path idea in integrated scheduling, searches a key path of the product processing tree, and schedules nodes in the key path preferentially to start executing the nodes in the key path in advance to the greatest extent; and a scheduling sequence adjustment optimization module combines scheduling sequences in a mode of combining the scheduling sequences with the maximum similarity, so as to make the quantity of the scheduling sequences not greater than that of the inner cores of the processor, so the inner cores of the processor can fully process in parallel. The method is applicable to single-task and multi-core scheduling based on homogeneous multi-core processors which are interconnected on chip.

Description

Technical field: [0001] The invention relates to a single-task multi-core scheduling method based on critical path and task duplication. Background technique: [0002] Multi-core processors are the main trend of processor development today and in the future, and the number of cores integrated in a single processor has grown from two to four, eight or even more. The multi-core processors used on microcomputers all use an on-chip multi-core processor architecture, and an on-chip multi-core processor (Chip Multi-Processor, CMP) integrates multiple processor cores into one processor chip, thereby improving computing power. CMP can be divided into homogeneous multi-core and heterogeneous multi-core according to whether the computing cores are equivalent or not. Now the multi-core processors mainly promoted by Inter and AMD are homogeneous multi-core processors. [0003] An efficient communication mechanism is an important guarantee for the high performance of a CMP processor. Cu...

AI Technical Summary

Problems solved by technology

Since the weighted directed acyclic graph (Directed Acyclic Graph, DAG) is converted into a task graph containing only join nodes by means of task duplication, the join task graph and the tree structure process graph can be converted to each other; and because the product processing tree Using the critical path scheduling method can shorten the product completion time by prioritizing the processes on the critical path, but the previous algorithms did not consider that the task graph can be converted into the corresponding product processing tree form, and by prioritizing the scheduling of the task nodes on the critical path The method shortens the total task execution time, so there will be a delay in the task completion time. At the same time, because the scheduling sequence cannot be adjusted according to the number of processor cores, effective scheduling cannot be performed when the processor cores are insufficient.

Images