中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

11 records (took 0.017 seconds)

    DISTRIBUTING PROCESSING OF ARRAY BLOCK TASKS
    3.
    发明申请
    DISTRIBUTING PROCESSING OF ARRAY BLOCK TASKS 有权
    阵列任务的分布处理

    公开(公告)号：US20140282594A1

    公开(公告)日：2014-09-18

    申请号：US13799176

    申请日：2013-03-13

    Applicant: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.

    Inventor： Indrajit Roy ,  Erik Tamas Bodzsar ,  Robert Schreiber

    IPC: G06F9/54

    CPC classification number: G06F9/5066

    Abstract: A technique includes distributing a plurality of tasks among a plurality of worker nodes to perform a processing operation on an array. Each task is associated with a set of a least one data block of the array, and an order of the tasks is defined by an array-based programming language. Distribution of the tasks includes, for at least one of the worker nodes, selectively reordering the order defined by the array-based programming language to regulate an amount of data transferred to the worker node.

    Abstract translation: 一种技术包括在多个工作节点之间分配多个任务以对阵列执行处理操作。 每个任务与阵列的至少一个数据块的集合相关联，并且任务的顺序由基于阵列的编程语言定义。 任务的分布包括对于至少一个工作节点，选择性地重新排序由基于阵列的编程语言定义的顺序以调节传送到工作节点的数据量。

    LOAD-BALANCED SPARSE ARRAY PROCESSING
    4.
    发明申请
    LOAD-BALANCED SPARSE ARRAY PROCESSING 有权
    负载均衡SPARSE阵列处理

    公开(公告)号：US20140137134A1

    公开(公告)日：2014-05-15

    申请号：US13673702

    申请日：2012-11-09

    Applicant: HEWLETT-PACKARD DEVELOPMENT COMPANY, L.P.

    Inventor： Indrajit ROY ,  Shivaram Venkataraman ,  Alvin Auyoung ,  Robert Schreiber

    IPC: G06F9/46

    CPC classification number: G06F9/5083 ,  G06F9/5061

    Abstract: A sparse array is partitioned into first partitions and a second array is partitioned into second partitions based on an invariant relationship between the sparse array and the second array. The sparse array and the second array are associated with a computation involving the sparse array and the second array. The first partitions and the corresponding second partitions are distributed to workers. A different first partition and corresponding second partition is distributed to each of the workers. Third partitions of the sparse array and corresponding fourth partitions of the second array are determined based on the invariant relationship and measurements of load are received from each of the workers. At least one of the first partitions and the corresponding second partition is different from one of the third partitions and the corresponding fourth partition. The at least one of the first partitions and the corresponding second partition that is different is redistributed among the workers. A different third partition and corresponding fourth partition is executed by each of the workers.

    Abstract translation: 稀疏阵列被划分成第一分区，并且基于稀疏阵列和第二阵列之间的不变关系将第二阵列划分成第二分区。 稀疏阵列和第二个阵列与涉及稀疏阵列和第二个阵列的计算相关联。 第一个分区和相应的第二个分区分配给工作人员。 将不同的第一分区和相应的第二分区分配给每个工作者。 基于不变关系确定稀疏阵列的第三分区和第二阵列的相应的第四分区，并且从每个工人接收到负载的测量。 第一分区和对应的第二分区中的至少一个与第三分区和相应的第四分区之一不同。 第一分区中的至少一个和相应的不同的第二分区在工作者之间重新分配。 每个工人执行不同的第三分区和相应的第四分区。

    Distributing processing of array block tasks
    6.
    发明授权
    Distributing processing of array block tasks 有权
    数组块任务的分布处理

    公开(公告)号：US09189290B2

    公开(公告)日：2015-11-17

    申请号：US13799176

    申请日：2013-03-13

    Applicant: Hewlett-Packard Development Company, L.P.

    Inventor： Indrajit Roy ,  Erik Tamas Bodzsar ,  Robert Schreiber

    IPC: G06F9/46 ,  G06F9/50

    CPC classification number: G06F9/5066

    Abstract: A technique includes distributing a plurality of tasks among a plurality of worker nodes to perform a processing operation on an array. Each task is associated with a set of a least one data block of the array, and an order of the tasks is defined by an array-based programming language. Distribution of the tasks includes, for at least one of the worker nodes, selectively reordering the order defined by the array-based programming language to regulate an amount of data transferred to the worker node.

    Abstract translation: 一种技术包括在多个工作节点之间分配多个任务以对阵列执行处理操作。 每个任务与阵列的至少一个数据块的集合相关联，并且任务的顺序由基于阵列的编程语言定义。 任务的分布包括对于至少一个工作节点，选择性地重新排序由基于阵列的编程语言定义的顺序以调节传送到工作节点的数据量。

    Load-balanced sparse array processing
    7.
    发明授权
    Load-balanced sparse array processing 有权
    负载平衡稀疏阵列处理

    公开(公告)号：US09411657B2

    公开(公告)日：2016-08-09

    申请号：US13673702

    申请日：2012-11-09

    Applicant: Hewlett-Packard Development Company, L.P.

    Inventor： Indrajit Roy ,  Shivaram Venkataraman ,  Alvin Auyoung ,  Robert Schreiber

    IPC: G06F9/46 ,  G06F9/50

    CPC classification number: G06F9/5083 ,  G06F9/5061

    Abstract: A sparse array is partitioned into first partitions and a second array is partitioned into second partitions based on an invariant relationship between the sparse array and the second array. The sparse array and the second array are associated with a computation involving the sparse array and the second array. The first partitions and the corresponding second partitions are distributed to workers. A different first partition and corresponding second partition is distributed to each of the workers. Third partitions of the sparse array and corresponding fourth partitions of the second array are determined based on the invariant relationship and measurements of load are received from each of the workers. At least one of the first partitions and the corresponding second partition is different from one of the third partitions and the corresponding fourth partition. The at least one of the first partitions and the corresponding second partition that is different is redistributed among the workers. A different third partition and corresponding fourth partition is executed by each of the workers.

    Abstract translation: 稀疏阵列被划分成第一分区，并且基于稀疏阵列和第二阵列之间的不变关系将第二阵列划分成第二分区。 稀疏阵列和第二个阵列与涉及稀疏阵列和第二个阵列的计算相关联。 第一个分区和相应的第二个分区分配给工作人员。 将不同的第一分区和相应的第二分区分配给每个工作者。 基于不变关系确定稀疏阵列的第三分区和第二阵列的相应的第四分区，并且从每个工人接收到负载的测量。 第一分区和对应的第二分区中的至少一个与第三分区和相应的第四分区之一不同。 第一分区中的至少一个和相应的不同的第二分区在工作者之间重新分配。 每个工人执行不同的第三分区和相应的第四分区。

Patent Agency Ranking