Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Uncertain time point task dynamic dispatching method based on information physical system

A cyber-physical system and dynamic scheduling technology, applied in the field of dynamic scheduling, can solve problems such as uncertain task time points

Inactive Publication Date: 2018-02-23
KUNMING UNIV OF SCI & TECH
View PDF3 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0003] The invention relates to a dynamic scheduling method for tasks with uncertain time points based on a cyber-physical system, which is used to solve the problem of uncertain task time points in a cyber-physical system, calculate task priorities in real time during execution, and dynamically schedule tasks in real time question

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
  • Uncertain time point task dynamic dispatching method based on information physical system
  • Uncertain time point task dynamic dispatching method based on information physical system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0011] Embodiment 1: as figure 1 As shown, a dynamic scheduling method for tasks with uncertain time points based on cyber-physical systems. The specific arrival time point of a task is uncertain, but an expected arrival time period can be known. List all the orders, and simplify the calculation of the execution probability of each order through the pruning technology, compare the probability, and execute the task with the highest probability first, and use it as the initial task sequence;

[0012] Calculate the remaining value density of the task based on the value of the task and the remaining execution time, which can reasonably protect the execution task from being preempted by other tasks, and also give other high-urgency tasks the opportunity to execute;

[0013] The urgency of the task is calculated according to the deadline of the task and the free execution time, which can improve the execution chance of the time-critical task;

[0014] Considering the residual value...

Embodiment 2

[0015] Embodiment 2: The specific steps of this method are as follows: first determine that the task format is (Source, Type, Ti, UI: [lower, upper], (p: UI—[0,1]), Pi, Di, Ci, bi, ei, di, vi). Among them, Source indicates the source of the task; Type indicates the type of task reading and writing; Ti indicates the name of the task; UI:[lower,upper] is a collection of time points, indicating the time when the task may occur, where lower indicates the earliest occurrence time, and upper indicates the latest Occurrence time; (p: UI—[0,1]) is a collection of probabilities, representing the probability that the task may be triggered at each time point; Pi represents the execution cycle of Ti; Di represents the relative deadline of Ti; Ci represents the probability of Ti The theoretical execution time of Ti; bi indicates the time when Ti is released and ready to execute; ei indicates the completion time of Ti execution; di indicates the absolute deadline of Ti; Vi indicates the exp...

Embodiment 3

[0020] Embodiment 3: as figure 2 Shown is the time period of task A, task B, and task C and their execution probabilities.

[0021] These three tasks are examples for the printer task. The urgency of the printer task has a greater impact on the execution of the algorithm. When the algorithm is executed, the value of the factor with a greater impact can be set to have a greater impact on the relative residual value density. .

[0022] Step1: Determine the time points of tasks A, B, and C; by figure 2 It can be seen that tasks A, B, and C must be completed between time points 2 and 8, and for a certain time point, the probability that task A is executed before time point 4 is Pa1+Pa2+Pa3;

[0023] Step2: Calculate the remaining value density of the task according to the value of the task and the remaining execution time;

[0024] Step3: Calculate the urgency of task execution according to the task deadline and free time;

[0025] Step4: In this example, the proportion of t...

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 an uncertain time point task dynamic dispatching method based on an information physical system, and belongs to the field of dynamic dispatching. The method includes the stepsof firstly, listing all occurrence sequences of tasks within a certain time period, simplifying and calculating the execution probability of each sequence through a pruning technique, comparing the value of each probability, executing the tasks with high probabilities at first, and adopting the execution sequence as the initial task sequence; according to the value and remaining execution time ofeach task, calculating the remaining value density of each task; according to the expiry time and remaining execution time of each task, calculating the emergency degree of each task; comprehensivelytaking the remaining value density and execution emergency degree of each task into account to determine the dispatching priority of all the tasks, and conducting dispatching on the tasks with determined time points on the basis of dynamic priority. The uncertain time point task dynamic dispatching method can determine the time points of the uncertain time point tasks, calculate the priority during dispatching in real time and dynamically dispatch the tasks for execution, and can be much closer to the dispatching situation of actual problems.

Description

technical field [0001] The invention relates to a method for dynamic scheduling of tasks with uncertain time points based on a cyber-physical system, and belongs to the field of dynamic scheduling. Background technique [0002] As a unity of computing process and physical process, cyber-physical system is a next-generation intelligent system integrating computing, communication and control, and has broad application prospects. In practical applications, the time point of the task will be uncertain due to missing reading of data, mismatch of time granularity of tasks between monitoring systems, and time asynchronous problems of tasks from distributed systems. At the same time, in a specific real-time application system, the value of time-critical tasks is not necessarily high, and the execution time of high-value tasks is not necessarily urgent. In order to balance fairness and efficiency, the dynamic value density and execution urgency of tasks should be considered comprehen...

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/48
CPCG06F9/4881
Inventor 张晶熊梅惠周晴晴范洪博
Owner KUNMING 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
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