-
公开(公告)号:US10354186B2
公开(公告)日:2019-07-16
申请号:US15965745
申请日:2018-04-27
Applicant: Google LLC
Inventor: Vijay Vasudevan , Jeffrey Adgate Dean , Sanjay Ghemawat
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for modifying a computational graph to include send and receive nodes. Communication between unique devices performing operations of different subgraphs of the computational graph can be handled efficiently by inserting send and receive nodes into each subgraph. When executed, the operations that these send and receive nodes represent may enable pairs of unique devices to conduct communication with each other in a self-sufficient manner. This shifts the burden of coordinating communication away from the backend, which affords the system that processes this computational graph representation the opportunity to perform one or more other processes while devices are executing subgraphs.
-
公开(公告)号:US10204110B2
公开(公告)日:2019-02-12
申请号:US15269788
申请日:2016-09-19
Applicant: GOOGLE LLC
Inventor: Yasushi Saito , Sanjay Ghemawat , Jeffrey Adgate Dean
IPC: G06F17/30
Abstract: A method for deleting obsolete files from a file system is provided. The method includes receiving a request to delete a reference to a first target file of a plurality of target files stored in a file system, the first target file having a first target file name. A first reference file whose file name includes the first target file name is identified. The first reference file is deleted from the file system. The method further includes determining whether the file system includes at least one reference file, distinct from the first reference file, whose file name includes the first target file name. In accordance with a determination that the file system does not include the at least one reference file, the first target file is deleted from the file system.
-
公开(公告)号:US20180247198A1
公开(公告)日:2018-08-30
申请号:US15965745
申请日:2018-04-27
Applicant: Google LLC
Inventor: Vijay Vasudevan , Jeffrey Adgate Dean , Sanjay Ghemawat
CPC classification number: G06N3/082 , G06F9/5038 , G06F9/5066 , G06F9/547 , G06F17/16 , G06N3/04 , G06N3/0454 , G06N3/063 , G06N3/084
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for modifying a computational graph to include send and receive nodes. Communication between unique devices performing operations of different subgraphs of the computational graph can be handled efficiently by inserting send and receive nodes into each subgraph. When executed, the operations that these send and receive nodes represent may enable pairs of unique devices to conduct communication with each other in a self-sufficient manner. This shifts the burden of coordinating communication away from the backend, which affords the system that processes this computational graph representation the opportunity to perform one or more other processes while devices are executing subgraphs.
-
公开(公告)号:US12248745B2
公开(公告)日:2025-03-11
申请号:US18395251
申请日:2023-12-22
Applicant: Google LLC
Inventor: Anna Darling Goldie , Azalia Mirhoseini , Ebrahim Songhori , Wenjie Jiang , Shen Wang , Roger David Carpenter , Young-Joon Lee , Mustafa Nazim Yazgan , Chian-min Richard Ho , Quoc V. Le , James Laudon , Jeffrey Adgate Dean , Kavya Srinivasa Setty , Omkar Pathak
IPC: G06F30/392 , G06F30/398 , G06N3/08
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating a computer chip placement. One of the methods includes obtaining netlist data for a computer chip; and generating a computer chip placement, comprising placing a respective macro node at each time step in a sequence comprising a plurality of time steps, the placing comprising, for each time step: generating an input representation for the time step; processing the input representation using a node placement neural network having a plurality of network parameters, wherein the node placement neural network is configured to process the input representation in accordance with current values of the network parameters to generate a score distribution over a plurality of positions on the surface of the computer chip; and assigning the macro node to be placed at the time step to a position from the plurality of positions using the score distribution.
-
公开(公告)号:US20250077474A1
公开(公告)日:2025-03-06
申请号:US18794474
申请日:2024-08-05
Applicant: Google LLC
Inventor: Yasushi Saito , Sanjay Ghemawat , Jeffrey Adgate Dean
IPC: G06F16/16 , G06F16/11 , G06F16/174 , G06F16/182 , G06F16/215
Abstract: A method for deleting obsolete files from a file system is provided. The method includes receiving a request to delete a reference to a first target file of a plurality of target files stored in a file system, the first target file having a first target file name. A first reference file whose file name includes the first target file name is identified. The first reference file is deleted from the file system. The method further includes determining whether the file system includes at least one reference file, distinct from the first reference file, whose file name includes the first target file name. In accordance with a determination that the file system does not include the at least one reference file, the first target file is deleted from the file system.
-
公开(公告)号:US20250053714A1
公开(公告)日:2025-02-13
申请号:US18805439
申请日:2024-08-14
Applicant: Google LLC
Inventor: Chian-min Richard Ho , William Hang , Mustafa Nazim Yazgan , Anna Darling Goldie , Jeffrey Adgate Dean , Azalia Mirhoseini , Emre Tuncer , Ya Wang , Anand Babu
IPC: G06F30/27 , G06F30/392
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating a computer chip floorplan. One of the methods includes obtaining netlist data for a computer chip; and generating a computer chip floorplan, comprising placing a respective node at each time step in a sequence comprising a plurality of time steps, the placing comprising, for each time step: generating an input representation for the time step; processing the input representation using a node placement neural network having a plurality of network parameters, wherein the node placement neural network is configured to process the input representation in accordance with current values of the network parameters to generate a score distribution over a plurality of positions on the surface of the computer chip; and assigning the node to be placed at the time step to a position from the plurality of positions using the score distribution.
-
公开(公告)号:US20240370721A1
公开(公告)日:2024-11-07
申请号:US18605700
申请日:2024-03-14
Applicant: Google LLC
Inventor: Andrea Gesmundo , Jeffrey Adgate Dean
IPC: G06N3/08
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for training a neural network system to perform multiple machine learning tasks.
-
公开(公告)号:US12073307B2
公开(公告)日:2024-08-27
申请号:US18466751
申请日:2023-09-13
Applicant: Google LLC
Inventor: Gregory Sean Corrado , Ilya Sutskever , Jeffrey Adgate Dean
CPC classification number: G06N3/047 , G06N3/042 , G06N3/044 , G06N3/063 , G16H50/20 , G06N3/02 , G06N3/08
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for predicting likelihoods of conditions being satisfied using recurrent neural networks. One of the systems is configured to process a temporal sequence comprising a respective input at each of a plurality of time steps and comprises: one or more recurrent neural network layers; one or more logistic regression nodes, wherein each of the logistic regression nodes corresponds to a respective condition from a predetermined set of conditions, and wherein each of the logistic regression nodes is configured to, for each of the plurality of time steps: receive the network internal state for the time step; and process the network internal state for the time step in accordance with current values of a set of parameters of the logistic regression node to generate a future condition score for the corresponding condition for the time step.
-
公开(公告)号:US20240249058A1
公开(公告)日:2024-07-25
申请号:US18395251
申请日:2023-12-22
Applicant: Google LLC
Inventor: Anna Darling Goldie , Azalia Mirhoseini , Ebrahim Songhori , Wenjie Jiang , Shen Wang , Roger David Carpenter , Young-Joon Lee , Mustafa Nazim Yazgan , Chian-min Richard Ho , Quoc V. Le , James Laudon , Jeffrey Adgate Dean , Kavya Srinivasa Setty , Omkar Pathak
IPC: G06F30/392 , G06F30/398 , G06N3/08
CPC classification number: G06F30/392 , G06F30/398 , G06N3/08
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating a computer chip placement. One of the methods includes obtaining netlist data for a computer chip; and generating a computer chip placement, comprising placing a respective macro node at each time step in a sequence comprising a plurality of time steps, the placing comprising, for each time step: generating an input representation for the time step; processing the input representation using a node placement neural network having a plurality of network parameters, wherein the node placement neural network is configured to process the input representation in accordance with current values of the network parameters to generate a score distribution over a plurality of positions on the surface of the computer chip; and assigning the macro node to be placed at the time step to a position from the plurality of positions using the score distribution.
-
公开(公告)号:US20240160948A1
公开(公告)日:2024-05-16
申请号:US18235632
申请日:2023-08-18
Applicant: Google LLC
Inventor: Paul A. Tucker , Jeffrey Adgate Dean , Sanjay Ghemawat , Yuan Yu
CPC classification number: G06N3/098 , G06F9/5038 , G06F9/5066 , G06N3/045 , G06N3/063 , G06N3/08 , G06N3/084 , G06N20/00 , G06N5/048
Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for receiving a request from a client to process a computational graph; obtaining data representing 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; identifying a plurality of available devices for performing the requested operation; partitioning the computational graph into a plurality of subgraphs, each subgraph comprising one or more nodes in the computational graph; and assigning, for each subgraph, the operations represented by the one or more nodes in the subgraph to a respective available device in the plurality of available devices for operation.
-
-
-
-
-
-
-
-
-