Method for allocating graticule resource based on paralleling genetic algorithm

A technology of grid resource and allocation method, which is applied in the field of grid resource allocation based on parallel genetic algorithm, can solve problems such as insufficient resource allocation speed, and achieve the effect of improving quality and speed and improving service quality.

Inactive Publication Date: 2008-12-17
WUHAN UNIV OF TECH
View PDF0 Cites 22 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Genetic algorithms have been applied to task matching and scheduling in heterogeneous computing

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 allocating graticule resource based on paralleling genetic algorithm
  • Method for allocating graticule resource based on paralleling genetic algorithm
  • Method for allocating graticule resource based on paralleling genetic algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0025] The present invention will be described in further detail below in conjunction with the accompanying drawings.

[0026] Before describing the technical scheme of the present invention, some problems in the present invention are defined as follows:

[0027] The resource allocation discussed in the ad hoc grid is static, that is, the information of resources and tasks in the grid is known in advance, and the application submitted to the grid has been decomposed into multiple tasks. That is, each application process is composed of a group of subtasks that communicate with each other, and the subtasks use an S-dimensional vector T s ={t 1 , t 2 ,...,t s} indicates that there is a data dependency between these subtasks. These data dependencies can be represented by a directed acyclic graph DAG. Here we study how to map large application tasks composed of subtasks that communicate freely with each other to each machine in the ad hoc network. The goal of this mapping is ...

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 a grid resource allocation method based on a parallel genetic algorithm. The method comprises the following steps: firstly, the information is initialized in a main thread, such as task collection, machine collection, an execution time matrix E of the task, and mapping of a sub-task to the machine, etc.; then a plurality of sub threads are generated and mapped to different processors, an initializing sub-population is independently generated by each sub thread, evolutionary computation is performed in parallel, the optimum individual of each generation is transferred to the main thread, the main thread performs comparison, and the optimum individual is retained; when the predetermined generation arrives, the transfer operation between the sub-groups is performed; and the operation of the main thread and all the sub-groups cannot be finished until the termination conditions are met. The genetic algorithm is taken as the most effective heuristic global stochastic searching method, and the solution of the NP problem can be performed. The quality and the speed for the algorithm for solving are improved by the parallel genetic algorithm proposed according to the natural parallelism of the genetic algorithm, and the method is an effective grid energy resource optimization method and favorable for improving the service quality of the grid.

Description

technical field [0001] The invention belongs to a computer grid resource allocation method, in particular to a grid resource allocation method based on parallel genetic algorithm. Background technique [0002] At present, grid computing has become the main trend in the development of high-performance computing, and it is the cornerstone of future global scientific cooperation, large-scale computing and data processing. Due to the characteristics of heterogeneity, distribution and autonomy of integrated resources in the grid, it is necessary to provide grid middleware to shield these characteristics, so as to provide transparent services for people. Ad hoc grid is a heterogeneous computing (HC) communication system that allows mobile facilities to complete a set of tasks in adversarial environments. Tasks such as disaster management, forest fire suppression, and protective functions require the reliable support of working environments such as grids, so that computers working...

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/50G06N3/12H04L29/08
CPCY02D10/00
Inventor 李春林宋曼
Owner WUHAN UNIV OF 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