Heuristic type coarse grain parallel grid task scheduling method

A task scheduling, coarse-grained technology, applied in the direction of resource allocation, multi-programming devices, etc., can solve problems such as slow convergence speed, poor universality, and poor universality of deterministic algorithms, and achieve high feasibility, The effect of good scalability

Inactive Publication Date: 2012-09-12
NANJING UNIV OF INFORMATION SCI & TECH
View PDF1 Cites 28 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Compared with the random algorithm, the deterministic algorithm has fast search speed and high accuracy, but its universality is not strong, and it is easy to fall into the local minimum point; the random algorithm has the advantages of global search and wide adaptability, but lacks effective

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
  • Heuristic type coarse grain parallel grid task scheduling method
  • Heuristic type coarse grain parallel grid task scheduling method
  • Heuristic type coarse grain parallel grid task scheduling method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038] The preferred embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings, so that the advantages and features of the present invention can be more easily understood by those skilled in the art, so as to define the protection scope of the present invention more clearly.

[0039] see figure 2 , the embodiment of the present invention includes:

[0040]A heuristic coarse-grained parallel grid task scheduling method proposed by the heuristic coarse-grained parallel algorithm to dynamically determine whether the population migrates or not includes the following steps, and the process is as follows:

[0041] Step 1: The task submitter enters the set of tasks to be scheduled, the set of available computing resources, the execution time of the task on the computing resources, the maximum number of iterations and the threshold δ;

[0042] Step 2: The task scheduler assigns the task to the resource execution scheduling p...

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 heuristic type coarse grain parallel grid task scheduling method which is characterized by comprising the following steps: firstly, a task submitter inputs a to-be-schemed task set, a usable computing resource set, an execution time set of tasks on the computing resource, a maximum number of iteration times, a threshold value delta and an entropy value epsilon; secondly, a task scheduler represents a scheduling problem of allocating resources to execute the tasks to be a standard minimum solving problem under task optimization and constraint conditions; thirdly, a grid task scheduling problem is solved by an iterative process of the heuristic type coarse grain parallel algorithm; and fourthly, after the algorithm is finished, the task scheduling result is output. In the way, the invention provides a new multipoint crossing method and the increasing property of a population optimal solution is maintained by an elitist strategy; during a variation stage, a directed variation method based on task immigration is adopted to prevent degeneration of the population; and the method is high in performance and better than the traditional random algorithm in computing power and convergence rate.

Description

technical field [0001] The invention relates to the field of grid computing, in particular to a heuristic coarse-grained parallel grid task scheduling method. Background technique [0002] With the development of network technology, people's work needs more and more complex and diverse resources. How to make full use of resources is a problem that needs to be studied urgently. Grid is a technology that makes full use of resources. [0003] Grid is a new type of network computing platform that emerged after the World Wide Web, and it provides users with a comprehensive infrastructure for sharing various resources including web pages. Computing grid is currently the most researched and practical grid. It is mainly aimed at cutting-edge scientific research and large-scale industry applications, and can integrate and share geographically distributed computing resources. As a technology designed for cutting-edge scientific research and large-scale applications, computing grid ca...

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/46G06F9/50
Inventor 薛胜军刘芳芳
Owner NANJING UNIV OF INFORMATION 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
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