公开(公告)号：US5999712A

公开(公告)日：1999-12-07

申请号：US955885

申请日：1997-10-21

申请人： Hossein Moiin ,  Ronald Widyono ,  Ramin Modiri

发明人： Hossein Moiin ,  Ronald Widyono ,  Ramin Modiri

IPC分类号： G06F11/20 ,  G06F9/50 ,  G06F11/00 ,  G06F13/00 ,  H04L12/00

CPC分类号： G06F9/5061 ,  G06F11/1425 ,  H04L41/0823 ,  H04L41/0873 ,  H04L41/0893 ,  H04L43/0811 ,  G06F11/2033 ,  G06F11/2038 ,  G06F11/2046 ,  G06F2209/505 ,  H04L41/06

摘要： Cluster membership in a distributed computer system is determined by determining with which other nodes each node is in communication and distributing that connectivity information through the nodes of the system. Accordingly, each node can determine an optimized new cluster based upon the connectivity information. Specifically, each node has information regarding with which nodes the node is in communication and similar information for each other node of the system. Therefore, each node has complete information regarding interconnectivity of all nodes which are directly or indirectly connected. Each node applies optimization criteria to such connectivity information to determine an optimal new cluster. Data represent the optimal new cluster is broadcast by each node. In addition, the optimal new cluster determined by the various nodes are collected by each node. Thus, each node has data representing the proposed new cluster which is perceived by each respective node to be optimal. Each node uses such data to elect a new cluster from the various proposed new clusters. For example, the new cluster represented by more proposed new clusters than any other is elected as the new cluster. Since each node receives the same proposed new clusters from the potential member nodes of the new cluster, the new cluster membership is reached unanimously. In addition, since each node has more complete information regarding the potential member nodes of the new cluster, the resulting new cluster consistently has a relatively optimal configuration.

公开(公告)号：US06192401B1

公开(公告)日：2001-02-20

申请号：US09266195

申请日：1999-03-10

申请人： Ramin Modiri ,  Hossein Moiin

发明人： Ramin Modiri ,  Hossein Moiin

IPC分类号： G06F15177

CPC分类号： G06F9/5061 ,  G06F11/1425 ,  G06F11/2033 ,  G06F11/2038 ,  G06F11/2046 ,  G06F2209/505 ,  H04L41/0672 ,  H04L41/0823 ,  H04L41/0873 ,  H04L41/0893

摘要： A distributed computer system and method for determining cluster membership in a distributed computer system. A plurality of computers configurable as cluster nodes are coupled through one or more public and/or private communications networks. Cluster management software running on the plurality of computers is configured to group various ones of the computers into a cluster. Weighting values are assigned to each node, such as by relative processing power. Each fully connected subset of nodes are grouped into a possible cluster configuration. The weighting value of each subset is calculated. The membership in the cluster is chosen based on the subset with the optimum weighting value among all the possible cluster configurations. The maximum weighting value may be adjusted if the maximum weighting value is greater than or equal to the sum of all other weighting values for all other nodes in the current cluster configuration. The maximum weighting factor may be adjusted to a value below the sum of all other weighting values for all other nodes in the current cluster configuration.

摘要翻译： 一种用于确定分布式计算机系统中的集群成员资格的分布式计算机系统和方法。 可配置为群集节点的多个计算机通过一个或多个公共和/或专用通信网络耦合。 在多个计算机上运行的群集管理软件被配置为将各个计算机分组成群集。 加权值被分配给每个节点，例如通过相对处理能力。 每个完全连接的节点子集被分组成可能的集群配置。 计算每个子集的加权值。 在所有可能的集群配置中，基于具有最佳加权值的子集来选择集群中的成员资格。 如果最大加权值大于或等于当前集群配置中所有其他节点的所有其他加权值的总和，则可以调整最大加权值。 可以将最大加权因子调整为低于当前集群配置中所有其他节点的所有其他加权值之和的值。

公开(公告)号：US5826066A

公开(公告)日：1998-10-20

申请号：US694073

申请日：1996-08-08

申请人： Robert L. Jardine ,  Hossein Moiin

发明人： Robert L. Jardine ,  Hossein Moiin

IPC分类号： G04G3/00 ,  G04G5/00 ,  G06F1/14 ,  G06F1/04

CPC分类号： G06F1/14 ,  G04R40/06

摘要： A computing system develops time/date values by using a free-running counter to measure and accumulate increments of time. The increments of time are converted from the resolution of the free-running counter to that used for the time and date values by dividing by a conversion variable and then used to update the time/date value. The accuracy of the time/date value is monitored by periodically comparing the rate of the free-running counter to the rate of a more accurate, external clock. The ratio of these two rates is used to adjust the conversion variable. The conversion variable reflects any differences between (1) the rate of change of the increments of time used for developing the time/data value and (2) the external clock. Its use here, therefore, will operate to either slow down or speed up the rate of change of the time/date value so that it more closely tracks the external clock.

摘要翻译： 计算系统通过使用自由运行的计数器来测量和累加时间增量来制定时间/日期值。 时间增量由自由运行计数器的分辨率转换为通过转换变量除以时间和日期值的分辨率，然后用于更新时间/日期值。 通过周期性地比较自由运行计数器的速率与更准确的外部时钟的速率来监视时间/日期值的精度。 这两个比率的比率用于调整转换变量。 转换变量反映了（1）用于开发时间/数据值的时间增量变化率与（2）外部时钟之间的差异。 因此，这里的使用将会减慢或加快时间/日期值的变化速度，以便更紧密地跟踪外部时钟。

公开(公告)号：US06449641B1

公开(公告)日：2002-09-10

申请号：US09268793

申请日：1999-03-16

申请人： Hossein Moiin ,  Ronald Widyono ,  Ramin Modiri

发明人： Hossein Moiin ,  Ronald Widyono ,  Ramin Modiri

IPC分类号： G06F15177

CPC分类号： G06F9/5061 ,  G06F11/1425 ,  G06F11/2033 ,  G06F11/2038 ,  G06F11/2046 ,  G06F2209/505 ,  H04L41/06 ,  H04L41/0823 ,  H04L41/0873 ,  H04L41/0893 ,  H04L43/0811

摘要： Cluster membership in a distributed computer system is determined by determining with which other nodes each node is in communication and distributing that connectivity information through the nodes of the system. Accordingly, each node can determine an optimized new cluster based upon the connectivity information. Specifically, each node has information regarding with which nodes the node is in communication and similar information for each other node of the system. Therefore, each node has complete information regarding interconnectivity of all nodes which are directly or indirectly connected. Each node applies optimization criteria to such connectivity information to determine an optimal new cluster. Data represent the optimal new cluster is broadcast by each node. In addition, the optimal new cluster determined by the various nodes are collected by each node. Thus, each node has data representing the proposed new cluster which is perceived by each respective node to be optimal. Each node uses such data to elect a new cluster from the various proposed new clusters. For example, the new cluster represented by more proposed new clusters than any other is elected as the new cluster. Since each node receives the same proposed new clusters from the potential member nodes of the new cluster, the new cluster membership is reached unanimously. In addition, since each node has more complete information regarding the potential member nodes of the new cluster, the resulting new cluster consistently has a relatively optimal configuration.

摘要翻译： 通过确定每个节点在哪个其他节点进行通信并通过系统的节点分发该连接信息来确定分布式计算机系统中的集群成员资格。 因此，每个节点可以基于连接性信息来确定优化的新集群。 具体地，每个节点具有关于节点与哪个节点通信的信息以及系统的每个其他节点的类似信息。 因此，每个节点具有关于直接或间接连接的所有节点的互连性的完整信息。 每个节点对这种连接信息应用优化标准以确定最佳新集群。 数据表示每个节点广播的最佳新集群。 另外，由各个节点确定的最佳新簇由每个节点收集。 因此，每个节点具有表示由每个相应节点感知为最优的所提出的新群集的数据。 每个节点使用这样的数据从各种提出的新集群中选出一个新的集群。 例如，由更多提出的新集群所代表的新集群比任何其他集群都被选为新集群。 由于每个节点从新集群的潜在成员节点接收到相同的提出的新集群，所以新的集群成员资格是一致的。 另外，由于每个节点具有关于新集群的潜在成员节点的更完整的信息，所以产生的新集群始终具有相对最佳的配置。

公开(公告)号：US6108699A

公开(公告)日：2000-08-22

申请号：US884097

申请日：1997-06-27

申请人： Hossein Moiin

发明人： Hossein Moiin

IPC分类号： G06F11/20 ,  G06F11/14 ,  G06F15/177 ,  G06F15/173

CPC分类号： G06F11/1425

