公开(公告)号：US20200264856A1

公开(公告)日：2020-08-20

申请号：US16865852

申请日：2020-05-04

Applicant: Graphcore Limited

Inventor： Mark Lloyd Pupilli ,  David Lacey

IPC: G06F8/41 ,  G06N3/08 ,  G06F16/901

Abstract: A method for generating a program to run on multiple tiles. The method comprises: receiving an input graph comprising data nodes, compute vertices and edges; receiving an initial tile-mapping specifying which data nodes and vertices are allocated to which tile; and determining a subgraph of the input graph that meets one or more heuristic rules. The rules comprises: the subgraph comprises at least one data node, the subgraph spans no more than a threshold number of tiles in the initial tile-mapping, and the subgraph comprises at least a minimum number of edges outputting to one or more vertices on one or more other tiles. The method further comprises adapting the initial mapping to migrate the data nodes and any vertices of the determined subgraph to said one or more other tiles.

公开(公告)号：US10691432B1

公开(公告)日：2020-06-23

申请号：US16277178

申请日：2019-02-15

Applicant: Graphcore Limited

Inventor： Mark Lloyd Pupilli ,  David Lacey

IPC: G06F8/41 ,  G06F16/901 ,  G06N3/08

Abstract: A method for generating a program to run on multiple tiles. The method comprises: receiving an input graph comprising data nodes, compute vertices and edges; receiving an initial tile-mapping specifying which data nodes and vertices are allocated to which tile; and determining a subgraph of the input graph that meets one or more heuristic rules. The rules comprises: the subgraph comprises at least one data node, the subgraph spans no more than a threshold number of tiles in the initial tile-mapping, and the subgraph comprises at least a minimum number of edges outputting to one or more vertices on one or more other tiles. The method further comprises adapting the initial mapping to migrate the data nodes and any vertices of the determined subgraph to said one or more other tiles, and compiling the executable program from the graph with the vertices and data nodes allocated by the adapted mapping.

公开(公告)号：US11366649B2

公开(公告)日：2022-06-21

申请号：US16865852

申请日：2020-05-04

Applicant: Graphcore Limited

Inventor： Mark Lloyd Pupilli ,  David Lacey

IPC: G06F8/41 ,  G06F16/901 ,  G06N3/08

Abstract: A method for generating a program to run on multiple tiles. The method comprises: receiving an input graph comprising data nodes, compute vertices and edges; receiving an initial tile-mapping specifying which data nodes and vertices are allocated to which tile; and determining a subgraph of the input graph that meets one or more heuristic rules. The rules comprises: the subgraph comprises at least one data node, the subgraph spans no more than a threshold number of tiles in the initial tile-mapping, and the subgraph comprises at least a minimum number of edges outputting to one or more vertices on one or more other tiles. The method further comprises adapting the initial mapping to migrate the data nodes and any vertices of the determined subgraph to said one or more other tiles.

公开(公告)号：US20200218523A1

公开(公告)日：2020-07-09

申请号：US16277178

申请日：2019-02-15

Applicant: Graphcore Limited

Inventor： Mark Lloyd Pupilli ,  David Lacey

IPC: G06F8/41 ,  G06N3/08 ,  G06F16/901

Abstract: A method for generating a program to run on multiple tiles. The method comprises: receiving an input graph comprising data nodes, compute vertices and edges; receiving an initial tile-mapping specifying which data nodes and vertices are allocated to which tile; and determining a subgraph of the input graph that meets one or more heuristic rules. The rules comprises: the subgraph comprises at least one data node, the subgraph spans no more than a threshold number of tiles in the initial tile-mapping, and the subgraph comprises at least a minimum number of edges outputting to one or more vertices on one or more other tiles. The method further comprises adapting the initial mapping to migrate the data nodes and any vertices of the determined subgraph to said one or more other tiles, and compiling the executable program from the graph with the vertices and data nodes allocated by the adapted mapping.