利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

85 条记录 (耗时 0.046 秒)

    PARTITIONING OPERATOR FLOW GRAPHS
    1.
    发明申请
    PARTITIONING OPERATOR FLOW GRAPHS 有权
    分区操作员流程图

    公开(公告)号：US20100325621A1

    公开(公告)日：2010-12-23

    申请号：US12489805

    申请日：2009-06-23

    申请人： Henrique Andrade ,  Bugra Gedik ,  Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Sunjay S. Parekh ,  Deepak Rajan ,  Joel L. Wolf ,  Kun-Lung Wu

    发明人： Henrique Andrade ,  Bugra Gedik ,  Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Sunjay S. Parekh ,  Deepak Rajan ,  Joel L. Wolf ,  Kun-Lung Wu

    IPC分类号： G06F9/45

    CPC分类号： G06F8/443 ,  G06F8/433 ,  G06F8/44

    摘要： Techniques for partitioning an operator flow graph are provided. The techniques include receiving source code for a steam processing application, wherein the source code comprises an operator flow graph, wherein the operator flow graph comprises a plurality of operators, receiving profiling data associated with the plurality of operators and one or more processing requirements of the operators, defining a candidate partition as a coalescing of one or more of the operators into one or more sets of processing elements (PEs), using the profiling data to create one or more candidate partitions of the processing elements, using the one or more candidate partitions to choose a desired partitioning of the operator flow graph, and compiling the source code into an executable code based on the desired partitioning.

    摘要翻译： 提供了划分操作员流程图的技术。 这些技术包括接收蒸汽处理应用的源代码，其中源代码包括操作者流程图，其中操作者流程图包括多个操作者，接收与多个操作者相关联的分析数据和一个或多个处理要求 运营商，使用所述分析数据，使用所述一个或多个候选者来创建一个或多个所述处理元件的候选分区，将候选分区定义为将一个或多个运算符合并为一组或多组处理元素（PE） 分区以选择操作员流图的期望分区，并且基于期望的分区将源代码编译成可执行代码。

    Partitioning operator flow graphs
    2.
    发明授权
    Partitioning operator flow graphs 有权
    分区操作员流程图

    公开(公告)号：US08490072B2

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

    申请号：US12489805

    申请日：2009-06-23

    申请人： Henrique Andrade ,  Bugra Gedik ,  Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Sunjay S. Parekh ,  Deepak Rajan ,  Joel L. Wolf ,  Kun-Lung Wu

    发明人： Henrique Andrade ,  Bugra Gedik ,  Kirsten W. Hildrum ,  Rohit M. Khandekar ,  Sunjay S. Parekh ,  Deepak Rajan ,  Joel L. Wolf ,  Kun-Lung Wu

    IPC分类号： G06F9/44 ,  G06F9/45

    CPC分类号： G06F8/443 ,  G06F8/433 ,  G06F8/44

    摘要： Techniques for partitioning an operator flow graph are provided. The techniques include receiving source code for a stream processing application, wherein the source code comprises an operator flow graph, wherein the operator flow graph comprises a plurality of operators, receiving profiling data associated with the plurality of operators and one or more processing requirements of the operators, defining a candidate partition as a coalescing of one or more of the operators into one or more sets of processing elements (PEs), using the profiling data to create one or more candidate partitions of the processing elements, using the one or more candidate partitions to choose a desired partitioning of the operator flow graph, and compiling the source code into an executable code based on the desired partitioning.

    摘要翻译： 提供了划分操作员流程图的技术。 所述技术包括接收流处理应用的源代码，其中所述源代码包括操作者流图，其中所述操作者流程图包括多个操作者，接收与所述多个操作者相关联的分析数据以及所述多个操作者的一个或多个处理要求 运营商，使用所述分析数据，使用所述一个或多个候选者来创建一个或多个所述处理元件的候选分区，将候选分区定义为将一个或多个运算符合并为一组或多组处理元素（PE） 分区以选择操作员流图的期望分区，并且基于期望的分区将源代码编译成可执行代码。

    Determining Operator Partitioning Constraint Feasibility
    3.
    发明申请
    Determining Operator Partitioning Constraint Feasibility 有权
    确定操作员分区约束可行性

    公开(公告)号：US20110061060A1

    公开(公告)日：2011-03-10

    申请号：US12556931

    申请日：2009-09-10

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

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

    IPC分类号： G06F9/46

    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.

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

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

    公开(公告)号：US20110191759A1

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

    申请号：US12697624

    申请日：2010-02-01

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

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

    IPC分类号： G06F9/45

    摘要： 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.

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

    Interactive capacity planning
    5.
    发明授权
    Interactive capacity planning 失效
    互动容量规划

    公开(公告)号：US08479181B2

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

    申请号：US12697624

    申请日：2010-02-01

    申请人： Henrique Andrade ,  Bugra Gedik ,  Andrew L. Frenkiel ,  Rohit M. Kandekar ,  Joel L. Wolf ,  Kun-Lung Wu

    发明人： Henrique Andrade ,  Bugra Gedik ,  Andrew L. Frenkiel ,  Rohit M. Kandekar ,  Joel L. Wolf ,  Kun-Lung Wu

    IPC分类号： G06F9/45

    摘要： 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.

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

    Determining operator partitioning constraint feasibility
    6.
    发明授权
    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 OF SELECTING AN EXPRESSION EVALUATION TECHNIQUE FOR DOMAIN-SPECIFIC LANGUAGE COMPILATION
    8.
    发明申请
    METHOD OF SELECTING AN EXPRESSION EVALUATION TECHNIQUE FOR DOMAIN-SPECIFIC LANGUAGE COMPILATION 失效
    选择特定语言编译的表达评估技术的方法

    公开(公告)号：US20110246972A1

    公开(公告)日：2011-10-06

    申请号：US12749947

    申请日：2010-03-30

    申请人： Henrique Andrade ,  Bugra Gedik ,  Mark Mendell ,  Howard W. Nasgaard ,  Kun-Lung Wu

    发明人： Henrique Andrade ,  Bugra Gedik ,  Mark Mendell ,  Howard W. Nasgaard ,  Kun-Lung Wu

    IPC分类号： G06F9/45

    CPC分类号： G06F9/45516 ,  G06F8/51

    摘要： A method and computer program product for selecting an expression evaluation technique for domain-specific language (DSL) compilation. An application written in DSL for a programming task is provided, the application including a plurality of components configured by expressions. A technique that most quickly implements the programming task is selected from a plurality of techniques for evaluating the expressions. The DSL application is compiled in accordance with the selected expression evaluation technique to generate general-purpose programming language (GPL) code.

    摘要翻译： 一种用于选择域特定语言（DSL）编译的表达评估技术的方法和计算机程序产品。 提供了一种用DSL编写的用于编程任务的应用程序，该应用程序包括由表达式配置的多个组件。 从用于评估表达式的多种技术中选择最快速地实现编程任务的技术。 DSL应用程序根据所选择的表达式评估技术进行编译，以生成通用编程语言（GPL）代码。

    PARTIAL FAULT TOLERANT STREAM PROCESSING APPLICATIONS
    9.
    发明申请
    PARTIAL FAULT TOLERANT STREAM PROCESSING APPLICATIONS 有权
    部分容错流程处理应用

    公开(公告)号：US20110239048A1

    公开(公告)日：2011-09-29

    申请号：US12748633

    申请日：2010-03-29

    申请人： HENRIQUE ANDRADE ,  Bugra Gedik ,  Gabriela Jacques da Silva ,  Kun-Lung Wu

    发明人： HENRIQUE ANDRADE ,  Bugra Gedik ,  Gabriela Jacques da Silva ,  Kun-Lung Wu

    IPC分类号： G06F11/28

    CPC分类号： G06F11/28 ,  G06F11/3612 ,  G06F11/3616

    摘要： In one embodiment, the invention comprises partial fault tolerant stream processing applications. One embodiment of a method for implementing partial fault tolerance in a stream processing application comprising a plurality of stream operators includes: defining a quality score function that expresses how well the application is performing quantitatively, injecting a fault into at least one of the plurality of operators, assessing an impact of the fault on the quality score function, and selecting at least one partial fault-tolerant technique for implementation in the application based on the quantitative metric-driven assessment.

    摘要翻译： 在一个实施例中，本发明包括部分容错流处理应用。 用于在包括多个流操作器的流处理应用中实现部分容错的方法的一个实施例包括：定义表示应用程序在定量上执行良好的质量得分函数，将故障注入多个操作符中的至少一个 评估故障对质量得分函数的影响，以及基于定量度量驱动评估，选择至少一种部分容错技术在应用中实现。