Processing

Please wait...

Settings

Settings

Goto Application

1. CN108345937 - Loop and library fusion

Office
China
Application Number 201810015644.6
Application Date 08.01.2018
Publication Number 108345937
Publication Date 31.07.2018
Grant Number 108345937
Grant Date 12.11.2019
Publication Kind B
IPC
G06N 3/063
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
3Computer systems based on biological models
02using neural network models
06Physical realisation, i.e. hardware implementation of neural networks, neurons or parts of neurons
063using electronic means
G06N 3/08
GPHYSICS
06COMPUTING; CALCULATING OR COUNTING
NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
3Computer systems based on biological models
02using neural network models
08Learning methods
CPC
G06N 3/063
GPHYSICS
06COMPUTING; CALCULATING; COUNTING
NCOMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
3Computer systems based on biological models
02using neural network models
06Physical realisation, i.e. hardware implementation of neural networks, neurons or parts of neurons
063using electronic means
Applicants GOOGLE INC.
谷歌有限责任公司
Inventors ROBERT HUNDT
埃利·本德斯基
MARK HEFFERNAN
罗伯特·洪特
JINGYUE WU
马克·赫弗南
ELI BENDERSKY
吴景岳
Agents 中原信达知识产权代理有限责任公司 11219
中原信达知识产权代理有限责任公司 11219
Priority Data 15400942 06.01.2017 US
Title
(EN) Loop and library fusion
(ZH) 循环与库融合
Abstract
(EN)
The invention relates to loop and library fusion. Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating efficient compiled code. In an examplemethod, a compilation system obtains an un-optimized computational graph comprising a plurality of nodes representing operations and directed edges representing data dependencies. The un-optimized computational graph is analyzed using pattern matching to determine fusable operations that can be fused together into a single fusion operation. The un-optimized computational graph is transformed intoan optimized computational graph by replacing the nodes representing the fusable operations in the un-optimized computational graph with a fusion node representing the single fusion operation. The compilation system produces efficient code by translating the fusion node of the optimized computational graph as a call that performs the fused operations.

(ZH)
本申请涉及循环与库融合。用于生成有效的编译代码的方法、系统和装置,包括在计算机存储介质上编码的计算机程序。在一个示例方法中,编译系统获得未优化的计算图,未优化的计算图包括表示运算的多个节点和表示数据依赖性的有向边。使用模式匹配来分析未优化的计算图以确定可以被一起融合成单个融合运算的可融合运算。通过用表示单个融合运算的融合节点替换表示未优化的计算图中的可融合运算的节点,将未优化的计算图变换成优化的计算图。编译系统通过将优化计算图的融合节点转换为执行融合运算的调用来产生有效代码。