摘要： Multiple nodes can concurrently gain membership in a cluster of nodes of a distributed computer system by broadcasting reconfiguration messages to all nodes of the distributed computer system. In response to a reconfiguration request resulting from a node petitioning to join a cluster or a node leaving the cluster, each node determines to which nodes of the distributed computer system the node is connected, i.e., which are sending reconfiguration messages which the node receives. In addition, if multiple nodes fail substantially simultaneously, each node which continues to operate does not receive a reconfiguration message from each of the failed nodes and the failed nodes are omitted from the proposed new cluster. Thus, multiple simultaneous failures are processed in a single reconfiguration. Each of the member nodes of the proposed cluster determine the membership of the proposed cluster and broadcast a reconfiguration message to all proposed member nodes and collects similar messages. If all reconfiguration messages agree, the proposed cluster is accepted. In the case in which one or more nodes leave the cluster, quorum is established in the new cluster relative to the old cluster.

摘要翻译： 多个节点可以通过向分布式计算机系统的所有节点广播重新配置消息来同时获得分布式计算机系统的节点集群中的成员资格。 响应于由节点请求加入群集或离开群集的节点而产生的重新配置请求，每个节点确定该节点所连接的分布式计算机系统的哪些节点，即哪些节点接收的重新配置消息。 此外，如果多个节点基本上同时失败，则继续操作的每个节点都不会从每个故障节点接收到重新配置消息，并且从所提出的新集群中省略故障节点。 因此，在单个重新配置中处理多个同时故障。 所提出的集群的每个成员节点确定所提出的集群的成员资格并向所有提出的成员节点广播重配置消息并且收集类似的消息。 如果所有重新配置消息都同意，则建议的集群被接受。 在一个或多个节点离开集群的情况下，在新集群中建立相对于旧集群的仲裁。

公开(公告)号：US5948109A

公开(公告)日：1999-09-07

申请号：US115412

申请日：1998-07-14

申请人： Hossein Moiin ,  Ottalingam T. Satyanarayanan ,  Angelo Pruscino

发明人： Hossein Moiin ,  Ottalingam T. Satyanarayanan ,  Angelo Pruscino

IPC分类号： G06F11/20 ,  G06F11/14 ,  G06F11/18

CPC分类号： G06F11/1425

摘要： Each node of a failing distributed computer system, e.g., as a result of a split-brain failure, races to achieve a quorum by successfully reserving two shared storage devices which are designated quorum controllers. During normal operation of the distributed computer system, each of the quorum controllers is associated with and reserved by a respective node. During the race for quorum in response to a detected failure of the distributed computer system, each node which has not failed forcibly reserves the quorum controller which is associated with the other node. If a node simultaneously holds reservations for both quorum controllers, that node has acquired a quorum. The forcible reservation of a shared storage device does not fail even if another node holds a valid reservation to the same storage device. Accordingly, a failed node which does not relinquish a reservation to the node's quorum controller cannot prevent another node from acquiring a quorum. Prior to forcibly reserving the quorum controller of another node, each node verifies that it continues to hold a reservation of the node's own associated quorum controller. If a node no longer holds a reservation of the node's own associated quorum controller, that node has lost the race for quorum since another node has already forcibly reserved the former node's associated quorum controller. Thus, quorum can be efficiently and effectively determined by independent nodes of a failing distributed computer system notwithstanding the failure of a failing node to relinquish shared storage device reservations held by the failing node.

摘要翻译： 失败的分布式计算机系统的每个节点，例如作为分裂脑故障的结果，通过成功地保留作为指定的仲裁控制器的两个共享存储设备来实现法定人数。 在分布式计算机系统的正常操作期间，每个仲裁控制器与相应节点相关联并由相应节点保留。 在响应于分布式计算机系统的检测到的故障的争用期间，没有失败的每个节点强制地保留与另一个节点相关联的仲裁控制器。 如果一个节点同时为两个仲裁控制器保留，则该节点已经获得了一个法定人数。 即使另一个节点保持对同一存储设备的有效预约，共享存储设备的强制预留也不会失败。 因此，不将节点放弃到节点的仲裁控制器的故障节点不能阻止另一节点获取仲裁。 在强制保留另一个节点的仲裁控制器之前，每个节点验证它是否继续保存节点自己的相关法定控制器的预留。 如果节点不再保留节点自己的关联仲裁控制器，则该节点已经失去了法定人数的竞争，因为另一个节点已经强制保留了前一个节点的关联仲裁控制器。 因此，尽管发生故障的节点发生故障节点所保存的共享存储设备保留失败，可以有效地有效地确定故障分布式计算机系统的独立节点。

