利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

34 条记录 (耗时 0.018 秒)

    Determining operator partitioning constraint feasibility
    1.
    发明授权
    Determining operator partitioning constraint feasibility 有权
    确定运算符分区约束的可行性

    公开(公告)号：US08806510B2

    公开(公告)日：2014-08-12

    申请号：US12556931

    申请日：2009-09-10

    申请人： Henrique Andrade ,  Bugra Gedik ,  Kirsten Weale Hildrum ,  Rohit Madhukar Khandekar ,  Sujay Sunil Parekh ,  Deepak Rajan ,  Joel Leonard Wolf ,  Kun-Lung Wu

    发明人： Henrique Andrade ,  Bugra Gedik ,  Kirsten Weale Hildrum ,  Rohit Madhukar Khandekar ,  Sujay Sunil Parekh ,  Deepak Rajan ,  Joel Leonard Wolf ,  Kun-Lung Wu

    IPC分类号： G06F3/00 ,  G06F9/44 ,  G06F9/46 ,  G06F13/00

    CPC分类号： G06F9/5066

    摘要： Techniques for determining feasibility of a set of one or more operator partitioning constraints are provided. The techniques include receiving one or more sets of operator partitioning constraints, wherein each set of one or more constraints define one or more desired conditions for grouping together of operators into partitions and placing partitions on hosts, wherein each operator is embodied as software that performs a particular function, processing each set of one or more operator partitioning constraints to determine feasibility of each set of one or more operator partitioning constraints, creating and outputting one or more candidate partitions and one or more host placements for each set of feasible partitioning constraints, and creating and outputting a certificate of infeasibility for each set of infeasible partitioning constraints, wherein the certificate of infeasibility outlines one or more reasons for infeasibility.

    摘要翻译： 提供了用于确定一组或多个操作者分区约束的可行性的技术。 这些技术包括接收一组或多组运算符分配约束，其中每组一个或多个约束定义一个或多个期望条件，用于将运算符分组到分区中并在主机上放置分区，其中每个运算符被实施为执行 特定功能，处理每组一个或多个运营商划分约束以确定每组一个或多个运营商分区约束的可行性，为每组可行分区约束创建和输出一个或多个候选分区和一个或多个主机布局，以及 创建和输出每组不可行分区约束的不可行性证书，其中不可行性证书概述了一个或多个不可行性的原因。

    METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR SCHEDULING WORK IN A STREAM-ORIENTED COMPUTER SYSTEM WITH CONFIGURABLE NETWORKS
    6.
    发明申请
    METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR SCHEDULING WORK IN A STREAM-ORIENTED COMPUTER SYSTEM WITH CONFIGURABLE NETWORKS 有权
    在具有可配置网络的面向流行的计算机系统中调度工作的方法，装置和计算机程序产品

    公开(公告)号：US20090241123A1

    公开(公告)日：2009-09-24

    申请号：US12052836

    申请日：2008-03-21

    申请人： Nikhil Bansal ,  Kirsten W. Hildrum ,  James Giles ,  Deepak Rajan ,  Philippe L. Seto ,  Eugen Schenfeld ,  Rohit Wagle ,  Joel L. Wolf ,  Xiaolan J. Zhang

    发明人： Nikhil Bansal ,  Kirsten W. Hildrum ,  James Giles ,  Deepak Rajan ,  Philippe L. Seto ,  Eugen Schenfeld ,  Rohit Wagle ,  Joel L. Wolf ,  Xiaolan J. Zhang

    IPC分类号： G06F9/50

    CPC分类号： G06F9/5066 ,  G06F9/4881 ,  G06F2209/483 ,  H04L67/325

    摘要： A method, apparatus, and computer program product for scheduling stream-based applications in a distributed computer system with configurable networks are provided. The method includes choosing, at a highest temporal level, jobs that will run, an optimal template alternative for the jobs that will run, network topology, and candidate processing nodes for processing elements of the optimal template alternative for each running job to maximize importance of work performed by the system. The method further includes making, at a medium temporal level, fractional allocations and re-allocations of the candidate processing elements to the processing nodes in the system to react to changing importance of the work. The method also includes revising, at a lowest temporal level, the fractional allocations and re-allocations on a continual basis to react to burstiness of the work, and to differences between projected and real progress of the work.

    摘要翻译： 提供了一种用于在具有可配置网络的分布式计算机系统中调度基于流的应用的方法，装置和计算机程序产品。 该方法包括在最高时间级别选择将运行的作业，用于将运行的作业的最佳模板替代物，网络拓扑和候选处理节点，用于处理每个正在运行的作业的最佳模板替代物的元素以最大化重要性 系统执行的工作。 该方法还包括在中等时间级别将候选处理元件的分数分配和重新分配到系统中的处理节点，以对工作的不断变化的重要性作出反应。 该方法还包括在最低时间级别修改分数分配和连续重新分配以对工作的突发性作出反应，以及对工作的预测和实际进展之间的差异进行修改。

    Scheduling Flows in a Multi-Platform Cluster Environment
    8.
    发明申请
    Scheduling Flows in a Multi-Platform Cluster Environment 有权
    在多平台集群环境中调度流程

    公开(公告)号：US20120304188A1

    公开(公告)日：2012-11-29

    申请号：US13116368

    申请日：2011-05-26

    申请人： Andrey Balmin ,  Anshul Dawra ,  Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Deepak Rajan ,  Joel L. Wolf

    发明人： Andrey Balmin ,  Anshul Dawra ,  Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Deepak Rajan ,  Joel L. Wolf

    IPC分类号： G06F9/46

    CPC分类号： G06F9/52 ,  G06F9/5016 ,  G06F9/5077 ,  G06F2209/5014 ,  G06F2209/504 ,  Y02D10/22

    摘要： Techniques for scheduling multiple flows in a multi-platform cluster environment are provided. The techniques include partitioning a cluster into one or more platform containers associated with one or more platforms in the cluster, scheduling one or more flows in each of the one or more platform containers, wherein the one or more flows are created as one or more flow containers, scheduling one or more individual jobs into the one or more flow containers to create a moldable schedule of one or more jobs, flows and platforms, and automatically converting the moldable schedule into a malleable schedule.

    摘要翻译： 提供了在多平台集群环境中调度多个流的技术。 这些技术包括将集群划分成与集群中的一个或多个平台相关联的一个或多个平台容器，调度一个或多个平台容器中的每个平台容器中的一个或多个流，其中，一个或多个流被创建为一个或多个流 容器，将一个或多个单独作业调度到所述一个或多个流动容器中，以创建一个或多个作业，流动和平台的可模制计划，以及将可模制计划自动转换成可延展的计划。

    Amortizing costs of shared scans
    10.
    发明授权
    Amortizing costs of shared scans 失效
    摊销共享扫描成本

    公开(公告)号：US08484649B2

    公开(公告)日：2013-07-09

    申请号：US12984909

    申请日：2011-01-05

    申请人： Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Sujay S. Parekh ,  Deepak Rajan ,  Joel L. Wolf ,  Kun-Lung Wu

    发明人： Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Sujay S. Parekh ,  Deepak Rajan ,  Joel L. Wolf ,  Kun-Lung Wu

    IPC分类号： G06F9/46

    CPC分类号： G06F9/4843

    摘要： Techniques for scheduling a plurality of jobs sharing input are provided. The techniques include partitioning one or more input datasets into multiple subcomponents, analyzing a plurality of jobs to determine which of the plurality of jobs require scanning of one or more common subcomponents of the one or more input datasets, and scheduling a plurality of jobs that require scanning of one or more common subcomponents of the one or more input datasets, facilitating a single scanning of the one or more common subcomponents to be used as input by each of the plurality of jobs.

    摘要翻译： 提供了用于调度多个作业共享输入的技术。 这些技术包括将一个或多个输入数据集划分成多个子组件，分析多个作业以确定多个作业中的哪个作业需要扫描一个或多个输入数据集的一个或多个公共子组件，以及调度需要 扫描所述一个或多个输入数据集中的一个或多个通用子部件，便于对所述一个或多个公共子部件进行单次扫描以用作多个作业中的每个作业的输入。