利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

78 条记录 (耗时 0.028 秒)

    Automated deployment of applications with tenant-isolation requirements
    44.
    发明授权
    Automated deployment of applications with tenant-isolation requirements 有权
    自动部署具有租户隔离要求的应用程序

    公开(公告)号：US09104514B2

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

    申请号：US13004402

    申请日：2011-01-11

    申请人： Andrew James Frederick Bravery ,  Arun Kwangil Iyengar ,  Aaron Edward Kasman ,  Thomas Arthur Mikalsen ,  Isabelle M. Rouvellou

    发明人： Andrew James Frederick Bravery ,  Arun Kwangil Iyengar ,  Aaron Edward Kasman ,  Thomas Arthur Mikalsen ,  Isabelle M. Rouvellou

    IPC分类号： G06F9/445 ,  G06F9/50 ,  G06F9/455 ,  G06F21/53

    CPC分类号： G06F8/60 ,  G06F9/45504 ,  G06F9/45533 ,  G06F9/45537 ,  G06F9/5077 ,  G06F21/53

    摘要： An embodiment of the invention provides a method for multi-tenant enabling a service, where the service includes a plurality of service components. Rules are received from a provider of the service, wherein the rules include rules for isolating the service components and rules for sharing the service components. The service components are matched with virtualization environments and/or physical environments based on the rules. The virtualization environments include at least one isolation container and/or at least one shared container. The service components are stored in the virtualization environments and/or the physical environments based on the matching. The service components are mapped to the at least one isolation container of the virtualization environments, the at least one shared container of the virtualization environments, and/or the physical environments based on the storing of the service components.

    摘要翻译： 本发明的实施例提供了一种用于多租户启用服务的方法，其中服务包括多个服务组件。 从服务提供商接收规则，其中规则包括用于隔离服务组件的规则和用于共享服务组件的规则。 服务组件与虚拟化环境和/或基于规则的物理环境匹配。 虚拟化环境包括至少一个隔离容器和/或至少一个共享容器。 服务组件基于匹配存储在虚拟化环境和/或物理环境中。 服务组件被映射到虚拟化环境的至少一个隔离容器，虚拟化环境的至少一个共享容器和/或基于服务组件的存储的物理环境。

    Method and apparatus for determining resources consumed by tasks
    45.
    发明授权
    Method and apparatus for determining resources consumed by tasks 有权
    用于确定任务消耗的资源的方法和装置

    公开(公告)号：US08863144B2

    公开(公告)日：2014-10-14

    申请号：US12723914

    申请日：2010-03-15

    申请人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich M. Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

    发明人： Arun Kwangil Iyengar ,  Hongbo Jiang ,  Erich M. Nahum ,  Wolfgang Segmuller ,  Asser Nasreldin Tantawi ,  Charles P. Wright

    IPC分类号： G06F9/46 ,  G06F15/173 ,  G06F9/50

    CPC分类号： G06F9/46 ,  G06F9/505 ,  G06F2209/501 ,  G06F2209/5019 ,  H04L67/1008

    摘要： In a computer system comprising a plurality of computing devices wherein the plurality of computing devices processes a plurality of tasks and each task has a task type, a method for determining overheads associated with task types comprises the following steps. Overheads are estimated for a plurality of task types. One of the plurality of computing devices is selected to execute one of the plurality of tasks, wherein the selection comprises estimating load on at least a portion of the plurality of computing devices from tasks assigned to at least a portion of the plurality of computing devices and the estimates of overheads of the plurality of task types. One or more of the estimates of overheads of the plurality of task types are varied.

    摘要翻译： 在包括多个计算设备的计算机系统中，其中所述多个计算设备处理多个任务，并且每个任务具有任务类型，用于确定与任务类型相关联的开销的方法包括以下步骤。 估计多个任务类型的开销。 选择多个计算设备中的一个来执行多个任务中的一个，其中所述选择包括从分配给所述多个计算设备的至少一部分的任务估计所述多个计算设备的至少一部分上的负载，以及 多个任务类型的开销的估计。 改变多个任务类型的开销的估计中的一个或多个。

    Systems and methods for processing compound requests by computing nodes in distributed and parrallel environments by assigning commonly occuring pairs of individual requests in compound requests to a same computing node
    46.
    发明授权
    Systems and methods for processing compound requests by computing nodes in distributed and parrallel environments by assigning commonly occuring pairs of individual requests in compound requests to a same computing node 失效
    通过将复合请求中的单个请求的共同发生对分配给相同的计算节点来处理分布式和副作用环境中的计算节点的复合请求的系统和方法

    公开(公告)号：US08661442B2

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

    申请号：US13118740

    申请日：2011-05-31

    申请人： Paul M. Dantzig ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

    发明人： Paul M. Dantzig ,  Arun Kwangil Iyengar ,  Francis Nicholas Parr ,  Gong Su

    IPC分类号： G06F9/46 ,  G06Q40/00

    CPC分类号： G06F9/5027 ,  G06F9/5044 ,  G06Q40/04

    摘要： Automated techniques are disclosed for minimizing communication between nodes in a system comprising multiple nodes for executing requests in which a request type is associated with a particular node. For example, a technique comprises the following steps. Information is maintained about frequencies of compound requests received and individual requests comprising the compound requests. For a plurality of request types which frequently occur in a compound request, the plurality of request types is associated to a same node.As another example, a technique for minimizing communication between nodes, in a system comprising multiple nodes for executing a plurality of applications, comprises the steps of maintaining information about an amount of communication between said applications, and using said information to place said applications on said nodes to minimize communication among said nodes.

    摘要翻译： 自动技术被公开用于最小化包括多个节点的系统中的节点之间的通信，用于执行其中请求类型与特定节点相关联的请求。 例如，技术包括以下步骤。 关于收到的复合请求的频率和包含复合请求的单个请求的信息被维护。 对于频繁出现在复合请求中的多个请求类型，多个请求类型与相同的节点相关联。 作为另一示例，在包括用于执行多个应用的​​多个节点的系统中的用于最小化节点之间的通信的技术包括以下步骤：维护关于所述应用之间的通信量的信息，并使用所述信息将所述应用放置在所述应用上 节点以最小化所述节点之间的通信。

    System and method for adaptively collecting performance and event information
    47.
    发明授权
    System and method for adaptively collecting performance and event information 失效
    自适应收集性能和事件信息的系统和方法

    公开(公告)号：US08645573B2

    公开(公告)日：2014-02-04

    申请号：US13433529

    申请日：2012-03-29

    申请人： Arun Kwangil Iyengar

    发明人： Arun Kwangil Iyengar

    IPC分类号： G06F15/16

    CPC分类号： G06F11/3466 ,  G06F11/3409

    摘要： Selective compression of data, wherein it is determined which of a number of compression algorithms do not incur an overhead that exceeds available resources. Then, one of the determined algorithms is selected to maximize compression.

    摘要翻译： 选择性压缩数据，其中确定多个压缩算法中的哪一个不会引起超出可用资源的开销。 然后，选择确定的算法之一以最大化压缩。

    System and method for adaptively collecting performance and event information
    48.
    发明授权
    System and method for adaptively collecting performance and event information 失效
    自适应收集性能和事件信息的系统和方法

    公开(公告)号：US08402130B2

    公开(公告)日：2013-03-19

    申请号：US12173502

    申请日：2008-07-15

    申请人： Arun Kwangil Iyengar

    发明人： Arun Kwangil Iyengar

    IPC分类号： G06F15/16

    CPC分类号： G06F11/3466 ,  G06F11/3409

    摘要： A method for communicating information from a first computing node to at least one of the following: a storage device and a second computing node. The first computing node is monitored to collect at least one estimate of available resources, and based on this estimate, an amount of data collected is modified. Then, the modified data is sent to at least one of the following: the storage device and the second computing node.

    摘要翻译： 一种用于将信息从第一计算节点传送到以下的至少一个的方法：存储设备和第二计算节点。 监视第一计算节点以收集至少一个可用资源的估计，并且基于该估计，修改收集的数据量。 然后，将修改的数据发送到以下至少一个：存储设备和第二计算节点。

    SYSTEM AND METHOD FOR ADAPTIVELY COLLECTING PERFORMANCE AND EVENT INFORMATION
    50.
    发明申请
    SYSTEM AND METHOD FOR ADAPTIVELY COLLECTING PERFORMANCE AND EVENT INFORMATION 审中-公开
    用于适应性收集性能和事件信息的系统和方法

    公开(公告)号：US20120209994A1

    公开(公告)日：2012-08-16

    申请号：US13433480

    申请日：2012-03-29

    申请人： Arun Kwangil Iyengar

    发明人： Arun Kwangil Iyengar

    IPC分类号： G06F15/173

    CPC分类号： G06F11/3466 ,  G06F11/3409

    摘要： Determination of an optimum batch size for aggregating data wherein, for a number of batch sizes, costs are estimated for sending batched information to persistent storage and for losing batched data. Then, the optimum batch size is selected from the number of different batch sizes based on sums of these costs.

    摘要翻译： 确定用于聚合数据的最佳批量大小，其中对于多个批量大小，估计用于将批量信息发送到持久存储器并丢失批量数据的成本。 然后，基于这些成本的总和，从不同批量大小的数量中选择最佳批量大小。