-
1.发明申请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.
摘要翻译： 本发明扩展到用于在会合联盟内分配和回收资源的方法，系统和计算机程序产品。 本发明的实施例包括根据节点环上的相邻节点之间的缓存的双向协议来制定和路由消息。 缓存的双向协议将至少在空闲的相邻节点之间的未占用标识符的责任分开。 当在节点处接收到消息时，节点可以参考缓存的双向协议来确定它或相邻节点是否对该消息负责。 然后，节点根据缓存的双向协议将消息发送到下一个适当的组件。
-
公开(公告)号：US20080005624A1
公开(公告)日：2008-01-03
申请号：US11549332
申请日：2006-10-13
申请人： Gopala Kakivaya , Richard Hasha , Lu Xun , Dahlia Malkhi
发明人： Gopala Kakivaya , Richard Hasha , Lu Xun , Dahlia Malkhi
IPC分类号： G06F11/00
CPC分类号： H04L67/104 , H04L67/1046 , H04L67/1048 , H04L67/1076
摘要： The present invention extends to methods, systems, and computer program products for appropriately detecting node failures in a rendezvous federation. A monitor node monitors a subject node. The subject node intermittently renews a time-to-live duration value with the monitor node to indicate the monitor node that the subject node has not failed. In some embodiments, each node in a pair of nodes monitors the other nodes in the pair of nodes. Thus, each node is a subject node and a monitor node. In further embodiments, an arbitration facility arbitrates failure reports.
摘要翻译： 本发明扩展到用于适当地检测会合联盟中的节点故障的方法，系统和计算机程序产品。 监视器节点监视主体节点。 主体节点间歇地更新监视节点的生存时间值，以指示主节点未失败的监视节点。 在一些实施例中，一对节点中的每个节点监视该对节点中的其他节点。 因此，每个节点是主节点和监视节点。 在进一步的实施例中，仲裁机构仲裁故障报告。
-
公开(公告)号：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.
摘要翻译： 本发明扩展到用于在会合联盟内分配和回收资源的方法，系统和计算机程序产品。 本发明的实施例包括根据节点环上的相邻节点之间的缓存的双向协议来制定和路由消息。 缓存的双向协议将至少在空闲的相邻节点之间的未占用标识符的责任分开。 当在节点处接收到消息时，节点可以参考缓存的双向协议来确定它或相邻节点是否对该消息负责。 然后，节点根据缓存的双向协议将消息发送到下一个适当的组件。
-
公开(公告)号：US07694167B2
公开(公告)日：2010-04-06
申请号：US11549332
申请日：2006-10-13
IPC分类号： G06F11/00
CPC分类号： H04L67/104 , H04L67/1046 , H04L67/1048 , H04L67/1076
摘要： The present invention extends to methods, systems, and computer program products for appropriately detecting node failures in a rendezvous federation. A monitor node monitors a subject node. The subject node intermittently renews a time-to-live duration value with the monitor node to indicate the monitor node that the subject node has not failed. In some embodiments, each node in a pair of nodes monitors the other nodes in the pair of nodes. Thus, each node is a subject node and a monitor node. In further embodiments, an arbitration facility arbitrates failure reports.
摘要翻译： 本发明扩展到用于适当地检测会合联盟中的节点故障的方法，系统和计算机程序产品。 监视器节点监视主体节点。 主体节点间歇地更新监视节点的生存时间值，以指示主节点未失败的监视节点。 在一些实施例中，一对节点中的每个节点监视该对节点中的其他节点。 因此，每个节点是主节点和监视节点。 在进一步的实施例中，仲裁机构仲裁故障报告。
-
公开(公告)号：US08990434B2
公开(公告)日：2015-03-24
申请号：US13221635
申请日：2011-08-30
CPC分类号： H04L67/1095 , G06F11/1425 , G06F17/30215 , G06F17/30578 , H04L67/104 , H04L67/1046
摘要： Embodiments include establishing and maintaining a consistent replica set within the federation infrastructure. A replica set, including a primary node and secondary nodes, is established from among nodes in a ring of nodes. An occurrence of a replica set configuration event affecting at least one of the replica set members is indicated. Based on the indication and based on a type of the replica set configuration event, it is determined that the replica set is to be reconfigured. The replica set is reconfigured according to a reconfiguration appropriate for the type of the replica set configuration event.
摘要翻译： 实施例包括在联盟基础设施内建立和维护一致的副本集合。 从节点环中的节点中建立包括主节点和次节点的副本集合。 指示影响至少一个副本集成员的副本集配置事件的发生。 基于指示并基于副本集配置事件的类型，确定复制集合将被重新配置。 根据适合于副本集配置事件的类型的重新配置来重新配置副本集。
-
公开(公告)号：US20110082928A1
公开(公告)日：2011-04-07
申请号：US12907799
申请日：2010-10-19
IPC分类号： G06F15/173
CPC分类号： H04L43/0876 , H04L29/08306 , H04L29/08333 , H04L43/00 , H04L45/02 , H04L67/104 , H04L67/1046 , H04L67/1095 , H04L67/141
摘要： 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 of the invention include establishing a neighborhood of multiple 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 initiates a one-way monitoring relationship with the selected immediately adjacent node. The joining node receiving an indication from the selected immediately adjacent node that indicates 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 and indicates establishment of a one-way monitoring relationship between the selected node and the joining node. The joining node agrees to participate in a one-way monitoring relationship with the selected node.
摘要翻译： 本发明扩展到用于加入节点加入会合联盟内的节点环的方法，系统和计算机程序产品。 本发明的实施例包括在节点的环上建立多个节点的邻域。 加入节点表示意图为加入节点和所选择的紧邻节点之间的id空间的一部分获取id空间所有权。 加入节点发起与所选立即相邻节点的单向监控关系。 所述加入节点从所选择的紧邻节点接收指示所述加入节点对所述加入节点和所选节点之间的所述id空间的一部分采用id空间所有权的意图的接受，并且指示建立单向 监控所选节点与加入节点之间的关系。 加入节点同意参与与所选节点的单向监控关系。
-
公开(公告)号：US20080288646A1
公开(公告)日：2008-11-20
申请号：US11936556
申请日：2007-11-07
IPC分类号： G06F15/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.
摘要翻译： 在一些实施例中，确定在节点的副本集合中的多个节点中已经选择了主节点。 主节点接受并处理客户端数据访问请求。 副本集包括主节点和其他辅助节点。 主节点接收客户端数据访问请求。 主节点为每个客户端数据访问请求分配一个数据序列号，该请求以接收到客户端数据访问请求的顺序进行突变。 数据序列号包括复制集合中每个节点应遵循的线性化处理顺序。 主节点向次要节点发送包括任何对应的数据序列号的变化客户端数据访问请求。 主节点从阈值数量的次要节点接收到指示接收客户端数据访问请求的确认。 主节点提交数据突变访问请求。
-
-
-
-
-
-
-
-
-
搜索结果
26 条记录 (耗时 0.033 秒)
