公开(公告)号：US10089761B2

公开(公告)日：2018-10-02

申请号：US15143273

申请日：2016-04-29

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Krishnamurthy Viswanathan ,  Maria Gonzalez ,  Fei Chen ,  Hernan Laffitte

IPC: G06T11/20 ,  G06T1/60 ,  G06T1/20 ,  G06F17/30

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.

公开(公告)号：US20170316591A1

公开(公告)日：2017-11-02

申请号：US15143273

申请日：2016-04-29

Applicant: Hewlett Packard Enterprise Development LP

Inventor： Krishnamurthy Viswanathan ,  Maria Gonzalez ,  Fei Chen ,  Fei Chen ,  Hernan Laffitte

IPC: G06T11/20 ,  G06T1/60 ,  G06T1/20

CPC classification number: G06T11/206 ,  G06F17/30958 ,  G06T1/20 ,  G06T1/60

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.