Dynamic fault-tolerant method and dynamic fault-tolerant system based on P2P in distributed parallel graph processing

A graph processing and distributed technology, applied in the field of computer networks, can solve the problems of unsuitable open network environment and high recovery cost, etc., and achieve the effects of reducing overall communication time, fast error recovery, and average network traffic

Active Publication Date: 2015-05-13
PEKING UNIV
View PDF4 Cites 20 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This fault tolerance mechanism is static, and the recovery cost is r

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 fault-tolerant method and dynamic fault-tolerant system based on P2P in distributed parallel graph processing
  • Dynamic fault-tolerant method and dynamic fault-tolerant system based on P2P in distributed parallel graph processing
  • Dynamic fault-tolerant method and dynamic fault-tolerant system based on P2P in distributed parallel graph processing

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0027] In order to make the above objects, features and advantages of the present invention more obvious and understandable, the present invention will be further described below through specific embodiments and accompanying drawings.

[0028] The P2P-based dynamic fault-tolerant method in the distributed parallel graph processing of the present invention comprises the following steps:

[0029] (1) In order to ensure that data can be recovered completely during the dynamic fault-tolerant process, the present invention defines the data unit for distributed graph processing.

[0030] In graph processing, the parameters required for each vertex operation include not only the original state of the vertex itself, but also the messages propagated by its adjacent vertices. Therefore, when defining the data unit of the graph processing problem, not only the dependency on the data in the vertices of the previous iteration should be considered, but also the message dependencies of adjac...

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 dynamic fault-tolerant method and a dynamic fault-tolerant system based on P2P in distributed parallel graph processing. The method comprises the steps of defining the data units of a distribute graph processing problem to ensure the integrity of data recovered during dynamic fault tolerance, forming processor nodes into a ring structure, dividing the input graph data into a plurality of partitions and assigning each partition into each processor node and enabling each processor node to generate the copy backup of the data unit thereof into the adjacent processor node, after each processor node completes the data unit thereof, updating the copy placed into the adjacent processor node in an incremental manner, and when one processor node is invalid or offline due to network failure, aligning the adjacent node of the processor node to replace the original data unit with the data copy, completing corresponding operation and recovering the normal graph processing. The dynamic fault-tolerant method is capable of recovering the normal state of the graph processing operation from abnormal conditions such as node failure and network failure, and guaranteeing correct performing of the operation.

Description

technical field [0001] The invention relates to the technical field of computer networks, in particular to a dynamic fault-tolerant method and system for distributed parallel graph processing in an open and dynamic network environment. Background technique [0002] In recent years, with the popularization and development of technologies such as social networks and collaborative networks, the scale of data in the Internet has become larger and larger, which has brought new challenges to the analysis of these data. In scenarios such as social networks and collaborative networks, there may be associations between data, and related research often uses graph structures to describe these data. The vertices in the graph record the attributes of the data itself, and the edges in the graph correspond to the associations between the data. In this way, the analysis of network data is transformed into graph processing. However, the above-mentioned graph structures often have millions,...

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): H04L12/24H04L29/08
Inventor 曹东刚詹杭龙李宝梅宏
Owner PEKING UNIV
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