Data node random allocation method and system

A data node, random allocation technology, applied in the field of cloud storage, can solve the problem of no data node allocation probability balance, etc.

Active Publication Date: 2015-10-07
ZHEJIANG DAHUA TECH CO LTD
View PDF3 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] To sum up, the existing technology does not have a method that can not only realize the random allocation of data nodes but also ensure a more balanced distribution probability

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
  • Data node random allocation method and system
  • Data node random allocation method and system
  • Data node random allocation method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] Embodiments of the present invention provide a method and system for randomly allocating data nodes, so as to realize more balanced random allocation of data nodes.

[0050]The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

[0051] Such as figure 1 As shown, a method for randomly allocating data nodes provided by an embodiment of the present invention includes:

[0052] Step S101: When it is determined that data node allocation is required, according to preset rules, determine the data node ID that needs to be...

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 data node random allocation method and system, and aims to obtain more equilibrated probability for data node random allocation. The data node random allocation method provided by the embodiment comprises following steps: determining data node identities required to be allocated for the current time from an allocation table composed of data node identities according to a preset rule when the a condition that the data nodes are required to be allocated is determined; and allocating the data nodes corresponding to the data node identities required to be allocated for the current time. The allocation table comprises multiple rows of data node identities, the multiple data node identities in each row are randomly distributed, and the data node identities in any two rows are differently distributed. The preset rule comprises one item that the data node identities required to be allocated are determined from the different rows in the allocation table for adjacent two times.

Description

technical field [0001] The present invention relates to the technical field of cloud storage, in particular to a method and system for randomly allocating data nodes. Background technique [0002] The traditional distributed file system randomly allocates data nodes in two allocation modes: polling mode and virtual node mode. In the case of batch application nodes, the polling mode causes data to be fixedly allocated on adjacent data nodes, which becomes a performance bottleneck. The virtual node mode generally uses consistent hashing. Its advantage is that the system shocks less when adding / deleting data nodes, but the consistent hashing function is a random function, which is easy to store when the number of storage nodes is small. This results in uneven distribution of data. [0003] Specifically, the polling mode is a common way for distributed storage systems to achieve extreme stress testing performance, which is simple to implement and highly efficient. The client ...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/30G06F3/06
Inventor 翁健许焰周明伟王亮舒添翼陈伟张兴明
Owner ZHEJIANG DAHUA TECH CO LTD
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