利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

63 条记录 (耗时 0.069 秒)

    PERFORMING COMPUTATIONS IN A DISTRIBUTED INFRASTRUCTURE
    2.
    发明申请
    PERFORMING COMPUTATIONS IN A DISTRIBUTED INFRASTRUCTURE 有权
    在分布式基础设施中进行计算

    公开(公告)号：US20120079234A1

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

    申请号：US12892345

    申请日：2010-09-28

    申请人： Mihail Gavril Tarta ,  Gopala Krishna R. Kakivaya

    发明人： Mihail Gavril Tarta ,  Gopala Krishna R. Kakivaya

    IPC分类号： G06F15/76

    CPC分类号： G06F9/466

    摘要： The present invention extends to methods, systems, and computer program products for performing computations in a distributed infrastructure. Embodiments of the invention include a general purpose distributed computation infrastructure that can be used to perform efficient (in-memory), scalable, failure-resilient, atomic, flow-controlled, long-running state-less and state-full distributed computations. Guarantees provided by a distributed computation infrastructure can build upon existent guarantees of an underlying distributed fabric in order to hide the complexities of fault-tolerance, enable large scale highly available processing, allow for efficient resource utilization, and facilitate generic development of stateful and stateless computations. A distributed computation infrastructure can also provide a substrate on which existent distributed computation models can be enhanced to become failure-resilient.

    摘要翻译： 本发明扩展到用于在分布式基础设施中执行计算的方法，系统和计算机程序产品。 本发明的实施例包括通用分布式计算基础设施，其可用于执行有效（内存中），可扩展，故障恢复，原子，流控制，长时间运行的无状态和状态完全分布式计算。 分布式计算基础设施提供的保证可以建立在底层分布式架构的现有保证之上，以隐藏容错的复杂性，实现大规模高可用性处理，允许有效的资源利用，并促进有状态和无状态计算的通用开发 。 分布式计算基础设施还可以提供一种基板，在其上可以增强现有的分布式计算模型以变得具有破坏性。

    DATA CONSISTENCY WITHIN A FEDERATION INFRASTRUCTURE
    3.
    发明申请
    DATA CONSISTENCY WITHIN A FEDERATION INFRASTRUCTURE 有权
    数据一致性在联合基础设施中

    公开(公告)号：US20120036237A1

    公开(公告)日：2012-02-09

    申请号：US13221635

    申请日：2011-08-30

    申请人： Richard L. Hasha ,  Lu Xun ,  Gopala Krishna R. Kakivaya ,  Dahlia Malkhi

    发明人： Richard L. Hasha ,  Lu Xun ,  Gopala Krishna R. Kakivaya ,  Dahlia Malkhi

    IPC分类号： G06F15/177

    CPC分类号： H04L67/1095 ,  G06F11/1425 ,  G06F17/30215 ,  G06F17/30578 ,  H04L67/104 ,  H04L67/1046

    摘要： A primary node is elected from among a plurality of nodes in a replica set of nodes. The primary node accepts and processes client data access requests. The replica set includes the primary node and other secondary nodes. The primary node receives client data access requests and assigns a data sequence number to each client data access request that mutates state in the order the client data access requests are received. The data sequence numbers include a linearized processing order that is followed by each of the nodes in the replica set. The primary node sends the mutating client data access requests including any corresponding data sequence numbers to the secondary nodes. The primary node receives, from a threshold number of secondary nodes, an acknowledgement indicating reception of the client data access request. The primary node commits the data mutating access request.

    摘要翻译： 在节点的副本集合中的多个节点中选择主节点。 主节点接受并处理客户端数据访问请求。 副本集包括主节点和其他辅助节点。 主节点接收客户端数据访问请求，并为每个客户端数据访问请求分配一个数据序列号，该请求按接收到客户端数据访问请求的顺序进行突变。 数据序列号包括复制集合中每个节点之后的线性化处理顺序。 主节点向次要节点发送包括任何对应的数据序列号的变化客户端数据访问请求。 主节点从阈值数量的次要节点接收到指示接收客户端数据访问请求的确认。 主节点提交数据突变访问请求。

    RENDEZVOUSING RESOURCE REQUESTS WITH CORRESPONDING RESOURCES
    4.
    发明申请
    RENDEZVOUSING RESOURCE REQUESTS WITH CORRESPONDING RESOURCES 有权
    使用相应的资源实现资源需求

    公开(公告)号：US20110235551A1

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

    申请号：US13155113

    申请日：2011-06-07

    申请人： Gopala Krishna R. Kakivaya ,  Richard L. Hasha ,  Thomas Lee Rodeheffer

    发明人： Gopala Krishna R. Kakivaya ,  Richard L. Hasha ,  Thomas Lee Rodeheffer

    IPC分类号： H04L12/28

    CPC分类号： H04L45/04 ,  H04L45/02 ,  H04L45/54

    摘要： The present invention extends to methods, systems, and computer program products for rendezvousing resource requests with corresponding resources. Doubly linked sorted lists are traversed using modulo arithmetic in both directions. Sorted lists can be partitioned based on a multiple proximity metrics. Node routing tables provide a logarithmic index to nodes within the ID space of the federation infrastructure to facilitate more efficient routing. Messages can be routed to nodes within a ring and proximally routed to nodes in other partitioned rings.

    摘要翻译： 本发明扩展到方法，系统和计算机程序产品，用于使资源请求与对应的资源进行会合。 双向链接排序列表使用模数算术在两个方向上遍历。 排序的列表可以基于多个邻近度量进行分区。 节点路由表为联盟基础架构的ID空间内的节点提供了一个对数索引，以便于更有效的路由。 消息可以路由到环内的节点，并向近端路由到其他分区环中的节点。

    Establishing membership within a federation infrastructure
    5.
    发明授权
    Establishing membership within a federation infrastructure 有权
    在联邦基础设施中建立会员资格

    公开(公告)号：US07624194B2

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

    申请号：US11015460

    申请日：2004-12-17

    申请人： Gopala Krishna R. Kakivaya ,  Richard L. Hasha ,  Thomas Lee Rodeheffer

    发明人： Gopala Krishna R. Kakivaya ,  Richard L. Hasha ,  Thomas Lee Rodeheffer

    IPC分类号： G06F15/173 ,  G06F15/16

    CPC分类号： H04L12/42 ,  H04L29/12066 ,  H04L29/12113 ,  H04L61/1511 ,  H04L61/1541 ,  H04L67/104 ,  H04L67/1046 ,  H04L67/1048

    摘要： The present invention extends to methods, systems, and computer program products for establishing and maintaining membership within a federation infrastructure. A joining node submits a join message to an existing federation infrastructure. The federation infrastructure routes the join message to a processing node. The processing node facilitates identification of predecessor, successor, neighborhood, and routing nodes (for the joining node) within a ring of nodes. The joining node exchanges messages with identified nodes to obtain state information for the identified nodes and other nodes within the ring. Nodes periodically exchange state information, including state information for other nodes, such that state information for the ring is efficiently propagated to all nodes in the ring even when communication between some nodes is lost. Instance IDs, phase values, and freshness values are used to determine when state information is stale and/or is to be updated.

    摘要翻译： 本发明扩展到用于在联盟基础设施内建立和维护成员资格的方法，系统和计算机程序产品。 加入节点向现有的联合基础设施提交加入消息。 联盟基础架构将加入消息路由到一个处理节点。 处理节点有助于识别节点环内的前导，后继，邻域和路由节点（对于加入节点）。 加入节点与已识别的节点交换消息，以获得所识别的节点和环内的其他节点的状态信息。 节点周期性地交换状态信息，包括其他节点的状态信息，使得即使在一些节点之间的通信丢失时，环的状态信息也被有效地传播到环中的所有节点。 实例ID，阶段值和新鲜度值用于确定何时状态信息过时和/或要更新。

    Optimizing communication using scalable peer groups
    6.
    发明授权
    Optimizing communication using scalable peer groups 有权
    使用可扩展对等组优化通信

    公开(公告)号：US07496602B2

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

    申请号：US11325690

    申请日：2006-01-04

    申请人： Christopher G. Kaler ,  Gopala Krishna R. Kakivaya ,  Hervey Oliver Wilson ,  Richard L. Hasha

    发明人： Christopher G. Kaler ,  Gopala Krishna R. Kakivaya ,  Hervey Oliver Wilson ,  Richard L. Hasha

    IPC分类号： G06F17/00

    CPC分类号： G06F17/30067 ,  H04L29/12132 ,  H04L29/12594 ,  H04L61/1552 ,  H04L61/3015 ,  Y10S707/99931 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/99945 ,  Y10S707/99948

    摘要： Implementations of the present invention relate in part to optimizations to peer-to-peer communication systems. For example, one implementation relates to use of a smart transceiver that creates, caches, and manages communication channels dynamically between peers. Another implementation relates to use of a central tracking object that can be used to efficiently register and distribute peer messages among the various peers. In one implementation, the central tracking object is shared amongst peers in the group. Still another implementation relates to associating peer groups with namespaces, and for including peer groups of one namespace within still other peer groups of different namespaces. These and other aspects of the invention can also be used to ensure delivery intent of a given peer message is preserved, and to ensure that optimal numbers of messages are communicated to any given peer at any given time.

    摘要翻译： 本发明的实现部分地涉及对等通信系统的优化。 例如，一个实现涉及在对等体之间动态地创建，高速缓存和管理通信信道的智能收发器的使用。 另一实现涉及使用可用于在各个对等体之间有效地注册和分发对等消息的中央跟踪对象。 在一个实现中，中心跟踪对象在组中的对等体之间共享。 另一个实现涉及将对等体组与命名空间相关联，并且用于将不同命名空间的另一个对等体组内的一个命名空间的对等体组包括在内。 本发明的这些和其它方面也可用于确保给定对等体消息的传送意图被保留，并确保在任何给定时间将最佳数量的消息传送给任何给定的对等体。

    MAINTAINING CONSISTENCY WITHIN A FEDERATION INFRASTRUCTURE
    7.
    发明申请
    MAINTAINING CONSISTENCY WITHIN A FEDERATION INFRASTRUCTURE 审中-公开
    维持联合基础设施的一致性

    公开(公告)号：US20080288659A1

    公开(公告)日：2008-11-20

    申请号：US11936589

    申请日：2007-11-07

    申请人： Richard L. Hasha ,  Lu Xun ,  Gopala Krishna R. Kakivaya ,  Dahlia Malkhi

    发明人： Richard L. Hasha ,  Lu Xun ,  Gopala Krishna R. Kakivaya ,  Dahlia Malkhi

    IPC分类号： G06F15/173

    CPC分类号： H04L67/1095 ,  G06F11/1425 ,  G06F16/1844 ,  G06F16/273 ,  H04L67/104 ,  H04L67/1046

    摘要： The present invention extends to methods, systems, and computer program products for a joining node to join a ring of nodes within a rendezvous federation. Embodiments include detecting a neighborhood of nodes on the ring of nodes. The joining node indicates its intent to take id-space ownership for a portion of the id-space between the joining node and a selected immediately adjacent node. The joining node indicates an intent to monitor the selected node. The joining node receives three indications, the first indicating acceptance of the joining node's intent to take id-space ownership for a portion of the id-space between the joining node and the selected node, the second indicating acceptance of the joining node's intent to monitor the selected node, the third indicating the first selected node's intent to monitor the joining node. The joining node indicates acceptance of the selected node's intent to monitor the joining node.

    摘要翻译： 本发明扩展到用于加入节点加入会合联盟内的节点环的方法，系统和计算机程序产品。 实施例包括检测节点环上的节点的邻域。 加入节点表示意图为加入节点和所选择的紧邻节点之间的id空间的一部分获取id空间所有权。 加入节点指示监视所选节点的意图。 加入节点接收三个指示，第一个指示加入节点意图对加入节点和所选节点之间的id空间的一部分采用id-space所有权的意图，第二个指示接收加入节点监视的意图 所选择的节点，第三个指示第一选择节点意图监视加入节点。 加入节点表示接受所选节点监视加入节点的意图。

    Asynchronous pattern
    9.
    发明授权
    Asynchronous pattern 有权
    异步模式

    公开(公告)号：US07248603B1

    公开(公告)日：2007-07-24

    申请号：US11425690

    申请日：2006-06-21

    申请人： Brian M. Grunkemeyer ,  Jonathan C. Hawkins ,  Christopher W. Brumme ,  Gopala Krishna R. Kakivaya ,  Lance E. Olson ,  Dmitry Robsman ,  Henry L. Sanders, II

    发明人： Brian M. Grunkemeyer ,  Jonathan C. Hawkins ,  Christopher W. Brumme ,  Gopala Krishna R. Kakivaya ,  Lance E. Olson ,  Dmitry Robsman ,  Henry L. Sanders, II

    IPC分类号： H04J3/16

    CPC分类号： G06F9/547 ,  G06F9/4484 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99945

    摘要： A system and method for converting code associated with synchronous method calls to code that can be employed to perform asynchronous method calls and for supporting such asynchronous method calls is provided. The system includes a pattern generator that can break code for a synchronous method call into one or more constituent parts including a begin asynchronous operation method, an end asynchronous operation method, an asynchronous call state object and an asynchronous call result object. The system includes a pattern data store that holds data associated with converting a synchronous method call to an asynchronous method call, which facilitates employing the system consistently across environments like file input/output, stream input/output, socket input/output, networking, remoting channels, proxies, web forms, web services and messaging message queues.

    摘要翻译： 提供了一种用于将与同步方法调用相关联的代码转换为可用于执行异步方法调用和支持这种异步方法调用的代码的系统和方法。 该系统包括可以将同步方法调用的代码中断为一个或多个组成部分的模式生成器，包括开始异步操作方法，结束异步操作方法，异步调用状态对象和异步调用结果对象。 该系统包括一个模式数据存储，其保存与将异步方法调用转换为同步方法调用相关联的数据，这有助于在诸如文件输入/输出，流输入/输出，套接字输入/输出，网络，远程处理 渠道，代理，Web表单，Web服务和消息消息队列。