Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A task scheduling method based on block mosaic

A task scheduling and block technology, applied in multi-programming devices, program control design, instruments, etc., can solve the problems of not making full use of multi-core platforms, taking a long time, and scheduling too long, so as to reduce the total task scheduling length, The effect of reducing the amount of information interaction and reducing the amount of information interaction

Active Publication Date: 2020-05-12
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] However, for example, the task graph formed by the PDSCH signal processing flow in LTE has the characteristics of high parallelism, high real-time requirements, and highly symmetrical critical paths. If random search algorithms (ant colony algorithm, particle swarm algorithm, Genetic algorithm) for task scheduling takes too long. If task scheduling based on task replication algorithm is used, the complexity of the algorithm is too high. If table scheduling algorithm is used, the table scheduling algorithm cannot make good use of the good properties of the task graph itself. (High parallelism), and cannot make full use of the multi-core platform when faced with a large number of tasks, there are problems such as too long scheduling time or excessive inter-core communication

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
  • A task scheduling method based on block mosaic
  • A task scheduling method based on block mosaic
  • A task scheduling method based on block mosaic

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0027] The present invention will be further described in detail below in conjunction with test examples and specific embodiments. However, it should not be understood that the scope of the above subject matter of the present invention is limited to the following embodiments, and all technologies realized based on the content of the present invention belong to the scope of the present invention.

[0028] combine figure 1 The flowchart of the shown method of the present invention; The task scheduling method of the present invention based on block mosaic, it comprises the following steps,

[0029] Step 1: Obtain the task graph to be processed, and divide the task graph into several sub-task graphs by using a clustering algorithm.

[0030] Specifically, if the number of nodes in the divided subtask graph exceeds 4, continue to use the clustering algorithm to divide the subtask graph with more than 4 nodes until the number of nodes in all subtask graphs does not exceed 4.

[003...

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 scheduling method based on block splicing. The method includes the steps: dividing a task graph into sub-task graphs with nodes not exceeding four nodes; describing each sub-task graph by the aid of quadruple (N, H, W and M) parameterization; analyzing a quadruple (N, H, W and M) corresponding to each sub-task graph; taking minimum information interaction quantity among processors and shortest task scheduling length of the sub-task graph as targets to generate corresponding block groups; taking parallel node number not exceeding total number of the processor as conditions, and integrally splicing block groups corresponding to the all sub-task graphs to obtain all probable splicing schemes; evaluating the splicing schemes by the aid of evaluation functions, and determining a final task scheduling scheme according to the splicing schemes with a highest evaluated value. According to the method, information interaction quantity generated among the processors and total task scheduling length can be effectively decreased in the task scheduling process, and the task processing efficiency of the processors is improved.

Description

technical field [0001] The invention relates to the technical field of task scheduling, in particular to a task scheduling method based on block splicing. Background technique [0002] The goal of task scheduling is to allocate tasks to appropriate processors and determine the execution order of tasks on the processors, which can not only satisfy the dependencies between tasks, but also minimize the execution time of all tasks. Optimal task scheduling in general task graphs is an NP-complete problem. Therefore, an effective scheduling algorithm is very important for distributed computing to obtain a good speedup. [0003] However, for example, the task graph formed by the PDSCH signal processing flow in LTE has the characteristics of high parallelism, high real-time requirements, and highly symmetrical critical paths. If random search algorithms (ant colony algorithm, particle swarm algorithm, Genetic algorithm) for task scheduling takes too long. If task scheduling based ...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06F9/50
CPCG06F9/505
Inventor 陈笑周翎宇高溦陈亦欧凌翔
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products