×

STREAM-BASED ACCELERATOR PROCESSING OF COMPUTATIONAL GRAPHS

  • US 20170124451A1
  • Filed: 10/27/2016
  • Published: 05/04/2017
  • Est. Priority Date: 10/28/2015
  • Status: Active Grant
First Claim
Patent Images

1. A method comprising:

  • receiving, by a computational graph system, a request to process a computational graph;

    obtaining data representing a subgraph of the computational graph, the computational graph comprising a plurality of nodes and directed edges, wherein each node represents a respective operation, wherein each directed edge connects a respective first node to a respective second node that represents an operation that receives, as input, an output of an operation represented by the respective first node, the subgraph assigned to a first device by a placer in the computational graph system;

    determining that the first device comprises a hardware accelerator having a plurality of streams;

    in response to determining that the first device comprises a hardware accelerator having a plurality of streams, generating instructions that when executed by the first device cause the first device to;

    assign the operation represented by each node in the subgraph to a respective stream in the plurality of streams of the hardware accelerator; and

    perform the operations represented by the nodes in the subgraph in accordance with the assignment; and

    providing the instructions and the data to the first device.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×