论文部分内容阅读
本文提出了在总线型局部网络结构的分布式系统中，针对单节点机发生故障的情况下，以进程间的通讯关系来设置断．点的方法，建立相应的进程通讯关系表，从而提出一种新颖的系统恢复算法。该算法的主要思想是：若某节点机发生故障，则该节点机上的进程为坏进程故要根据其它节点机上相关进程的通讯关系表，得出回卷的位置，以使进程通讯关系表恢复到一致状态。在本算法中，回卷时所要作废的通讯总次数最大为Ｕ—Ｕｑ１＋１，它的算法复杂度最大为：Ｏ（ｍ２）。
In this paper, we propose to set up a break in the communication between the processes in a distributed system with a bus-based local network structure in the case of a single node machine failure. Point of the method, the establishment of the corresponding process communication relationship table, thus proposed a novel system recovery algorithm. The main idea of the algorithm is: if a node machine fails, the process on the node machine is a bad process, so it is based on the communication relationship table of other nodes on the relevant process, draw the location of the rewind so that the process of communication relationship table recovery To a consistent state. In this algorithm, the maximum total number of communication to be discarded during rewinding is U-Uq1 + 1, and its maximum algorithm complexity is: O (m2).