中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

8 records (took 0.016 seconds)

    DATA TRANSFER REQUESTS WITH DATA TRANSFER POLICIES
    1.
    发明申请
    DATA TRANSFER REQUESTS WITH DATA TRANSFER POLICIES 有权
    数据传输要求与数据传输政策

    公开(公告)号：US20160197988A1

    公开(公告)日：2016-07-07

    申请号：US14590570

    申请日：2015-01-06

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

    Inventor： Shreya Prasad ,  Indrajit Roy ,  Vincent Xu ,  Sunil Venkayala ,  Dan Huang ,  Kyungyong Lee

    IPC: H04L29/08 ,  G06F17/30

    CPC classification number: G06F17/30584 ,  G06F17/30569 ,  H04L67/1014 ,  H04L67/1097 ,  Y10S707/964

    Abstract: A method, system, and computer-readable storage device for transferring data from a database management system to a data analytics system is described herein. In one aspect, a database management node storing a data partition of a database table that is distributed across a plurality of database management nodes of a database management system receives a data transfer request from a data analytics node of a data analytics node cluster. The data transfer request may include a data transfer policy for splitting the data partition onto the data analytics node cluster. A data split may be identified from the data partition. The data split may be a subset of the data partition. The data split is communicated to the data analytics node according to the data transfer policy.

    Abstract translation: 本文描述了用于将数据从数据库管理系统传送到数据分析系统的方法，系统和计算机可读存储设备。 一方面，存储分布在数据库管理系统的多个数据库管理节点上的数据库表的数据分区的数据库管理节点从数据分析节点集群的数据分析节点接收数据传送请求。 数据传输请求可以包括用于将数据分区分割到数据分析节点簇上的数据传输策略。 可以从数据分区识别数据分割。 数据分割可以是数据分区的子集。 数据分割根据数据传输策略传送到数据分析节点。

    Distributing processing of array block tasks
    2.
    发明授权
    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: 一种技术包括在多个工作节点之间分配多个任务以对阵列执行处理操作。 每个任务与阵列的至少一个数据块的集合相关联，并且任务的顺序由基于阵列的编程语言定义。 任务的分布包括对于至少一个工作节点，选择性地重新排序由基于阵列的编程语言定义的顺序以调节传送到工作节点的数据量。

    ALLOCATING AND SHARING A DATA OBJECT AMONG PROGRAM INSTANCES
    3.
    发明申请
    ALLOCATING AND SHARING A DATA OBJECT AMONG PROGRAM INSTANCES 审中-公开
    在计划实施中分配和共享数据对象

    公开(公告)号：US20140289739A1

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

    申请号：US13847717

    申请日：2013-03-20

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

    Inventor： Erik Tamas Bodzsar ,  Indrajit Roy

    IPC: G06F9/54

    CPC classification number: G06F9/544 ,  G06F9/5016 ,  G06F12/0253 ,  G06F12/0284 ,  G06F2209/542 ,  G06F2212/1024 ,  G06F2212/1044 ,  G06F2212/1048

    Abstract: A memory has a shared data object containing shared data for a plurality of program instances. An allocation routine allocates a respective memory region corresponding to the shared data object to each of the plurality of program instances, where each of the memory regions contains a header part and a data part, where the data part corresponds to the shared data and the header part contains information relating to the data part, and the header part is private to the corresponding program instance. The allocation routine maps the shared data to the memory regions using a mapping technique that avoids copying the shared data to each of the data parts as part of allocating the corresponding memory region.

    Abstract translation: 存储器具有包含用于多个程序实例的共享数据的共享数据对象。 分配例程将与共享数据对象相对应的各个存储区域分配给多个程序实例中的每一个，其中每个存储器区域包含头部部分和数据部分，其中数据部分对应于共享数据和头部 部分包含与数据部分有关的信息，标题部分对相应的程序实例是私有的。 分配例程使用避免将共享数据复制到每个数据部分的映射技术将共享数据映射到存储器区域，作为分配对应的存储器区域的一部分。

    DISTRIBUTING PROCESSING OF ARRAY BLOCK TASKS
    6.
    发明申请
    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
    8.
    发明授权
    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