Workflow task scheduling method under distributed environment

A technology of task scheduling and workflow, which is applied in the direction of program startup/switching, program control design, instruments, etc., can solve the problems of low efficiency of workflow task scheduling, high communication cost of workflow tasks, and long execution completion time, etc., to meet the requirements of Efficient task processing, reduced communication costs, execution completion time, and good scalability

Active Publication Date: 2016-11-23
UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF6 Cites 29 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, none of the above algorithms considers the impact of the data dependencies between workflow tasks on the task scheduling effe...

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
  • Workflow task scheduling method under distributed environment
  • Workflow task scheduling method under distributed environment
  • Workflow task scheduling method under distributed environment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0062] combine image 3 The directed acyclic graph of the workflow task in the medium illustrates this embodiment:

[0063] Step 1: Use a directed acyclic graph to describe the workflow tasks that need to be scheduled, and obtain a directed acyclic graph of workflow tasks, such as image 3 As shown; using directed acyclic graph to describe the computing resources in the distributed computing environment, the computing resource directed acyclic graph is obtained; the total number of nodes in the workflow task directed acyclic graph is 5, and the i-th Node weight w i Indicates the amount of task calculation data, i∈[1,2,…,5]; the total number of edges in the directed acyclic graph of workflow tasks is 4, and the weight v of the mth edge m Indicates the amount of data transmission between tasks, m∈[1,2,3,4]; the total number of nodes in the directed acyclic graph of computing resources is J, where the weight of the jth node w j Indicates the resource computing capability, j∈[1...

Embodiment 2

[0075] combine Figure 7 The directed acyclic graph of medium IO-intensive workflow tasks illustrates this embodiment:

[0076] Step 1: Use a directed acyclic graph to describe the workflow tasks that need to be scheduled, and obtain a directed acyclic graph of workflow tasks, such as Figure 7 As shown; using directed acyclic graph to describe the computing resources in the distributed computing environment, the computing resource directed acyclic graph is obtained; the total number of nodes in the workflow task directed acyclic graph is 5, and the i-th Node weight w i Indicates the amount of task calculation data, i∈[1,2,…,5]; the total number of edges in the directed acyclic graph of workflow tasks is 4, and the weight v of the mth edge m Indicates the amount of data transmission between tasks, m∈[1,2,3,4]; the total number of nodes in the directed acyclic graph of computing resources is J, where the weight of the jth node w j Indicates the resource computing capability,...

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 workflow task scheduling method under the distributed computing environment. A directed acyclic graph is used for describing workflow tasks and resources, the average task execution time and the average task transmission time are calculated on the basis of node weight information and edge weight information so as to judge the type of a workflow task and perform classified model processing, the task with the data dependency is cut into a plurality of independent task sets, each task set contains one or more tasks, the multiple tasks in each task set have the data dependency, and therefore the workflow tasks are converted into independent tasks. The task sets gather the tasks with the large data size or the large data transmission quantity together, meanwhile, the number of tasks needing to be independently distributed is decreased, and the post-task scheduling performance is improved on the whole. In addition, when the number of workflow tasks is increased, the gathering operation of the tasks just needs to be enhanced, all tasks do not need to be processed any more, and the better expansibility is achieved.

Description

technical field [0001] The invention belongs to workflow task scheduling technology and workflow task modeling technology under distributed computing, in particular to a workflow task scheduling method under distributed computing environment. Background technique [0002] Task scheduling is the most important part in a distributed computing environment, and it also plays an irreplaceable role in the entire distributed infrastructure. Task scheduling in a distributed computing environment requires finding the best solution for task resource allocation in consideration of time, cost, reliability, availability, throughput, and resource utilization. [0003] Task scheduling in a distributed computing environment is mainly divided into independent task scheduling and workflow task scheduling. A workflow task contains several tasks, and these several tasks have data dependencies. Existing methods aim to reduce the cost of task execution when scheduling workflow tasks. For exampl...

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/4806
Inventor 段贵多刘贵松罗光春秦科
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap