公开(公告)号：US06247038B1

公开(公告)日：2001-06-12

申请号：US08682830

申请日：1996-07-12

申请人： Timothy William Banks ,  Ian Hunter ,  Glyn Normington ,  Dennis Jack Zimmer ,  Peter James Lupton

发明人： Timothy William Banks ,  Ian Hunter ,  Glyn Normington ,  Dennis Jack Zimmer ,  Peter James Lupton

IPC分类号： G06F900

CPC分类号： G06F9/466

摘要： Disclosed is a method for providing synchronization of a transaction in a data processing system where the transaction involves a plurality of agents participating in the transaction and one coordinator for coordinating the transaction. The agents include at least a middleman which coordinates a set of at least one of the agents. A vote is sent indicating the availability or non-availability to commit from each of the agents to the coordinator. The coordinator determines a commit or backout decision when all the votes are received. A Not Known decision message is sent from the middleman to each of the agents in the set available to commit if the decision is not available at the middleman because of a failure. The Not Known decision message stops resynchronization of each of the available agents. If the middleman has responsibility for resynchronization then, on availability of the decision at the middleman, a resynchronization message is sent to each of the available agents. If the middleman does not have responsibility for resynchronization, then a Known decision message is sent to each of the available agents from the middleman. Receipt of the Known decision message starts resynchronization of each of the available agents.

摘要翻译： 公开了一种用于在数据处理系统中提供交易的同步的方法，其中交易涉及参与交易的多个代理以及用于协调交易的一个协调器。 这些代理包括至少一个协调一组至少一个代理的中间人。 发送表决，指示从每个代理提交到协调员的可用性或不可用性。 当收到所有投票时，协调员确定提交或退出决定。 A如果由于失败导致中间人无法获得该决定，则可以从中间人向可用集合中的每个代理发送未知的决定消息。 未知的决策消息停止每个可用代理的重新同步。 如果中间人有重新同步的责任，那么在中间人的决定的可用性上，会向每个可用代理发送一个重新同步消息。 如果中间人没有重新同步的责任，那么从中间人就可以向每个可用的代理发送已知的决定信息。 已知决策消息的接收开始每个可用代理程序的重新同步。

公开(公告)号：US07627867B2

公开(公告)日：2009-12-01

申请号：US10976207

申请日：2004-10-28

申请人： Timothy William Banks

发明人： Timothy William Banks

IPC分类号： G06F9/44 ,  G06F15/16

CPC分类号： G06F9/547 ,  G06F17/30575

摘要： Mechanisms for change management of interfaces in a distributed computer system are provided in which there are multiple versions of an interface describing communication between distributed client and server applications. The mechanisms include providing an indication with a response to an operation of an interface that an alternative interface is available. The information can include: a time interval in which a client application must contact a server application using the version of the interface, a reference to a succeeding version of the interface; and/or an indication of an expiry date and time of an interface. The interface itself is used to communicate version and validity information and change to client applications.

摘要翻译： 提供了分布式计算机系统中接口变更管理的机制，其中有多个版本的接口描述分布式客户端和服务器应用程序之间的通信。 这些机制包括提供对替代接口可用的接口的操作的响应的指示。 信息可以包括：客户端应用程序必须使用接口版本与服务器应用程序联系的时间间隔，对接口的后续版本的引用; 和/或接口的到期日期和时间的指示。 接口本身用于传递版本和有效性信息，并更改为客户端应用程序。

公开(公告)号：US06202079B1

公开(公告)日：2001-03-13

申请号：US08655528

申请日：1996-05-30

申请人： Timothy William Banks

发明人： Timothy William Banks

IPC分类号： G06F900

CPC分类号： G06F9/466

摘要： Disclosed is a method for providing synchronization of a transaction in a data processing system where the transaction involves an initiator node, which starts said synchronization, and a coordinator node, which decides the outcome of said transaction. The initiator node and the coordinator node communicate through a routing node. The routing node has no resources of its own which are modified in the transaction. The synchronization is provided by establishing a first conversation between the initiator node and the routing node and a second conversation between the routing node and the coordinator node. A first commit request message is then sent from said initiator node to the routing node. A second commit request message is sent from the routing node to the coordinator node. An additional step is performed of storing asynchronously, checkpoint information to non-volatile storage in the routing node after establishing the first and second conversations and before sending said second commit request message. The routing node acts as just a routing node and does not save checkpoint state as if it were a node with a real need to do so. In the event of failure the routing node only recovers the routing information, that is the end points of the conversation it was routing when failure occurred. The resynchronization protocols are carried between the end points with the routing node not aware of their contents, except to monitor when it can safely forget its routing information.

