TECHNIQUES FOR PERFORMING MATRIX COMPUTATIONS USING HIERARCHICAL REPRESENTATIONS OF SPARSE MATRICES

    公开(公告)号:US20220374961A1

    公开(公告)日:2022-11-24

    申请号:US17325116

    申请日:2021-05-19

    Abstract: One embodiment sets forth a technique for performing matrix operations. The technique includes traversing a tree structure to access one or more non-empty regions within a matrix. The tree structure includes a first plurality of nodes and a second plurality of nodes corresponding to non-empty regions in the matrix. The first plurality of nodes includes a first node representing a first region and one or more second nodes that are children of the first node and represent second region(s) with an equal size formed within the first region. The second plurality of nodes include a third node representing a third region and one or more fourth nodes that are children of the third node and represent fourth region(s) with substantially equal numbers of non-zero matrix values formed within the third region. The technique also includes performing matrix operation(s) based on the non-empty region(s) to generate a matrix operation result.

    Memory page access instrumentation

    公开(公告)号:US12141451B2

    公开(公告)日:2024-11-12

    申请号:US18163167

    申请日:2023-02-01

    Abstract: Embodiments of the present disclosure relate to memory page access instrumentation for generating a memory access profile. The memory access profile may be used to co-locate data near the processing unit that accesses the data, reducing memory access energy by minimizing distances to access data that is co-located with a different processing unit (i.e., remote data). Execution thread arrays and memory pages for execution of a program are partitioned across multiple processing units. The partitions are then each mapped to a specific processing unit to minimize inter-partition traffic given the processing unit physical topology.

    COMBINED ON-PACKAGE AND OFF-PACKAGE MEMORY SYSTEM

    公开(公告)号:US20220342595A1

    公开(公告)日:2022-10-27

    申请号:US17237165

    申请日:2021-04-22

    Abstract: A combined on-package and off-package memory system uses a custom base-layer within which are fabricated one or more dedicated interfaces to off-package memories. An on-package processor and on-package memories are also directly coupled to the custom base-layer. The custom base-layer includes memory management logic between the processor and memories (both off and on package) to steer requests. The memories are exposed as a combined memory space having greater bandwidth and capacity compared with either the off-package memories or the on-package memories alone. The memory management logic services requests while maintaining quality of service (QoS) to satisfy bandwidth requirements for each allocation. An allocation may include any combination of the on and/or off package memories. The memory management logic also manages data migration between the on and off package memories.

    COMPUTATION OFFLOAD REQUESTS WITH DENIAL RESPONSE

    公开(公告)号:US20240281300A1

    公开(公告)日:2024-08-22

    申请号:US18528333

    申请日:2023-12-04

    CPC classification number: G06F9/5083 G06F9/542 G06F2209/509

    Abstract: An initiating processing tile generates an offload request that may include a processing tile ID, source data needed for the computation, program counter, and destination location where the computation result is stored. The offload processing tile may execute the offloaded computation. Alternatively, the offload processing tile may deny the offload request based on congestion criteria. The congestion criteria may include a processing workload measure, whether a resource needed to perform the computation is available, and an offload request buffer fullness. In an embodiment, the denial message that is returned to the initiating processing tile may include the data needed to perform the computation (read from the local memory of the offload processing tile). Returning the data with the denial message results in the same inter-processing tile traffic that would occur if no attempt to offload the computation were initiated.

    MEMORY PAGE ACCESS INSTRUMENTATION
    7.
    发明公开

    公开(公告)号:US20240256153A1

    公开(公告)日:2024-08-01

    申请号:US18163167

    申请日:2023-02-01

    CPC classification number: G06F3/0625 G06F3/0644 G06F3/0659 G06F3/0673

    Abstract: Embodiments of the present disclosure relate to memory page access instrumentation for generating a memory access profile. The memory access profile may be used to co-locate data near the processing unit that accesses the data, reducing memory access energy by minimizing distances to access data that is co-located with a different processing unit (i.e., remote data). Execution thread arrays and memory pages for execution of a program are partitioned across multiple processing units. The partitions are then each mapped to a specific processing unit to minimize inter-partition traffic given the processing unit physical topology.

    Techniques for generating and processing hierarchical representations of sparse matrices

    公开(公告)号:US11709812B2

    公开(公告)日:2023-07-25

    申请号:US17325133

    申请日:2021-05-19

    Abstract: One embodiment sets forth a technique for generating a tree structure within a computer memory for storing sparse data. The technique includes dividing a matrix into a first plurality of equally sized regions. The technique also includes dividing at least one region in the first plurality of regions into a second plurality of regions, where the second plurality of regions includes a first region and one or more second regions that have a substantially equal number of nonzero matrix values and are formed within the first region. The technique further includes creating the tree structure within the computer memory by generating a first plurality of nodes representing the first plurality of regions, generating a second plurality of nodes representing the second plurality of regions, and grouping, under a first node representing the first region, one or more second nodes representing the one or more second regions.

    Techniques for performing matrix computations using hierarchical representations of sparse matrices

    公开(公告)号:US12211080B2

    公开(公告)日:2025-01-28

    申请号:US17325116

    申请日:2021-05-19

    Abstract: One embodiment sets forth a technique for performing matrix operations. The technique includes traversing a tree structure to access one or more non-empty regions within a matrix. The tree structure includes a first plurality of nodes and a second plurality of nodes corresponding to non-empty regions in the matrix. The first plurality of nodes includes a first node representing a first region and one or more second nodes that are children of the first node and represent second region(s) with an equal size formed within the first region. The second plurality of nodes include a third node representing a third region and one or more fourth nodes that are children of the third node and represent fourth region(s) with substantially equal numbers of non-zero matrix values formed within the third region. The technique also includes performing matrix operation(s) based on the non-empty region(s) to generate a matrix operation result.

Patent Agency Ranking