-
公开(公告)号：US08738724B2
公开(公告)日：2014-05-27
申请号：US12786447
申请日：2010-05-25
IPC分类号： G06F15/167
CPC分类号： G06F11/1471 , G06F11/2094 , G06F2201/82
摘要： Computers are provided with a totally ordered, durable shared log. Shared storage is used and can be directly accessed by the computers over a network. Append-log operations are made atomic in the face of failures by committing provisional append ordering information onto a log. The log may comprise multiple flash packages or non-volatile memory devices, referred to as segments, although any shared storage device(s) may be used. Each log record is a multi-page stripe, where each page of a stripe is written to a different segment. Fault-tolerant protocol variants append stripes to the log, such that stripes are totally ordered in the log and each stripe is written atomically.
摘要翻译： 计算机提供了一个完全有序，耐用的共享日志。 共享存储被使用，可以由网络上的计算机直接访问。 通过将临时附加订单信息提交到日志，Append-log操作在面临故障时被做成原子。 尽管可以使用任何共享的存储设备，该日志可以包括被称为段的多个闪存包或非易失性存储设备。 每个日志记录是一个多页条带，其中每个条带的页面被写入不同的段。 容错协议变体将条纹附加到日志，使得条纹在日志中完全排序，每个条带是原子写入的。
-
公开(公告)号：US20110295969A1
公开(公告)日：2011-12-01
申请号：US12786447
申请日：2010-05-25
IPC分类号： G06F15/16
CPC分类号： G06F11/1471 , G06F11/2094 , G06F2201/82
摘要： Computers are provided with a totally ordered, durable shared log. Shared storage is used and can be directly accessed by the computers over a network. Append-log operations are made atomic in the face of failures by committing provisional append ordering information onto a log. The log may comprise multiple flash packages or non-volatile memory devices, referred to as segments, although any shared storage device(s) may be used. Each log record is a multi-page stripe, where each page of a stripe is written to a different segment. Fault-tolerant protocol variants append stripes to the log, such that stripes are totally ordered in the log and each stripe is written atomically.
摘要翻译： 计算机提供了一个完全有序，耐用的共享日志。 共享存储被使用，可以由网络上的计算机直接访问。 通过将临时附加订单信息提交到日志，Append-log操作在面临故障时被做成原子。 尽管可以使用任何共享的存储设备，该日志可以包括被称为段的多个闪存包或非易失性存储设备。 每个日志记录是一个多页条带，其中每个条带的页面被写入不同的段。 容错协议变体将条纹附加到日志，使得条纹在日志中完全排序，每个条带是原子写入的。
-
公开(公告)号：US20080304421A1
公开(公告)日：2008-12-11
申请号：US11759473
申请日：2007-06-07
申请人： Venugopalan Saraswati Ramasubramanian , Dahlia Malkhi , Mahesh Balakrishnan , Fabian Daniel Kuhn , Ittai Abraham
发明人： Venugopalan Saraswati Ramasubramanian , Dahlia Malkhi , Mahesh Balakrishnan , Fabian Daniel Kuhn , Ittai Abraham
IPC分类号： H04L12/26
CPC分类号： H04L41/147 , H04L43/0852
摘要： A prediction tree for estimating values of a network performance measure. Leaf nodes of the prediction tree are associated with networked computing devices and interior nodes are not necessarily representative of physical network connections. Values are assigned to edges in the prediction tree and the network performance measure relative to two computing devices represented by two nodes of the tree is estimated by aggregating the values assigned to the edges in the path in the prediction tree joining the two edges. Mechanisms for adding nodes representing computing devices to the prediction tree, for identifying a closest node representing a computing device in the prediction tree, for identifying a cluster of devices represented by nodes of the tree, and for rebalancing the prediction tree are provided.
摘要翻译： 用于估计网络性能测量值的预测树。 预测树的叶节点与网络计算设备相关联，而内部节点不一定代表物理网络连接。 值被分配给预测树中的边缘，并且通过聚合分配给连接两个边缘的预测树中的路径中的边缘的值来估计相对于由树的两个节点表示的两个计算设备的网络性能测量。 提供了将表示计算设备的节点添加到预测树的机制，用于识别表示预算树中的计算设备的最接近的节点，用于识别由树的节点表示的设备的集群以及用于重新平衡预测树。
-
公开(公告)号：US09417938B2
公开(公告)日：2016-08-16
申请号：US12405817
申请日：2009-03-17
CPC分类号： G06F9/547 , G06F2209/509 , H04L67/40
摘要： A remote procedure call chain is provided that replaces multiple consecutive remote procedure calls to multiple servers from a client by allowing a client to specify multiple functions to be performed consecutively at multiple servers in a single remote procedure call chain. The remote procedure call chain is executed by a sequence of multiple servers. Each server executes a service function and a chaining function of the remote procedure call chain. The chaining function uses the state of the remote procedure call chain in the sequence of servers to determine the next server to receive the remote procedure call chain, and the service function to be executed by that server. After the last service function is performed, the last server in the sequence of servers sends the results of the executed service functions to the client that originated the remote procedure call chain.
摘要翻译： 提供了一个远程过程调用链，通过允许客户端指定要在单个远程过程调用链中的多个服务器上连续执行的多个函数，将多个连续远程过程调用替换为多个服务器。 远程过程调用链由多个服务器的序列执行。 每个服务器执行远程过程调用链的服务功能和链接功能。 链接功能使用服务器序列中的远程过程调用链的状态来确定接收远程过程调用链的下一个服务器以及由该服务器执行的服务功能。 在执行最后一个服务功能之后，服务器序列中的最后一个服务器将执行的服务功能的结果发送给发起远程过程调用链的客户端。
-
5.发明申请ALLOCATING AND RECLAIMING RESOURCES WITHIN A RENDEZVOUS FEDERATION 失效在一个RENDEZVOUS FEDERATION分配和重新分配资源公开(公告)号：US20080031246A1
公开(公告)日：2008-02-07
申请号：US11752198
申请日：2007-05-22
申请人： Richard Hasha , Lu Xun , Gopala Kakivaya , Dahlia Malkhi
发明人： Richard Hasha , Lu Xun , Gopala Kakivaya , Dahlia Malkhi
IPC分类号： H04L12/28
CPC分类号： H04L45/00 , H04L29/12103 , H04L45/20 , H04L61/1535
摘要： The present invention extends to methods, systems, and computer program products for allocating and reclaiming resources within a rendezvous federation. Embodiments of the invention include formulating and routing messages in accordance with cached two-way agreements between adjacent nodes on a ring of nodes. Cached two-way agreements divide responsibility for at least unoccupied identifiers between the adjacent nodes on a ring. When a message is received at a node, the node can refer to a cached two-way agreement to determine if it or an adjacent node is responsible for the message. The node then sends the message to the next appropriate component in accordance with the cached two-way agreement.
摘要翻译： 本发明扩展到用于在会合联盟内分配和回收资源的方法，系统和计算机程序产品。 本发明的实施例包括根据节点环上的相邻节点之间的缓存的双向协议来制定和路由消息。 缓存的双向协议将至少在空闲的相邻节点之间的未占用标识符的责任分开。 当在节点处接收到消息时，节点可以参考缓存的双向协议来确定它或相邻节点是否对该消息负责。 然后，节点根据缓存的双向协议将消息发送到下一个适当的组件。
-
公开(公告)号：US08190703B2
公开(公告)日：2012-05-29
申请号：US12107769
申请日：2008-04-23
IPC分类号： G06F15/16
CPC分类号： G06F17/30893
摘要： An enhancement to a web browser offers an extension mechanism for web applications to utilize client-side resources, thereby moving more extensibility and flexibility to the client-side. The web browser may expose some control interfaces to meet various requirements from web applications. Using the extension mechanism, the web applications are able to offload the cloud servers, function when offline, and improve performance. The extension mechanism also provides users with full control to the data passing through their web browsers.
摘要翻译： Web浏览器的增强功能为Web应用程序提供了扩展机制，以利用客户端资源，从而将更多的可扩展性和灵活性转移到客户端。 Web浏览器可能会暴露一些控制界面，以满足Web应用程序的各种要求。 使用扩展机制，Web应用程序能够卸载云服务器，脱机时功能，并提高性能。 扩展机制还为用户提供对通过其Web浏览器传输的数据的完全控制。
-
公开(公告)号：US20120036237A1
公开(公告)日：2012-02-09
申请号：US13221635
申请日：2011-08-30
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.
摘要翻译： 在节点的副本集合中的多个节点中选择主节点。 主节点接受并处理客户端数据访问请求。 副本集包括主节点和其他辅助节点。 主节点接收客户端数据访问请求，并为每个客户端数据访问请求分配一个数据序列号，该请求按接收到客户端数据访问请求的顺序进行突变。 数据序列号包括复制集合中每个节点之后的线性化处理顺序。 主节点向次要节点发送包括任何对应的数据序列号的变化客户端数据访问请求。 主节点从阈值数量的次要节点接收到指示接收客户端数据访问请求的确认。 主节点提交数据突变访问请求。
-
公开(公告)号：US20080288659A1
公开(公告)日：2008-11-20
申请号：US11936589
申请日：2007-11-07
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所有权的意图，第二个指示接收加入节点监视的意图 所选择的节点，第三个指示第一选择节点意图监视加入节点。 加入节点表示接受所选节点监视加入节点的意图。
-
公开(公告)号：US08090880B2
公开(公告)日：2012-01-03
申请号：US11936556
申请日：2007-11-07
IPC分类号： G06F15/16 , G06F15/173 , G06F17/00 , G06F11/16
CPC分类号： H04L67/1095 , G06F11/1425 , G06F17/30215 , G06F17/30578 , H04L67/104 , H04L67/1046
摘要： In some embodiments, it is determined that a primary node has been 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. The primary node 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 to be 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.
摘要翻译： 在一些实施例中，确定在节点的副本集合中的多个节点中已经选择了主节点。 主节点接受并处理客户端数据访问请求。 副本集包括主节点和其他辅助节点。 主节点接收客户端数据访问请求。 主节点为每个客户端数据访问请求分配一个数据序列号，该请求以接收到客户端数据访问请求的顺序进行突变。 数据序列号包括复制集合中每个节点应遵循的线性化处理顺序。 主节点向次要节点发送包括任何对应的数据序列号的变化客户端数据访问请求。 主节点从阈值数量的次要节点接收到指示接收客户端数据访问请求的确认。 主节点提交数据突变访问请求。
-
公开(公告)号：US07958262B2
公开(公告)日：2011-06-07
申请号：US11752198
申请日：2007-05-22
IPC分类号： G06F15/173 , H04L12/28 , H04L12/56
CPC分类号： H04L45/00 , H04L29/12103 , H04L45/20 , H04L61/1535
摘要： The present invention extends to methods, systems, and computer program products for allocating and reclaiming resources within a rendezvous federation. Embodiments of the invention include formulating and routing messages in accordance with cached two-way agreements between adjacent nodes on a ring of nodes. Cached two-way agreements divide responsibility for at least unoccupied identifiers between the adjacent nodes on a ring. When a message is received at a node, the node can refer to a cached two-way agreement to determine if it or an adjacent node is responsible for the message. The node then sends the message to the next appropriate component in accordance with the cached two-way agreement.
摘要翻译： 本发明扩展到用于在会合联盟内分配和回收资源的方法，系统和计算机程序产品。 本发明的实施例包括根据节点环上的相邻节点之间的缓存的双向协议来制定和路由消息。 缓存的双向协议将至少在空闲的相邻节点之间的未占用标识符的责任分开。 当在节点处接收到消息时，节点可以参考缓存的双向协议来确定它或相邻节点是否对该消息负责。 然后，节点根据缓存的双向协议将消息发送到下一个适当的组件。
-
-
-
-
-
-
-
-
-
搜索结果
26 条记录 (耗时 0.038 秒)