公开(公告)号：US5828889A

公开(公告)日：1998-10-27

申请号：US656386

申请日：1996-05-31

申请人： Hossein Moiin ,  Ottalingam T. Satyanarayanan ,  Angelo Pruscino

发明人： Hossein Moiin ,  Ottalingam T. Satyanarayanan ,  Angelo Pruscino

IPC分类号： G06F11/20 ,  G06F11/14 ,  G06F13/18 ,  G06F11/16

CPC分类号： G06F11/1425

摘要： Each node of a failing distributed computer system, e.g., as a result of a split-brain failure, races to achieve a quorum by successfully reserving two shared storage devices which are designated quorum controllers. During normal operation of the distributed computer system, each of the quorum controllers is associated with and reserved by a respective node. During the race for quorum in response to a detected failure of the distributed computer system, each node which has not failed forcibly reserves the quorum controller which is associated with the other node. If a node simultaneously holds reservations for both quorum controllers, that node has acquired a quorum. The forcible reservation of a shared storage device does not fail even if another node holds a valid reservation to the same storage device. Accordingly, a failed node which does not relinquish a reservation to the node's quorum controller cannot prevent another node from acquiring a quorum. Prior to forcibly reserving the quorum controller of another node, each node verifies that it continues to hold a reservation of the node's own associated quorum controller. If a node no longer holds a reservation of the node's own associated quorum controller, that node has lost the race for quorum since another node has already forcibly reserved the former node's associated quorum controller. Thus, quorum can be efficiently and effectively determined by independent nodes of a failing distributed computer system notwithstanding the failure of a failing node to relinquish shared storage device reservations held by the failing node.

公开(公告)号：US07096387B2

公开(公告)日：2006-08-22

申请号：US10094434

申请日：2002-03-08

申请人： Paul Durrant ,  Stephen R Hanson ,  David S Gordon ,  Hossein Moiin

发明人： Paul Durrant ,  Stephen R Hanson ,  David S Gordon ,  Hossein Moiin

IPC分类号： G06F11/00

CPC分类号： G06F11/0727 ,  G06F11/079

摘要： A computer system compnses a processor (2), memory (4) and a plurality of devices (6, 8, 12), the processor (2) and the memory (4) being operable to effect the operation of a fault response processor (AFR), and a device driver (GRAPHICS, NETWORK, H2IO, IO2L, SERIAL) for each of the devices. The fault response processor (AFR) is operable to generate a model which represents the processor (2), the memory (4) and the devices (6, 8, 12) of the computer system and the inter-connection of the processor (2), memory (4) and the devices (GRAPHICS, NETWORK, H2IO, IO2L, SERIAL). The device driver (GRAPHICS, NETWORK, H2IO, IO2L, SERIAL) for each of the devices (6, 8, 12) is arranged, consequent upon a change of operational status of the device, to generate fault report data indicating whether the change of status was caused internally within the device or externally by another connected device. The devices of the computer system may be formed as a plurality of Field Replaceable Units (FRU). The fault response processor (AFR) is operable, consequent upon receipt of the fault reports from the device drivers (GRAPHICS, NETWORK, H2IO, IO2L, SERIAL) to estimate the location of a FRU containing a faulty device by applying the fault indication to the model. In other embodiments the fault report data includes direction information indicating a connection between the device and the other connected device which caused the external fault. Having identified the faulty device the FRU may be replaced, thereby minimizing down time of the computer system.

摘要翻译： 计算机系统包括处理器（2），存储器（4）和多个设备（6,8,12），处理器（2）和存储器（4）可操作以实现故障响应处理器（ AFR）和每个设备的设备驱动程序（GRAPHICS，NETWORK，H2IO，IO2L，SERIAL）。 故障响应处理器（AFR）可操作以产生表示计算机系统的处理器（2），存储器（4）和设备（6,8,12）的模型以及处理器（2）的互连 ），内存（4）和设备（GRAPHICS，NETWORK，H2IO，IO2L，SERIAL）。 随着设备的运行状态的改变，布置了每个设备（6,8,12）的设备驱动程序（GRAPHICS，NETWORK，H2IO，IO2L，SERIAL），以产生指示是否改变 状态是在设备内部或外部由另一个连接的设备引起的。 计算机系统的装置可以形成为多个现场可更换单元（FRU）。 故障响应处理器（AFR）可以在从设备驱动程序（GRAPHICS，NETWORK，H2IO，IO2L，SERIAL）接收到故障报告后进行操作，以通过将故障指示应用于故障指示来估计包含故障设备的FRU的位置 模型。 在其他实施例中，故障报告数据包括指示引起外部故障的设备与另一连接设备之间的连接的方向信息。 识别出故障设备后，可以更换FRU，从而最大程度减少计算机系统的停机时间。