摘要翻译： 公开了一种用于在数据处理系统中提供事务的同步的方法，其中交易涉及启动所述同步的发起者节点以及决定所述交易的结果的协调器节点。 发起者节点和协调器节点通过路由节点进行通信。 路由节点没有自己的资源在事务中被修改。 通过在发起者节点和路由节点之间建立第一对话以及路由节点和协调器节点之间的第二对话来提供同步。 然后，第一提交请求消息从所述发起者节点发送到路由节点。 第二个提交请求消息从路由节点发送到协调器节点。 在建立第一和第二对话之后并且在发送所述第二提交请求消息之前，执行附加步骤，以异步地将检查点信息存储在路由节点中的非易失性存储器中。 路由节点仅作为一个路由节点，并不保存检查点状态，就像它是一个真正需要这样做的节点一样。 在发生故障的情况下，路由节点仅恢复路由信息，即发生故障时路由的会话的终点。 重新同步协议在路由节点不知道其内容的端点之间承载，除了监视何时可以安全地忘记其路由信息。

公开(公告)号：US08370843B1

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

申请号：US09628367

申请日：2000-07-31

申请人： Michael Casson Bailey ,  Timothy William Banks ,  Ian Geoffrey Redding ,  Dennis J Zimmer

发明人： Michael Casson Bailey ,  Timothy William Banks ,  Ian Geoffrey Redding ,  Dennis J Zimmer

IPC分类号： G06F9/455 ,  G06F9/46

CPC分类号： G06F9/44505 ,  G06F9/5055 ,  G06F2209/5011 ,  G06F2209/5018

摘要： Disclosed are a method, system and computer program product for progressively improving the fit of a pool of reusable environments to requirements of programs in a computer system. The method comprises steps of: providing a first environment for a first program; responsive to initiation of a second program, making a determination whether creation of a new environment is a best response; responsive to a determination that creation of a new environment is a best response, creating a new environment for the second program; responsive to a determination that creating a new environment is not a best response, testing the pool for a best fit environment; and adding elements to the best fit environment to match requirements of the second program, unless the best fit environment already matches the requirements of the second program.

摘要翻译： 公开了一种方法，系统和计算机程序产品，用于逐渐改进可重用环境池对计算机系统中程序的要求的适应性。 该方法包括以下步骤：为第一程序提供第一环境; 响应于启动第二个程序，确定新环境的创建是否是最佳响应; 响应于确定创建新环境是最佳响应，为第二个程序创建新的环境; 响应于确定创建新环境不是最佳响应，测试池以获得最佳适应环境; 并将元素添加到最佳适应环境以匹配第二个程序的要求，除非最佳拟合环境已经符合第二个程序的要求。

公开(公告)号：US5901334A

公开(公告)日：1999-05-04

申请号：US678371

申请日：1996-06-27

申请人： Timothy William Banks ,  Paul Weeden ,  Kevin John Turner ,  David John Wyatt

发明人： Timothy William Banks ,  Paul Weeden ,  Kevin John Turner ,  David John Wyatt

IPC分类号： G06F9/54 ,  G06F9/46 ,  G06F9/50 ,  G06F11/00 ,  G06F13/00 ,  G06F15/16 ,  G06F15/163 ,  H04L13/08

CPC分类号： G06F9/544 ,  G06F9/505 ,  G06F11/0757 ,  G06F11/076

摘要： Disclosed is a data processing system and a method of managing a queue 130 of items for processing in which the expected time an item will spend on the queue 130 is calculated 209 when an item is received to be placed on a queue 130. If this exceeds an upper limit, then the item is rejected 213 and the queue 130 is purged 215 of all items. An indication is provided to the sources of the items that were purged that this has occurred. In this way, it is possible to detect the difference between a queue 130 which is longer, but dynamic, and one which is shorter, but static. The method is applied to management of requests for a communications link between local and remote systems.

摘要翻译： 公开了一种数据处理系统和方法，用于管理项目的队列130，用于处理，其中当物品被接收到要放置在队列130上时，项目将花费在队列130上的预期时间被计算209.如果超过 一个上限，则该项目被拒绝213，并且清除所有项目中的队列130。 向被清除的项目的来源提供了一个指示。 以这种方式，可以检测更长但动态的队列130和较短但是静态的队列130之间的差异。 该方法适用于对本地和远程系统之间的通信链路的请求的管理。