会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • FUSING A SEQUENCE OF OPERATIONS THROUGH SUBDIVIDING
    • 通过分解来完成操作的顺序
    • US20160350088A1
    • 2016-12-01
    • US14723141
    • 2015-05-27
    • Nvidia Corporation
    • Mahesh RavishankarPaulius MicikeviciusVinod Grover
    • G06F9/45
    • G06F8/4434G06F8/41G06F8/45
    • A compiler and a method of compiling code that reduces memory bandwidth when processing code on a computer are provided herein. In one embodiment, the method includes: (1) automatically identifying a sequence of operations for fusing, wherein the sequence of operations correspond to instructions from a source code, (2) determining subdivisions of a final output of the sequence of operations, (3) determining input data and intermediate operations needed to obtain a final subdivision output for each of the subdivisions and (4) automatically generating code to fuse the sequence of operations employing the subdivisions, wherein the automatically identifying and the automatically generating are performed by a processor.
    • 本文提供了一种编译器和编译在计算机上处​​理代码时减少内存带宽的代码的方法。 在一个实施例中,该方法包括:(1)自动识别用于融合的操作序列,其中所述操作序列对应于源代码的指令,(2)确定所述操作序列的最终输出的细分,(3 )确定为每个子部分获得最终细分输出所需的输入数据和中间操作,以及(4)自动生成代码以融合采用该细分的操作序列,其中自动识别和自动生成由处理器执行。
    • 2. 发明授权
    • Methods for reducing memory space in sequential operations using directed acyclic graphs
    • 使用有向非循环图在顺序操作中减少内存空间的方法
    • US09563933B2
    • 2017-02-07
    • US14165789
    • 2014-01-28
    • Nvidia Corporation
    • Vinod GroverMahesh Ravishankar
    • G06T1/60G06F9/44G06F9/45
    • G06T1/60G06F8/34G06F8/4434
    • Various disclosed embodiments are directed to methods and systems for reducing memory space in sequential computer-implemented operations. The method includes generating a directed acyclic graph (DAG) having a plurality of vertices and directed edges, wherein each edge connects a predecessor vertex to a successor vertex. Each vertex represents one of the computer-implemented operations and each directed edge represents output data generated by the operations. The method includes merging one of the predecessor vertex with one of the successor vertex by combining the operations of the predecessor vertex and the successor vertex if the predecessor and successor vertices are connected by a directed edge and there is only one directed edge originating from the predecessor vertex. The merger of the predecessor and the successor vertices reduces the number of directed edges in the DAG, resulting in a reduction of intermediate buffer memory required to store the output data.
    • 各种公开的实施例涉及用于在顺序的计算机实现的操作中减少存储空间的方法和系统。 该方法包括生成具有多个顶点和定向边缘的有向非循环图(DAG),其中每个边缘将前导顶点连接到后继顶点。 每个顶点表示计算机实现的操作之一,每个有向边代表由操作产生的输出数据。 该方法包括通过将前导顶点和后继顶点的操作通过组合前导顶点和后继顶点的操作通过有向边连接并且仅有一个源自前导的有向边的方式将前导顶点之一与后继顶点之一合并 顶点。 前导和后继顶点的合并减少了DAG中的有向边的数量,导致存储输出数据所需的中间缓冲存储器的减少。
    • 4. 发明申请
    • METHODS FOR REDUCING MEMORY SPACE IN SEQUENTIAL OPERATIONS USING DIRECTED ACYCLIC GRAPHS
    • 使用方向图的顺序操作减少记忆空间的方法
    • US20150212933A1
    • 2015-07-30
    • US14165789
    • 2014-01-28
    • Nvidia Corporation
    • Vinod GroverMahesh Ravishankar
    • G06F12/02G06T1/60
    • G06T1/60G06F8/34G06F8/4434
    • Various disclosed embodiments are directed to methods and systems for reducing memory space in sequential computer-implemented operations. The method includes generating a directed acyclic graph (DAG) having a plurality of vertices and directed edges, wherein each edge connects a predecessor vertex to a successor vertex. Each vertex represents one of the computer-implemented operations and each directed edge represents output data generated by the operations. The method includes merging one of the predecessor vertex with one of the successor vertex by combining the operations of the predecessor vertex and the successor vertex if the predecessor and successor vertices are connected by a directed edge and there is only one directed edge originating from the predecessor vertex. The merger of the predecessor and the successor vertices reduces the number of directed edges in the DAG, resulting in a reduction of intermediate buffer memory required to store the output data.
    • 各种公开的实施例涉及用于在顺序的计算机实现的操作中减少存储空间的方法和系统。 该方法包括生成具有多个顶点和定向边缘的有向非循环图(DAG),其中每个边缘将前导顶点连接到后继顶点。 每个顶点表示计算机实现的操作之一,每个有向边代表由操作产生的输出数据。 该方法包括通过组合前导顶点和后继顶点的操作,将前导顶点之一与后继顶点之一合并,如果前导和后继顶点通过有向边连接,并且只有一个源自前导的有向边 顶点。 前导和后继顶点的合并减少了DAG中的有向边的数量,导致存储输出数据所需的中间缓冲存储器的减少。