Three-class vertex degree aware-based 1.5-dimensional graph division method and application
US12418579B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 30, 2024 |
| Grant date | Sep 16, 2025 |
| Priority date | — |
| Expiry date | Sep 30, 2044 |
Classification
- Technology area (CPC Y)Emerging Cross-Sectional Technologies
- CPC primaryY02D10/00
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
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 messa…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.