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

Tasks priority dynamic dispatching algorithm

A dynamic scheduling algorithm and task priority technology, applied in the direction of multi-programming devices, etc., can solve the problem of tasks exceeding the deadline, and achieve the effect of increasing the success rate of scheduling, reducing the average delay, and improving fairness.

Inactive Publication Date: 2011-04-20
HUAZHONG UNIV OF SCI & TECH
View PDF0 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] If a real-time task exceeds its own execution time (overrun) and the work is not over, it will continue to execute with the current high priority, which will delay the tasks that have been scheduled later, forming a "domino" effect, resulting in multiple tasks exceeded deadline

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
  • Tasks priority dynamic dispatching algorithm
  • Tasks priority dynamic dispatching algorithm
  • Tasks priority dynamic dispatching algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040] Specific embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings.

[0041] In a specific implementation manner, the pseudocode of the data structure of the utilized task is:

[0042] Struct task{

[0043] Unsigned long p;

[0044]Unsigned long e;

[0045] Unsigned long d;

[0046] Unsigned long deadline;

[0047] Unsigned long resume_time;

[0048] Long state;

[0049] / *other attributes* /

[0050]};

[0051] There are some internal variables of the above structure in the attributes of the task task. In the above, the state variable state of the task has two attributes: one is active and the other is inactive.

[0052] A task priority dynamic scheduling algorithm, comprising the following steps:

[0053] (1) According to whether the scheduled task is completed within this period, mark the state of the task as active and inactive respectively, and calculate resume_time as the next release...

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 relates to the technical field of task scheduling in real-time systems, and particularly to a dynamic priority-based task scheduling algorithm, which is provided to overcome the problem of sharp increase of deadline miss ratio known in dynamic priority algorithms under the circumstances of system overload, thereby reducing average task delay, increasing success ratio in scheduling, as well as improving fairness among tasks and further eliminating the chance of overhigh deadline miss ratio with respect to tasks with long execution time (E).

Description

technical field [0001] The invention relates to the technical field of task scheduling in real-time systems, in particular to a task priority dynamic scheduling algorithm. Background technique [0002] The research on real-time scheduling algorithm is an important research topic in the real-time field. The priority-driven method is the most commonly used method for real-time system scheduling. The implementation method is to give each task a priority, and select the task with the highest priority to run at each scheduling opportunity. Priority-based scheduling can be divided into two categories: static and dynamic priority scheduling. In static priority scheduling, the initial value of the priority is determined by the specific information of the task, and it remains unchanged during the running process; in the dynamic priority scheduling algorithm, the scheduling priority of the task changes as the tasks in the task run. Changes, the task priority is not only related to t...

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/46
Inventor 余鑫程飞
Owner HUAZHONG UNIV OF SCI & TECH
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

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

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