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

Method for solving separable task multi-time scheduling model in distributed-type system

A distributed system and scheduling model technology, applied in the information field, can solve the problems that the algorithm is difficult to converge to the global optimal solution, the complexity increases, and the task completion time does not reach the global optimal solution, etc.

Active Publication Date: 2015-11-25
XIDIAN UNIV
View PDF6 Cites 10 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

And as the number of processors increases, the complexity of the algorithm increases exponentially
When the number of processors is large, it is difficult for the algorithm to converge to the global optimal solution
[0004] To sum up, the existing multi-pass scheduling algorithm for divisible tasks has not found the optimal processor scheduling order, the optimal number of scheduling times, and the optimal number of processors participating in the calculation, resulting in the task completion time not reaching the global minimum. Excellent solution

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
  • Method for solving separable task multi-time scheduling model in distributed-type system
  • Method for solving separable task multi-time scheduling model in distributed-type system
  • Method for solving separable task multi-time scheduling model in distributed-type system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0092] In accordance with the above technical solution, a method of solving the multi-pass scheduling model of divided tasks in a distributed system in this embodiment, see figure 2 , including the following steps:

[0093] Step 1, build task allocation scheme A=(a ij ) n×m About Processor Scheduling Order The function expression of the scheduling number m and the number n of slave processors participating in the calculation.

[0094] see figure 1 , N+1 processors are connected to each other in a star topology network, where P 0 main processor, {P i |i∈{1,2,...,N}} is the slave processor. see image 3 , (σ 1 ,σ 2 ,...,σ N ) is the arrangement of 1,2,...N, is the scheduling sequence of processors; α ij main processor P 0 The jth schedule is assigned to the slave processor The task size of , where i=1,2,...,n, j=1,2,...,m. slave processor The computational startup overhead of slave processor The time required for calculating the unit task, the size 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 discloses a method for solving separable task multi-time scheduling model in a distributed-type system. By establishing a new separable task multi-time scheduling model and utilizing genetic algorithm to solve the model, the shortest completion time of a task is acquired. A function expression of a task allocation scheme in regard to scheduling sequence of processors, scheduling times and number of the processors that participates in calculation is derived and further a separable task multi-time scheduling model with the shortest completion time the task as a goal is established. According to the invention, the genetic algorithm for solving the model provided by the invention can solve the best scheduling sequence of the processors, the scheduling times and the number of the processor that participates in the calculation, thus the best task allocation scheme and the shortest completion time of the task can be acquired.

Description

technical field [0001] The invention belongs to the related field of information technology, and relates to a method for solving a multi-pass scheduling model of subdivided tasks under a distributed system. Background technique [0002] Existing separable task scheduling models fall into two categories: single-trip scheduling and multi-trip scheduling. For single-pass scheduling, the master processor divides the task into subtasks with the same number as the slave processors, the master processor transmits tasks to the slave processors in turn, and each processor only receives and calculates the task once. Due to the long idle waiting time of processors assigned tasks, single-pass scheduling is not suitable for large-scale data application problems. For multi-pass scheduling, the task is divided into subtasks larger than the number of processors, and the master processor sends them to each slave processor one by one in multiple passes to complete the calculation. Compared ...

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
Inventor 王晓丽王宇平卫珍宋雨筱
Owner XIDIAN UNIV
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