Graph division method and device and computer readable storage medium

A technology for graph partitioning and computing nodes, applied in the field of graph computing, can solve problems such as inaccurate and inappropriate graph partitioning results, improve the efficiency of large graph partitioning and parallel processing, improve partition efficiency, and improve accuracy and effectiveness Effect

Active Publication Date: 2021-03-05
INSPUR SUZHOU INTELLIGENT TECH CO LTD
View PDF4 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, with the advancement of computer hardware technology and asynchronous upgrades, the configuration and performance of computing nodes in parallel computing systems are not necessarily the same, so the above assumptions are not appropriate, so the result of graph division based on this implicit condition is not accurate

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
  • Graph division method and device and computer readable storage medium
  • Graph division method and device and computer readable storage medium
  • Graph division method and device and computer readable storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment approach

[0090] As an optional implementation, in order to read the graph data more efficiently, this application also provides an implementation for the step "calling multiple loading threads to read the graph data to be divided in parallel in units of vertices", which may include the following:

[0091] Pre-store the graph to be divided into the storage disk array in the form of an adjacency list; call multiple loading threads to read the data of the graph to be divided in parallel in units of vertices according to the preset data reading order;

[0092] Among them, the preset data reading order is breadth-first order or depth-first order or random order; the i-th loading thread reads the first Line to No. row graph data, i∈[1,k], |V| is the number of vertices of the graph to be divided, k is the total number of loading threads, In order to round down *, |*| is the cardinality of the calculation set, which is used to indicate the number of elements in it. The mathematical opera...

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 graph division method and device and a computer readable storage medium. The method comprises the following steps: determining a graph division rule for proportionally distributing graph data to each computing node in advance according to the computing performance of each computing node of the parallel computing system and a preset measurement mechanism; in a graph division process, determining a data reading range of each loading thread according to a graph vertex number and a loading thread number, simultaneously calling a plurality of loading threads to read graphdata to be divided in parallel by taking a vertex as a unit, and transmitting the graph vertex data read by each loading thread to a corresponding division thread. Each division thread determines a sub-graph to which each piece of graph vertex data transmitted into the corresponding thread belongs according to a graph division rule based on the graph data divided at the current moment, and finallydivides each piece of graph vertex data to the corresponding calculation node based on a corresponding relationship between the sub-graph and the calculation node. The large graph can be efficientlyand accurately divided into a series of sub-graphs with the vertex number or the connecting edge number meeting any proportional relation.

Description

technical field [0001] The present application relates to the field of graph computing, in particular to a graph partitioning method, device and computer-readable storage medium. Background technique [0002] With the rapid development of emerging information technologies such as the Internet of Things, mobile Internet, and cloud computing, new applications represented by social networking and e-commerce have been widely used. These applications continue to generate large-scale data, and there are usually complex relationships between data elements. These large-scale and related data can be modeled with graphs. Such data is called graph big data, or big graph for short. For example, as of June 2018, Facebook, the world's largest social platform, has 2 billion users and 1 trillion friend relationships; Page, the largest public Web link graph dataset, contains 3.5 billion web pages and 128 billion hyperlinks. These large images contain huge value. Due to the limited performan...

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): G06F16/901
CPCG06F16/9024
Inventor 胡克坤董刚赵雅倩杨宏斌曹其春金良
Owner INSPUR SUZHOU INTELLIGENT 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