公开(公告)号：US06550017B1

公开(公告)日：2003-04-15

申请号：US09343146

申请日：1999-06-29

申请人： Hossein Moiin ,  Peter Martin Grant Dickinson

发明人： Hossein Moiin ,  Peter Martin Grant Dickinson

IPC分类号： G06F1100

CPC分类号： G06F11/2007 ,  G06F11/0757 ,  G06F11/3006 ,  G06F11/3051 ,  G06F11/3055 ,  G06F2201/88

摘要： A system and method for monitoring a distributed fault tolerant computer system. A hardware counter mechanism (e.g. a countdown counter) is reset repeatedly by a software reset mechanism during normal operation, thereby preventing the counter mechanism from reaching a count indicative of the existence of a fault. A unit provides a signal to a bus indicative of the status (ON or OFF) of the unit. A management subsystem defines a configuration for the distributed fault tolerant computer system. The management subsystem is responsive to status signals on the bus and selectively reconfigures a stored representation in response to changing status signals on the bus.

摘要翻译： 一种用于监控分布式容错计算机系统的系统和方法。 硬件计数器机构（例如倒数计数器）在正常操作期间由软件复位机构重复复位，从而防止计数器机构达到指示故障存在的计数。 单元向指示单元的状态（ON或OFF）的总线提供信号。 管理子系统定义了分布式容错计算机系统的配置。 管理子系统响应于总线上的状态信号，并响应于总线上的状态信号的变化而有选择地重新配置存储的表示。

公开(公告)号：US06192483B1

公开(公告)日：2001-02-20

申请号：US08967341

申请日：1997-10-21

申请人： Hossein Moiin ,  Angelo Pruscino

发明人： Hossein Moiin ,  Angelo Pruscino

IPC分类号： G06F1114

CPC分类号： G06F11/1425 ,  G06F11/0757 ,  G06F11/076

摘要： Data integrity and availability is assured by preventing a node of a distributed, clustered system from accessing shared data in the case of a failure of the node or communication links with the node. The node is prevented from accessing the shared data in the presence of such a failure by ensuring that such a failure is detected in less time than a secondary node would allow user I/O activities to commence after reconfiguration. The prompt detection of failure is assured by periodically determining which configuration of the current cluster each node believes itself to be a member of Each node maintains a sequence number which identifies the current configuration of the cluster. Periodically, each node exchanges its sequence number with all other nodes of the cluster. If a particular node detects that it believes itself to be a member of a preceding configuration to that to which another node belongs, the node determines that the cluster has been reconfigured since the node last performed a reconfiguration. Therefore, the node must no longer be a member of the cluster. The node then refrains from accessing shared data. In addition, if a node suspects a failure in the cluster, the node broadcasts a reconfigure message to all other nodes of the cluster through a public network. Since the messages are sent through a public network, failure of the private communications links between the nodes does not prevent receipt of the reconfigure messages.

摘要翻译： 通过防止分布式集群系统的节点在节点故障或与节点的通信链路的情况下访问共享数据来确保数据完整性和可用性。 通过确保在比辅助节点更少的时间内检测到这样的故障将允许在重新配置之后开始用户I / O活动，节点被阻止在存在这种故障的情况下访问共享数据。 通过周期性地确定当前集群的哪个配置，每个节点认为自己是每个节点的成员来确保故障的迅速检测，维护一个标识集群当前配置的序列号。 定期地，每个节点将其序列号与簇的所有其他节点交换。 如果特定节点检测到它认为自己是与另一个节点所属于的先前配置的成员，则该节点确定该簇已经被重新配置，因为节点上次执行重新配置。 因此，节点不能再是群集的成员。 节点然后禁止访问共享数据。 另外，如果节点怀疑群集中的故障，则节点通过公共网络向群集的所有其他节点广播重新配置消息。 由于消息是通过公共网络发送的，节点之间的专用通信链路的故障不会阻止接收到重新配置消息。