The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Sep. 16, 2025
Filed:
Sep. 30, 2024
Research Institute of Tsinghua University IN Shenzhen, Shenzhen, CN;
Huanqi Cao, Beijing, CN;
Yuanwei Wang, Beijing, CN;
Research Institute of Tsinghua University in Shenzhen, Shenzhen, CN;
Abstract
Provided are a distributed parallel computing-based graph computing method, a distributed parallel computing system, and a computer readable medium. The graph computing method comprises: obtaining data of a graph to be computed, dividing vertexes into a first extremely high degree class E, a second high degree class H, and a third regular class R, forming a super node by a predetermined number of compute nodes, the communication between nodes in a super node being faster than the communication between nodes across the super node, and dividing the nodes into grids, one node in each grid, the internal nodes in one super node being logically arranged in a row, vertices being evenly divided into the nodes according to numbers, Ri and Ro being maintained by the nodes to which Ri and Ro belong, the state of an Ho vertex being synchronously maintained on a column, the state of an Hi vertex being synchronously maintained on the column and the row, and the states of Eo and Ei vertexes being globally and synchronously maintained. According to the three-level vertex division method, sub-graphs are well balanced between the nodes, thereby facilitating elimination of repeated sending of a message to a same super node, and avoiding a high-cost global delegate.