Method of executing a tuple graph program across a network

    公开(公告)号:US10887235B2

    公开(公告)日:2021-01-05

    申请号:US15685022

    申请日:2017-08-24

    Applicant: Google Inc.

    Abstract: A programming model provides a method for executing a program in a distributed architecture. One or more first shards of the distributed architecture execute one or more operations, and sending tuples to at least one second shard, the tuples being part of a stream and being based on the one or more operations. The one or more first shards send a token value to the at least one second shard when the sending of the tuples in the stream is complete. The at least one second shard determines whether a total of the token values matches a number of the one or more first shards, and takes a first action in response to determining that the total of the token values matches the number of the one or more first shards. The first action may include marking the stream as being complete and/or generating a message indicating that the stream is complete.

    Method for intra-subgraph optimization in tuple graph programs

    公开(公告)号:US10599482B2

    公开(公告)日:2020-03-24

    申请号:US15685055

    申请日:2017-08-24

    Applicant: Google Inc.

    Abstract: A programming model generates a graph for a program, the graph including a plurality of nodes and edges, wherein each node of the graph represents an operation and edges between the nodes represent streams of data input to and output from the operations represented by the nodes. The model determines where in a distributed architecture to execute the operations represented by the nodes. Such determining may include determining which nodes have location restrictions, assigning locations to each node having a location restriction based on the restriction, and partitioning the graph into a plurality of subgraphs, the partitioning including assigning locations to nodes without location restrictions in accordance with a first set of constraints, wherein each node within a particular subgraph is assigned to the same location. Each of the subgraphs is executed at its assigned location in a respective single thread.

    METHOD OF EXECUTING A TUPLE GRAPH PROGRAM ACROSS A NETWORK

    公开(公告)号:US20190068504A1

    公开(公告)日:2019-02-28

    申请号:US15685022

    申请日:2017-08-24

    Applicant: Google Inc.

    Abstract: A programming model provides a method for executing a program in a distributed architecture. One or more first shards of the distributed architecture execute one or more operations, and sending tuples to at least one second shard, the tuples being part of a stream and being based on the one or more operations. The one or more first shards send a token value to the at least one second shard when the sending of the tuples in the stream is complete. The at least one second shard determines whether a total of the token values matches a number of the one or more first shards, and takes a first action in response to determining that the total of the token values matches the number of the one or more first shards. The first action may include marking the stream as being complete and/or generating a message indicating that the stream is complete.

    METHOD FOR INTRA-SUBGRAPH OPTIMIZATION IN TUPLE GRAPH PROGRAMS

    公开(公告)号:US20190065162A1

    公开(公告)日:2019-02-28

    申请号:US15685055

    申请日:2017-08-24

    Applicant: Google Inc.

    CPC classification number: G06F9/5066 G06F8/443 G06F8/456 G06F8/47 G06F17/504

    Abstract: A programming model generates a graph for a program, the graph including a plurality of nodes and edges, wherein each node of the graph represents an operation and edges between the nodes represent streams of data input to and output from the operations represented by the nodes. The model determines where in a distributed architecture to execute the operations represented by the nodes. Such determining may include determining which nodes have location restrictions, assigning locations to each node having a location restriction based on the restriction, and partitioning the graph into a plurality of subgraphs, the partitioning including assigning locations to nodes without location restrictions in accordance with a first set of constraints, wherein each node within a particular subgraph is assigned to the same location. Each of the subgraphs is executed at its assigned location in a respective single thread.

Patent Agency Ranking