Graph processing using a shared memory
US10089761B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 29, 2016 |
| Grant date | Oct 2, 2018 |
| Priority date | — |
| Expiry date | Apr 29, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T1/60
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Examples herein involve graph processing using a shared memory. An example method includes distributing vertices of a graph to a plurality of graph partition processors of a system, the graph partition processors to process non-overlapping sets of vertices of the graph; storing a master copy of a vertex state of the graph in a shared memory of the system; instructing the graph partition processors to iteratively process respective vertices of the graph partitions based on local copies of the state of the graph stored in respective local memories of the graph partition processors; and updating the master copy of the state of the graph in the shared memory based on the iterative processing of the partitions of the vertices by the graph partition processors until convergence of the graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.