Dynamic self-adapting graticule data migration method

A dynamic adaptive, grid data technology, applied in the direction of program startup/switching, resource allocation, multi-program installation, etc., can solve problems such as data migration, and achieve the effect of reducing space size, selecting reasonable and optimizing

Active Publication Date: 2008-11-05
NANJING UNIV OF POSTS & TELECOMM
View PDF0 Cites 16 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Technical problem: The purpose of this invention is to provide a dynamic adaptive grid data migration method to solve the data migration problem in the g

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
  • Dynamic self-adapting graticule data migration method
  • Dynamic self-adapting graticule data migration method
  • Dynamic self-adapting graticule data migration method

Examples

Experimental program
Comparison scheme
Effect test
No Example Login to view more

PUM

No PUM Login to view more

Abstract

A dynamic self-adaptive grid data migration method is a dynamic self-adaptive mechanism when the grid data are required to migrate, which is mainly composed of a data migration controller, a target node selector, an index analyzer, a data migration operation kernel, and the like. When the data at a certain node in the grid cannot conform to the data service quality of the current user, or cause the network bandwidth waste, the data at the node are required to migrate at this time, by selecting factors such as the band-width the node reaches, the local management system property of the node, the data access load of the node and the size of the data to be migrated at present, and then preprocessing these factors, using the gene expression programming algorithm idea to dig out the functional relation between the target node and these factors, thereby the selection of the target node can be better executed by the functional relation obtained by digging.

Description

technical field [0001] The invention relates to a data migration method in grid computing, which is mainly used to solve the problem of grid data migration and belongs to the field of distributed computing software. Background technique [0002] Grid computing is a supporting platform for distributed and parallel computing, and it is a seamless, integrated computing and collaborative environment. It can use geographically dispersed computing resources as a virtual whole, such as high-speed interconnected heterogeneous computers, databases, scientific instruments, files, and supercomputing systems. The Internet-based grid computing system not only enables people to gather distributed computing power, form supercomputing capabilities, and solve problems in many major application fields such as high-energy physics, atmosphere, astronomy, bioinformatics, and petroleum geology (such as virtual nuclear explosions). , new drug development, weather forecast and environmental monito...

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/48G06F9/50
Inventor 王汝传邓松季一木任勋益易侃杨明慧蒋凌云付雄张琳
Owner NANJING UNIV OF POSTS & TELECOMM
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