METHOD OF REORDERING CONDITION CHECKS
    3.
    发明申请

    公开(公告)号:US20190188113A1

    公开(公告)日:2019-06-20

    申请号:US16285781

    申请日:2019-02-26

    IPC分类号: G06F11/36 G06F8/41

    摘要: Described is a computer-implemented method of reordering condition checks. Two or more condition checks in computer code that may be reordered within the code are identified. It is determined that the execution frequency of a later one of the condition checks is satisfied at a greater frequency than a preceding one of the condition checks. It is determined that there is an absence of side effects in the two or more condition checks. The values of the condition checks are propagated and abstract interpretation is performed on the values that are propagated. It is determined that the condition checks are exclusive of each other, and the condition checks are reordered within the computer code.

    ALTERNATIVE LOOP LIMITS
    6.
    发明申请

    公开(公告)号:US20180365561A1

    公开(公告)日:2018-12-20

    申请号:US15627022

    申请日:2017-06-19

    申请人: Google Inc.

    IPC分类号: G06N3/08 G06N99/00

    摘要: Methods, systems, and apparatus for accessing a N-dimensional tensor are described. In some implementations, a method includes, for each of one or more first iterations of a first nested loop, performing iterations of a second nested loop that is nested within the first nested loop until a first loop bound for the second nested loop is reached. A number of iterations of the second nested loop for the one or more first iterations of the first nested loop is limited by the first loop bound in response to the second nested loop having a total number of iterations that exceeds a value of a hardware property of the computing system. After a penultimate iteration of the first nested loop has completed, one or more iterations of the second nested loop are performed for a final iteration of the first nested loop until an alternative loop bound is reached.

    GRAPH MATCHING FOR OPTIMIZED DEEP NETWORK PROCESSING

    公开(公告)号:US20180314945A1

    公开(公告)日:2018-11-01

    申请号:US15498943

    申请日:2017-04-27

    IPC分类号: G06N3/08 G06N3/04

    摘要: Systems, apparatuses, and methods for enhanced resolution video and security via machine learning are disclosed. A system is configured to receive a source code representation of a neural network. In one embodiment, the source code representation is a directed acyclic graph (DAG). The system determines if the source code representation includes any of one or more patterns, with each pattern including two or more adjacent layers. The system also identifies, for each pattern, a combined layer with which to replace the detected pattern. If any occurrences of the one or more patterns are detected in the source code representation, the system replaces each pattern with a corresponding combined layer. Additionally, the system generates an optimized representation of the neural network, wherein the optimized representation includes replacements for any detected patterns. The optimized representation can be utilized to generate an executable version of the neural network.

    System and method for link time optimization

    公开(公告)号:US10061571B2

    公开(公告)日:2018-08-28

    申请号:US15273511

    申请日:2016-09-22

    IPC分类号: G06F8/41 G06F8/54 G06F9/445

    摘要: A method for link time optimization comprises parsing, by a compiler, an intermediate representation file to determine what symbols are present in the intermediate representation file. The method comprises providing the symbols to a linker and creating, by the linker, a symbol use tree of all the symbols that are present in the intermediate representation file and other symbols in binary code received by the linker. The method further comprises discarding, by the linker, any received objects for which no use can be identified and all dependencies of the objects. The method includes providing, from the linker to the compiler, a preserve list of symbols, the preserve list comprising a list of symbols proven used by the objects and the intermediate representation files. The method comprises compiling the intermediate representation files and the objects based on the preserve list of symbols, and deleting, by the linker, any remaining unused objects.