中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

62 records (took 0.029 seconds)

    Decision processing and information sharing in distributed computing environment
    2.
    发明授权
    Decision processing and information sharing in distributed computing environment 有权

    公开(公告)号：US10679136B2

    公开(公告)日：2020-06-09

    申请号：US14694326

    申请日：2015-04-23

    Applicant: International Business Machines Corporation

    Inventor： Swapna Buccapatnam Tirumala ,  Jian Tan ,  Li Zhang

    IPC: G06N7/00 ,  G06F9/44 ,  G06F9/445 ,  G06N3/00 ,  H04L12/24 ,  G06N20/00

    Abstract: A request arrival rate is obtained at a given computing node in a computing network comprising a plurality of distributed computing nodes. A topology of the computing network is determined at the given computing node so as to identify neighboring computing nodes with respect to the given computing node. A probability is computed at the given computing node based on the obtained request arrival rate and the detected network topology. The computed probability is used to select a decision from a set of decision candidates in response to a request received at the given computing node in a given time slot. The selected decision is a decision with a top average reward attributed thereto across the given computing node and the neighboring computing nodes determined based on information shared by the neighboring computing node with the given computing node.

    Restorable memory allocator
    3.
    发明授权
    Restorable memory allocator 有权

    公开(公告)号：US10592131B2

    公开(公告)日：2020-03-17

    申请号：US15795815

    申请日：2017-10-27

    Applicant: International Business Machines Corporation

    Inventor： Michel Hack ,  Xiaoqiao Meng ,  Jian Tan ,  Yandong Wang ,  Li Zhang

    IPC: G06F12/00 ,  G06F3/06 ,  G06F12/02

    Abstract: Various embodiments manage dynamic memory allocation data. In one embodiment, a set of memory allocation metadata is extracted from a memory heap space. Process dependent information and process independent information is identified from the set of memory allocation metadata based on the set of memory allocation metadata being extracted. The process dependent information and the process independent information at least identify a set of virtual memory addresses available in the memory heap space and a set of virtual memory addresses allocated to a process associated with the memory heap space. A set of allocation data associated with the memory heap space is stored in a persistent storage based on the process dependent information and the process independent information having been identified. The set of allocation data includes the process independent allocation information and a starting address associated with the memory heap space.

    STAGE-AWARE PERFORMANCE MODELING FOR COMPUTER CLUSTER SIZING
    6.
    发明申请
    STAGE-AWARE PERFORMANCE MODELING FOR COMPUTER CLUSTER SIZING 有权

    公开(公告)号：US20170123855A1

    公开(公告)日：2017-05-04

    申请号：US14928997

    申请日：2015-10-30

    Applicant: International Business Machines Corporation

    Inventor： Min Li ,  Valentina Salapura ,  Jian Tan ,  Yandong Wang ,  Li Zhang

    IPC: G06F9/50 ,  G06N7/00

    CPC classification number: G06F9/5055 ,  G06F9/5061 ,  G06F2209/501 ,  G06N3/12

    Abstract: A method, apparatus, and computer program product for configuring a computer cluster. Job information identifying a data processing job to be performed is received by a processor unit. The data processing job to be performed comprises a plurality of stages. Cluster information identifying a candidate computer cluster is also received by the processor unit. The processor unit identifies stage performance models for modeled stages that are similar to the plurality of stages. The processor unit predicts predicted stage performance times for performing the plurality of stages on the candidate computer cluster using the stage performance models and combines the predicted stage performance times for the plurality of stages to determine a predicted job performance time. The predicted job performance time may be used to configure the computer cluster.

    Resource bottleneck identification for multi-stage workflows processing
    7.
    发明授权
    Resource bottleneck identification for multi-stage workflows processing 有权
    多阶段工作流处理的资源瓶颈识别

    公开(公告)号：US09471375B2

    公开(公告)日：2016-10-18

    申请号：US14134833

    申请日：2013-12-19

    Applicant: International Business Machines Corporation

    Inventor： Parijat Dube ,  Xiaoqiao Meng ,  Jian Tan ,  Li Zhang

    IPC: G06F9/48 ,  G06F17/50

    CPC classification number: G06F9/4881 ,  G06F17/5009

    Abstract: Identifying resource bottleneck in multi-stage workflow processing may include identifying dependencies between logical stages and physical resources in a computing system to determine which logical stage involves what set of resources; for each of the identified dependencies, determining a functional relationship between a usage level of a physical resource and concurrency level of a logical stage; estimating consumption of the physical resources by each of the logical stages based on the functional relationship determined for each of the logical stages; and performing a predictive modeling based on the estimated consumption to determine a concurrency level at which said each of the logical stages will become bottleneck.

    Abstract translation: 识别多阶段工作流处理中的资源瓶颈可以包括在计算系统中识别逻辑级和物理资源之间的依赖关系，以确定哪个逻辑级涉及什么资源集合; 确定每个所识别的依赖性，确定物理资源的使用级别和逻辑级的并发级别之间的功能关系; 基于为每个逻辑级确定的功能关系来估计每个逻辑级的物理资源的消耗; 以及基于所估计的消耗来执行预测建模以确定所述每个逻辑级将成为瓶颈的并发级别。

    Joint optimization of multiple phases in large data processing
    9.
    发明授权
    Joint optimization of multiple phases in large data processing 有权
    大数据处理中多相联合优化

    公开(公告)号：US09342355B2

    公开(公告)日：2016-05-17

    申请号：US13922746

    申请日：2013-06-20

    Applicant: International Business Machines Corporation

    Inventor： Minghong Lin ,  Jian Tan ,  Li Zhang

    IPC: G06F9/46 ,  G06F9/48 ,  G06F9/50

    CPC classification number: G06F9/4881 ,  G06F9/5066

    Abstract: Methods and arrangements for task scheduling. A plurality of jobs is received, each job comprising at least a map phase, a copy/shuffle phase and a reduce phase. For each job, there are determined a map phase execution time and a copy/shuffle phase execution time. Each job is classified into at least one group based on at least one of: the determined map phase execution time and the determined copy/shuffle phase execution time. The plurality of jobs are executed via processor sharing, and the executing includes determining a similarity measure between jobs based on current job execution progress. Other variants and embodiments are broadly contemplated herein.

    Abstract translation: 任务调度的方法和安排。 接收多个作业，每个作业至少包括地图阶段，复制/混洗阶段和减少阶段。 对于每个作业，确定地图阶段执行时间和复制/混洗阶段执行时间。 基于所确定的映射阶段执行时间和所确定的复制/混洗阶段执行时间中的至少一个，将每个作业分类为至少一个组。 多个作业通过处理器共享执行，并且执行包括基于当前作业执行进度确定作业之间的相似性度量。 本文中广泛考虑了其他变型和实施例。

    DETECTION OF TIME POINTS TO VOLUNTARILY YIELD RESOURCES FOR CONTEXT SWITCHING
    10.
    发明申请
    DETECTION OF TIME POINTS TO VOLUNTARILY YIELD RESOURCES FOR CONTEXT SWITCHING 有权
    检测时间点对上下文切换的自愿资源

    公开(公告)号：US20150227394A1

    公开(公告)日：2015-08-13

    申请号：US14175675

    申请日：2014-02-07

    Applicant: International Business Machines Corporation

    Inventor： Alicia Elena Chin ,  Yonggang Hu ,  Zhenhua Hu ,  Shicong Meng ,  Xiaoqiao Meng ,  Jian Tan ,  Li Zhang

    IPC: G06F9/50

    CPC classification number: G06F9/5016 ,  G06F9/5066

    Abstract: Methods and arrangements for yielding resources in data processing. At least one job is received, each job comprising a dependee set of tasks and a depender set of at least one task, and the at least one of the dependee set of tasks is executed. At least one resource of the at least one of the dependee set of tasks is yielded upon detection of resource underutilization in at least one other location. Other variants and embodiments are broadly contemplated herein. Other variants and embodiments are broadly contemplated herein.

    Abstract translation: 在数据处理中产生资源的方法和安排。 接收到至少一个作业，每个作业包括一个从属任务集合和至少一个任务的依赖集合，并且执行所述至少一个任务的任务集合。 在至少一个其他位置检测到资源利用不足时，至少一个任务的至少一个的至少一个资源被产生。 本文中广泛考虑了其他变型和实施例。 本文中广泛考虑了其他变型和实施例。

Patent Agency Ranking