Check patentability & draft patents in minutes with Patsnap Eureka AI!

Associated task scheduling method based on longest path priority

A technology of longest path and task scheduling, applied in multi-program device, program startup/switching, resource allocation, etc., which can solve problems such as unbalanced processor load, high complexity of scheduling algorithm, and low utilization rate of a single processor , to achieve the effect of resource saving, high utilization rate and simple calculation

Active Publication Date: 2019-05-31
GUILIN UNIV OF ELECTRONIC TECH
View PDF3 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] What the present invention aims to solve is that the scheduling algorithm of the existing associated tasks has a large complexity, which is likely to cause problems such as unbalanced load among processors and low utilization rate of a single processor, and provides a method for scheduling associated tasks based on the longest path first

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
  • Associated task scheduling method based on longest path priority
  • Associated task scheduling method based on longest path priority
  • Associated task scheduling method based on longest path priority

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in combination with specific examples and with reference to the accompanying drawings.

[0023] Relevance Tasks are related in terms of data, that is, the execution of a task depends on the relevant data of its predecessor computing task, and the task can only be executed after the predecessor computing task is executed and the relevant data is transmitted. Based on the description of the task scene, use a directed acyclic graph (DAG graph) to describe the associated task, such as figure 1 As shown, the entire task graph G={V,E}, V represents a set of nodes, and each node represents a computational task, denoted as Ti , represents the i-th computing task; E represents the set of edges, and each edge represents a communication task, denoted as CT i k , representing a computational task T i and its predecessor c...

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 relevance task scheduling method based on longest path priority. When the to-be-scheduled task is distributed to the processor, the earliest time that the processor can execute the task and the influence of the relevance between the to-be-scheduled task and the task stored in the processor on real-time execution of the task are considered, and an optimization function oftask distribution is provided. The method is simple in calculation, and the defect that common polling is difficult to realize load balancing due to factors with uneven task sizes is avoided. The method has certain real-time performance and load balance, the utilization rate of the processor in the task execution period time is high, and the purpose of saving resources is achieved.

Description

technical field [0001] The invention relates to the technical field of task scheduling, in particular to a method for scheduling associated tasks based on the longest path first. Background technique [0002] In a multiprocessor, the execution time of a data-associated task is mainly affected by two factors: the computation time of the task and the communication time between processors. There is a clear difference between intra-core communication overhead and inter-core communication overhead in multiprocessors. When the associated tasks are executed in the same processor, their relevant information is stored in the same local cache, and most of the communication tasks only need to be performed through the cache in the core, so the time for data exchange between tasks is very short, almost negligible ; When related tasks are executed on different processors, inter-core communication tasks need to use the inter-core cache. Due to the use of inter-core communication intermedi...

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/48G06F9/50
Inventor 张向利梁秋玲
Owner GUILIN UNIV OF ELECTRONIC TECH
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com