Task allocation method based on heterogeneous multi-cores

A task allocation, heterogeneous multi-core technology, applied in resource allocation, multi-program device, program control design, etc., can solve problems such as different structures, complex task allocation and execution sequence, and failure to achieve the highest processor efficiency.

Pending Publication Date: 2020-05-22
WUHAN UNIV OF SCI & TECH
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Each processor of a heterogeneous multi-core processor has a different structure, and different processors have different functions and scopes of application. Therefore, this processor is better at dealing with complex situations that require running multiple different programs.
But in this way, the task assignment and execution sequence of heterogeneous multi-core will be more complicated when actually executing tasks. Each application needs to find its corresponding optimal processor, and the difference in task volume will lead to the difference in the completion time of a single task.
[0005] The existing static heuristic scheduling algorithm has the problem of low processor utilization. The static heuristic algorithm has a lot of idle time when scheduling and assigning tasks to heterogeneous multi-core processors. Because the algorithm cannot properly allocate tasks to the corresponding The processor causes many processors to be idle after completing tasks, and the maximum efficiency of the processor is not achieved

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Task allocation method based on heterogeneous multi-cores
  • Task allocation method based on heterogeneous multi-cores
  • Task allocation method based on heterogeneous multi-cores

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0052] In order to facilitate those skilled in the art to better understand the present invention, the present invention will be further described in detail through specific examples below, which are only exemplary and do not limit the protection scope of the present invention.

[0053] A method for allocating tasks based on heterogeneous multi-core described in this embodiment includes the following steps:

[0054] Step S1, build task priority list:

[0055] Compared with the traditional static heuristic scheduling algorithm, this embodiment constructs the task list while scheduling task allocation, specifically as follows:

[0056] At the beginning of task scheduling, the entry node is assigned to the processor core with the shortest completion time, and then multiple new free nodes appear, and the respective priorities of the free nodes are calculated by formula (1), and tasks are constructed with the calculated priorities priority list;

[0057]

[0058] Among them, V...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a task allocation method based on heterogeneous multi-cores. The task allocation method comprises the following steps: S1, construction of a task priority list: constructing the task list while scheduling task allocation; and S2, multi-strategy task allocation: inserting a task into a standby communication interval or directly copying a precursor of the task into a processor idle interval, allocating the task and a precursor node with the longest communication time to the same processor core, allocating a subsequent node with the longest task and the longest communication time to the same processor core, and selecting an optimal allocation scheme from the three. According to the invention, the allocation scheme with the shortest standby time of all processor cores can be effectively selected, the total execution time is reduced, and the high efficiency is ensured; the utilization rate of each processor core of a heterogeneous multi-core processor is improved, and as the communication time of high-priority tasks in the task execution process is shortened, energy originally consumed on the tasks is saved, and the heterogeneous multi-core processor has the energy-saving property.

Description

technical field [0001] The invention relates to the technical field of embedded scheduling of heterogeneous multi-cores, in particular to a task allocation method based on heterogeneous multi-cores. Background technique [0002] With the rapid development of computer technology in the 21st century, mankind has officially entered the information age. Computer technology has become more and more widely used in all walks of life, especially the rapid development of artificial intelligence technology in recent years. The development of artificial intelligence and machine learning technology has higher and higher requirements for computer hardware, especially the performance of computer CPU is particularly important. [0003] Since the structural design of each core of the homogeneous multi-core processor is the same, and there is no distinction in function and priority, it is impossible to increase efficiency by allocating program tasks on processor cores. Different application...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F9/50
CPCG06F9/5038G06F2209/5021Y02D10/00
Inventor 胡威甘雨吴晶李奕凝刘天怡焦强李名奇董勇郭宏吕向宇
Owner WUHAN UNIV OF SCI & TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products