Merging totally ordered sets
    1.
    发明授权

    公开(公告)号:US11995105B2

    公开(公告)日:2024-05-28

    申请号:US17568924

    申请日:2022-01-05

    IPC分类号: G06F16/28 G06F7/16 G06F18/23

    CPC分类号: G06F16/285 G06F7/16 G06F18/23

    摘要: Methods and systems for software analysis include determining a similarity score for an ordered input set and at least one ordered cluster set that represents a distance between the ordered input set and the at least one ordered cluster set. It is determined that he ordered input is similar to a first cluster of the at least one ordered cluster set, based on the similarity score. The ordered input set is merged to the first cluster of the at least one cluster set to generate a merged set that preserves an ordering of the ordered input set and the first cluster. Software analysis is performed using the merged set.

    Integer matrix multiplication engine using pipelining

    公开(公告)号:US11880426B2

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

    申请号:US17878011

    申请日:2022-07-31

    IPC分类号: G06F17/16 G06F7/16

    CPC分类号: G06F7/16

    摘要: Techniques for data manipulation using integer matrix multiplication using pipelining are disclosed. A first integer matrix with dimensions m×k and a second integer matrix with dimensions k×n are obtained for matrix multiplication within a processor. The first and second integer matrices employ a two's complement variable radix point data representation. The first and second integer matrices are distilled into (j×j) submatrices. A first variable radix point format and an initial value for an accumulator register are configured dynamically. A first variable radix point format is configured dynamically for the first integer matrix and a second variable radix point format is configured dynamically for the second integer matrix. Multiply-accumulate operations are executed in a pipelined fashion on the (j×j) submatrices of the first integer matrix and the second integer matrix, where a third variable radix point format is configured for the result.

    COMPONENT ASSEMBLY SYSTEM AND METHOD USING INSPECTION INFORMATION

    公开(公告)号:US20170329874A1

    公开(公告)日:2017-11-16

    申请号:US15590128

    申请日:2017-05-09

    申请人: FANUC CORPORATION

    发明人: Kenjirou MORIMOTO

    摘要: A component assembly system and method, by which an optimum combination of components can be determined by using inspection information of each component. The system has: an inspection information reading section for reading first and second inspection information regarding assembling of first and second components; a component reserving section for reserving each component; a storing section for storing a relationship between the inspection information of each component and a reserve position of each component; a grouping section for providing at least one first and second groups respectively including the first and second components; a combination determining section for determining a combination of the first and second components on one-to-one correspondence, by using the first and second inspection information; and a component conveying device for conveying the first and second components corresponding to the determined combination from the component reserving section to an assembly device, by using the stored relationship.

    EFFICIENT MERGING AND FILTERING OF HIGH-VOLUME METRICS

    公开(公告)号:US20170364563A1

    公开(公告)日:2017-12-21

    申请号:US15184039

    申请日:2016-06-16

    IPC分类号: G06F17/30 G06F7/16

    摘要: The disclosed embodiments provide a system for processing data. During operation, the system obtains a set of records from a set of inputs, with each record containing an entity key, a partition key, and one or more attribute-value pairs. Next, the system sorts and indexes the records by the entity key for each partitioned input. The system then processes a query of the records by matching entity key values to the sorted and indexed records for each input partition in the query. Next, the system merges the subset of records with the same entity key values into records, with each merged record containing an entity key field and a single field that includes a list of attribute-value pairs from the subset. Finally, the system outputs the merged records in response to the query.

    Interoperable social services
    8.
    发明授权

    公开(公告)号:US09710565B2

    公开(公告)日:2017-07-18

    申请号:US14315692

    申请日:2014-06-26

    摘要: In a method for utilizing multiple social computing services of a user, a processor accesses a first networking service of a user and a second networking service of the user, wherein the first networking service includes a first group of contacts connected with the user and the second networking service includes a second group of contacts connected with the user. A processor retrieves the first group from the first networking service and the second group from the second networking service. A processor creates a set of contacts, wherein the set of contacts includes each contact of the first group of contacts with a corresponding link to information about that contact, and each contact of the second group of contacts with a corresponding link to information about that contact, and wherein a contact of the set of contacts has an associated relationship, established externally from either networking service, with the user.

    Compiler-level general matrix multiplication configuration optimization

    公开(公告)号:US11842178B2

    公开(公告)日:2023-12-12

    申请号:US17182753

    申请日:2021-02-23

    IPC分类号: G06F8/40 G06F8/41 G06F7/16

    CPC分类号: G06F8/443 G06F7/16 G06F8/447

    摘要: A system and method is provided for optimizing general matrix multiplication (GEMM) on target hardware by splitting matrices to be multiplied into tiles and formulating a tiling configuration search problem for matrices to be multiplied that explores a configuration search space to identify an optimal tiling configuration that minimizes running time on the target hardware for multiplication of matrices A (m×k) and B (k×n) on the target hardware for respective configuration states as a function of matrix parameters m, k, and n, and numbers of respective nested loops for each dimension m, k, and n, respectively. The optimal tiling configuration for the target hardware is obtained by implementing a Greedy Best-First-Search (GBFS) algorithm or a Neighborhood Actor Advantage Critic (N-A2C) algorithm that optimizes the running time for multiplication of the matrices on the target hardware, and the target hardware is configured and computations are run accordingly.