Method and device for realizing graph node attribute storage for shortest path problem

Abstract

The invention discloses a method and device for realizing a graph node attribute memory for the shortest path problem. The graph node attribute memory of the present invention includes a plurality of graph node attribute memory units; each memory unit includes a graph node attribute Initialization, node attribute write success, read success mechanism; graph node attribute initialization, source node attribute value is initialized to 0, non-source node attribute value is initialized to positive infinity (all binary bits in the storage data area are initialized to all 1s); The node attribute writing is successful, if and only when the attribute value of the node to be written is less than or equal to the node attribute value in the memory, the writing can be successful, otherwise the write operation is ignored; the graph node attribute read, for the node attribute storage unit A read operation returns the node attribute data immediately. The present invention implements a method for realizing a graph node attribute memory for the shortest path problem, and reduces the impact of random read operations on performance.

Description

technical field [0001] The invention relates to a storage technology for a graph calculation problem, in particular to a method and device for realizing a graph node attribute memory facing the shortest path problem. Background technique [0002] The graph computing problem is a typical memory-intensive problem, which has the characteristics of unbalanced load, irregular memory access, low computing-memory ratio, and poor locality. A typical graph computing problem involves setting an attribute for each graph node, and the goal of problem solving is to calculate the attribute value corresponding to each node. For example, for the single-source shortest path problem, given the source node S, calculate the shortest distance from the source node S to all graph nodes, where the attribute value is the distance from the node to the source node; for width-first The search problem is to give a root node R and calculate a breadth-first search tree with node R as the root. The attrib...

AI Technical Summary

Problems solved by technology

The update process involves repeated reading and writing of attribute arrays. Usually, the access to attribute arrays is relatively random and irregular, resulting in low graph computing performance.

Images