知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

39 records (took 0.022 seconds)

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

    公开(公告)号：US08484649B2

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

    申请号：US12984909

    申请日：2011-01-05

    Applicant: Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Sujay S. Parekh ,  Deepak Rajan ,  Joel L. Wolf ,  Kun-Lung Wu

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

    IPC: G06F9/46

    CPC classification number: G06F9/4843

    Abstract: 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.

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

    Scheduling Mapreduce Jobs in the Presence of Priority Classes
    2.
    发明申请
    Scheduling Mapreduce Jobs in the Presence of Priority Classes 审中-公开
    在优先课程中安排Mapreduce工作

    公开(公告)号：US20120304186A1

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

    申请号：US13116378

    申请日：2011-05-26

    Applicant: Andrey Balmin ,  Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Deepak Rajan ,  Joel L. Wolf

    Inventor： Andrey Balmin ,  Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Deepak Rajan ,  Joel L. Wolf

    IPC: G06F9/46 ,  G06F9/50

    CPC classification number: G06F9/46 ,  G06F9/4881 ,  G06F9/50

    Abstract: Techniques for scheduling one or more MapReduce jobs in a presence of one or more priority classes are provided. The techniques include obtaining a preferred ordering for one or more MapReduce jobs, wherein the preferred ordering comprises one or more priority classes, prioritizing the one or more priority classes subject to one or more dynamic minimum slot guarantees for each priority class, and iteratively employing a MapReduce scheduler, once per priority class, in priority class order, to optimize performance of the one or more MapReduce jobs.

    Abstract translation: 提供了在存在一个或多个优先级类别的情况下调度一个或多个MapReduce作业的技术。 这些技术包括获得一个或多个MapReduce作业的优选顺序，其中优选顺序包括一个或多个优先级等级，对于每个优先级类别，受限于一个或多个动态最小时隙保证的一个或多个优先级类别进行优先级排序，并迭代地使用 MapReduce调度程序每优先级一次，按优先级顺序排列，以优化一个或多个MapReduce作业的性能。

    METHOD AND SYSTEM FOR PREDICTING RESOURCE USAGE OF REUSABLE STREAM PROCESSING ELEMENTS
    4.
    发明申请
    METHOD AND SYSTEM FOR PREDICTING RESOURCE USAGE OF REUSABLE STREAM PROCESSING ELEMENTS 有权
    用于预测资源使用可回收流程处理元素的方法和系统

    公开(公告)号：US20090119238A1

    公开(公告)日：2009-05-07

    申请号：US11935079

    申请日：2007-11-05

    Applicant: Lisa Amini ,  Henrique Andrade ,  Wei Fan ,  James R. Giles ,  Kirsten W. Hildrum ,  Deepak Rajan ,  Deepak S. Turaga ,  Rohit Wagle ,  Joel L. Wolf ,  Philip S. Yu

    Inventor： Lisa Amini ,  Henrique Andrade ,  Wei Fan ,  James R. Giles ,  Kirsten W. Hildrum ,  Deepak Rajan ,  Deepak S. Turaga ,  Rohit Wagle ,  Joel L. Wolf ,  Philip S. Yu

    IPC: G06N5/04

    CPC classification number: G06N99/005

    Abstract: A method is provided for generating a resource function estimate of resource usage by an instance of a processing element configured to consume zero or more input data streams in a stream processing system having a set of available resources that comprises receiving at least one specified performance metric for the zero or more input data streams and a processing power of the set of available resources, wherein one specified performance metric is stream rate; generating a multi-part signature of executable-specific information for the processing element and a multi-part signature of context-specific information for the instance; accessing a database of resource functions to identify a static resource function corresponding to the executable-specific information and a context-dependent resource function corresponding to the context-specific information; combining the static resource function and the context-dependent resource function to form a composite resource function for the instance; and applying the resource function to the at least one specified performance metric and the processing power to generate the resource function estimate of the at least one specified performance metric for processing by the instance.

    Abstract translation: 提供了一种用于通过被配置为在具有一组可用资源的流处理系统中消耗零个或多个输入数据流的处理元件的实例来生成资源使用的资源功能估计的方法，所述流处理系统包括：一组可用资源，其包括接收至少一个指定的性能度量 零个或多个输入数据流和可用资源集合的处理能力，其中一个指定的性能度量是流速率; 生成用于处理元件的可执行特定信息的多部分签名和该实例的上下文特定信息的多部分签名; 访问资源功能的数据库以识别与所述可执行特定信息相对应的静态资源功能以及与所述上下文特定信息相对应的与上下文相关的资源功能; 结合静态资源功能和上下文相关资源功能，形成实例的复合资源功能; 以及将所述资源功能应用于所述至少一个指定的性能度量和所述处理能力以生成所述至少一个指定的性能度量的所述资源功能估计，以供所述实例处理。

    Interactive Capacity Planning
    6.
    发明申请
    Interactive Capacity Planning 失效
    互动容量规划

    公开(公告)号：US20110191759A1

    公开(公告)日：2011-08-04

    申请号：US12697624

    申请日：2010-02-01

    Applicant: Henrique Andrade ,  Bugra Gedik ,  Andrew L. Frenkiel ,  Rohit M. Khandekar ,  Joel L. Wolf ,  Kun-Lung Wu

    Inventor： Henrique Andrade ,  Bugra Gedik ,  Andrew L. Frenkiel ,  Rohit M. Khandekar ,  Joel L. Wolf ,  Kun-Lung Wu

    IPC: G06F9/45

    Abstract: Techniques for performing capacity planning for applications running on a computational infrastructure are provided. The techniques include instrumenting an application under development to receive one or more performance metrics under a physical deployment plan, receiving the one or more performance metrics from the computational infrastructure hosting one or more applications that are currently running, using a predictive inference engine to determine how the application under development can be deployed, and using the determination to perform capacity planning for the applications on the computational infrastructure.

    Abstract translation: 提供了在计算基础设施上运行的应用程序执行容量规划的技术。 这些技术包括对开发中的应用进行检测，以在物理部署计划下接收一个或多个性能指标，从托管一个或多个当前运行的应用的计算基础设施接收一个或多个性能指标，使用预测推理机来确定 可以部署正在开发的应用程序，并使用确定来对计算基础设施上的应用程序进行容量规划。

    METHOD, APPARATUS, AND COMPUTER PROGRAM PRODUCT FOR SCHEDULING WORK IN A STREAM-ORIENTED COMPUTER SYSTEM WITH CONFIGURABLE NETWORKS
    7.
    发明申请
    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

    Applicant: Nikhil Bansal ,  Kirsten W. Hildrum ,  James Giles ,  Deepak Rajan ,  Philippe L. Seto ,  Eugen Schenfeld ,  Rohit Wagle ,  Joel L. Wolf ,  Xiaolan J. Zhang

    Inventor： 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 classification number: G06F9/5066 ,  G06F9/4881 ,  G06F2209/483 ,  H04L67/325

    Abstract: 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.

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

    Method and apparatus for web farm traffic control
    10.
    发明授权
    Method and apparatus for web farm traffic control 失效
    网络农场交通管制的方法和装置

    公开(公告)号：US07356592B2

    公开(公告)日：2008-04-08

    申请号：US10057516

    申请日：2002-01-24

    Applicant: Joel L. Wolf ,  Philip S. Yu

    Inventor： Joel L. Wolf ,  Philip S. Yu

    IPC: G06F15/173 ,  G06F15/16

    CPC classification number: H04L67/1006 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1023 ,  H04L67/327 ,  H04L2029/06054

    Abstract: Disclosed is a method for controlling a web farm having a plurality of websites and servers, the method comprising categorizing customer requests received from said websites into a plurality of categories, said categories comprising a shareable customer requests and unshareable customer requests, routing said shareable customer requests such that any of said servers may process shareable customer requests received from different said websites, and routing said unshareable customer requests from specific said websites only to specific servers to which said specific websites have been assigned.

    Abstract translation: 公开了一种用于控制具有多个网站和服务器的网络农场的方法，所述方法包括将从所述网站接收的客户请求分类为多个类别，所述类别包括可共享的客户请求和不可客户的客户请求，路由所述可共享的客户请求 使得任何所述服务器可以处理从不同的所述网站接收到的可共享的客户请求，并且将来自特定的所述网站的所述不可共享的客户请求仅路由到已经分配了所述特定网站的特定服务器。

Patent Agency Ranking