公开(公告)号：US10963301B2

公开(公告)日：2021-03-30

申请号：US16932581

申请日：2020-07-17

Applicant: Google LLC

Inventor： Erik Nathan Vee ,  Manish Deepak Purohit ,  Joshua Ruizhi Wang ,  Shanmugasundaram Ravikumar ,  Zoya Svitkina

IPC: G06F9/48 ,  G06F16/901 ,  G06N3/02

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

公开(公告)号：US20210216367A1

公开(公告)日：2021-07-15

申请号：US17214699

申请日：2021-03-26

Applicant: Google LLC

Inventor： Erik Nathan Vee ,  Manish Deepak Purohit ,  Joshua Ruizhi Wang ,  Shanmugasundaram Ravikumar ,  Zoya Svitkina

IPC: G06F9/48 ,  G06F16/901 ,  G06N3/02

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

公开(公告)号：US20250028556A1

公开(公告)日：2025-01-23

申请号：US18354897

申请日：2023-07-19

Applicant: Google LLC

Inventor： Joshua Ruizhi Wang ,  Brian Mulford ,  Qiaoran Li ,  Michael John de Ridder ,  Pawel Opalinski ,  Tresa Johnson ,  Paul David Duetting ,  Guru Guruganesh ,  Jonathan Schneider

IPC: G06F9/50

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for distributing resources to client devices are described. A computer-implemented system receives a request for a resource distribution constraint for a given resource of a first type, determines that a second type of resource that has a sufficient amount of historical distribution data to generate a distribution constraint, and determines the resource distribution constraint using historical distribution data for the second type of resource.

公开(公告)号：US20210019184A1

公开(公告)日：2021-01-21

申请号：US16932581

申请日：2020-07-17

Applicant: Google LLC

Inventor： Erik Nathan Vee ,  Manish Deepak Purohit ,  Joshua Ruizhi Wang ,  Shanmugasundaram Ravikumar ,  Zoya Svitkina

IPC: G06F9/48 ,  G06N3/02 ,  G06F16/901

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

公开(公告)号：US12141605B2

公开(公告)日：2024-11-12

申请号：US18223495

申请日：2023-07-18

Applicant: Google LLC

Inventor： Erik Nathan Vee ,  Manish Deepak Purohit ,  Joshua Ruizhi Wang ,  Shanmugasundaram Ravikumar ,  Zoya Svitkina

IPC: G06F9/48 ,  G06F16/901 ,  G06N3/02

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

公开(公告)号：US20240126596A1

公开(公告)日：2024-04-18

申请号：US18223495

申请日：2023-07-18

Applicant: Google LLC

Inventor： Erik Nathan Vee ,  Manish Deepak Purohit ,  Joshua Ruizhi Wang ,  Shanmugasundaram Ravikumar ,  Zoya Svitkina

IPC: G06F9/48 ,  G06F16/901 ,  G06N3/02

CPC classification number: G06F9/4881 ,  G06F16/9024 ,  G06N3/02

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

公开(公告)号：US11755367B2

公开(公告)日：2023-09-12

申请号：US17214699

申请日：2021-03-26

Applicant: Google LLC

Inventor： Erik Nathan Vee ,  Manish Deepak Purohit ,  Joshua Ruizhi Wang ,  Shanmugasundaram Ravikumar ,  Zoya Svitkina

IPC: G06F9/48 ,  G06F16/901 ,  G06N3/02

CPC classification number: G06F9/4881 ,  G06F16/9024 ,  G06N3/02

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.