Data consistency concurrent maintenance method

一种一致性、数据的技术,应用在数据校验领域,能够解决降低操作效率、阻塞其他节点操作、数据一致性无法满足分布式系统数据需求等问题,达到提高并行性、避免单点实效隐患的效果

Active Publication Date: 2016-12-07
SUZHOU SUPERBLOCK CHAIN INFORMATION SCI & TECH CO LTD
View PDF15 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0014] To sum up, the existing solutions for multi-node distributed computing rely on centralized storage and serialized processing to solve data consistency problems. In a decentralized scenario, if you want to maintain data consistency, you must rely on data Serialization operation, the serialization method will block the operations of other nodes, even nodes without context dependencies often have to wait for the operations of other nodes to complete, which greatly reduces the operation efficiency
However, the post-processing method to solve the problem of data consistency cannot meet the data requirements of distributed systems in real-time operation.

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 consistency concurrent maintenance method
  • Data consistency concurrent maintenance method
  • Data consistency concurrent maintenance method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment approach 1

[0043] Implementation scheme 1: In an open network environment, when there is no synchronization anchor available in the network, there are n nodes in parallel that have data addition and maintenance requirements.

[0044] 1, such as image 3 As shown, n nodes with data maintenance needs broadcast synchronization cycle query to other nodes in the network, requesting to obtain the current latest synchronization block. The query request broadcast packet contains the node's own information, the data structure information expected to be maintained, the necessary version information and Communication protocol information, which can be received and interpreted by nodes running similar computing software in the network. The node with the corresponding synchronization block and synchronization anchor responds to the request and replies to the requesting node with the latest available synchronization block;

[0045] 2. If the expected synchronization block is not obtained within a giv...

Embodiment approach 2

[0054] Implementation Option 2: In an open network environment, there are already available synchronization anchors in the network, and there are n nodes in parallel with data addition and maintenance requirements.

[0055] 1, such as image 3 As shown, n nodes with data maintenance needs broadcast synchronization cycle query to other nodes in the network to request the latest synchronization block. The broadcast request includes the node's own information, the data structure information expected to be maintained, the necessary version information and communication protocol information , the information can be received and interpreted by nodes running similar computing software in the network. The node with the corresponding synchronization block and synchronization anchor responds to the request and replies to the requesting node with the latest available synchronization block;

[0056] 2. Nodes with data maintenance requirements obtain the desired synchronization block S wi...

Embodiment approach 3

[0064] Implementation Option 3: In an open network environment, historical synchronization anchors already exist locally on nodes, and n parallel nodes have data addition and maintenance requirements.

[0065] 1. If image 3 As shown, n nodes with data maintenance needs broadcast synchronization cycle query to other nodes in the network to request the latest synchronization block. The broadcast request includes the node's own information, the data structure information expected to be maintained, the necessary version information and communication protocol information , the information can be received and interpreted by nodes running similar computing software in the network. The node with the corresponding synchronization block and synchronization anchor responds to the request and replies to the requesting node with the latest available synchronization block;

[0066] 2. Nodes with data maintenance requirements do not receive the expected synchronization block response withi...

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 consistency concurrent maintenance method. The method comprises the steps that 1, a node broadcasts a request for other nodes in a network for a synchronous block in a current synchronous period and calculates a synchronous anchor of the current synchronous period, and if the expected synchronous block is not obtained, the node calculates the synchronous anchor of the stored synchronous block or initializes a starting synchronous block S0 and the synchronous anchor thereof; 2, a node I with the data addition requirement writes the synchronous anchor of the current synchronous period into data A0, and an array [A]N is generated as needed; the data A0 is to be added into consistency data in the synchronous period; 3, the nodes concurrently complete construction and broadcasting of the array [A]N of the nodes; 4, the nodes filter all received [A]N with the identical synchronous anchor, abnormal data is removed, and the synchronous block of the next synchronous period is constructed. Data of the synchronous blocks can be concurrently generated, and meanwhile the whole data structure can still keep the whole consistency on the dependency.

Description

technical field [0001] The invention belongs to the technical field of computers, and in particular relates to a data verification method which has global consistency and is friendly to parallel processing processes in a network distributed computing environment. Background technique [0002] Network Distributed Computing [0003] Computing units (including but not limited to computers) in a network environment operate independently, and cooperate to complete specific computing tasks through specific communication protocols and application software. When distributed computing needs to rely on the same data set, all computing nodes rely on a centralized storage management mechanism to read and write the required data. This method of reading and writing data is applicable under fully managed computing conditions. In the absence of centralized storage management, although the existing data verification methods can solve the verification and error correction in transmission, be...

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/30
CPCG06F16/2329G06F16/2365G06F16/273G06F16/00G06F16/215G06F16/2255G06F16/25G06F16/275G06F9/5072
Inventor 陈光宇史兴国
Owner SUZHOU SUPERBLOCK CHAIN INFORMATION SCI & 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