一种基于自适应复制的多Agent容错模型

为了构造和部署大规模的多agent系统,人们必须找到并解决其基本问题,其中之一就是可能存在的局部性系统故障。这也就意味着,容错对于大规模多agent系统来说,是一个无法回避的主题。文中讨论了这类问题并且提出了一种多agent系统的容错方法。最先的想法是将复制策略运用到agent中,对处于危急状态的agent进行复制从而避免系统故障,但是由于agent的危急性会在执行过程中演变,并且agent的可用资源是绑定的,所以需要动态以及自动地调整agent的复制体个数,从而最大化它们的作用和可靠性。文中将描述评估某个agent危险性的方法以及相关机制,并且决定使用何种策略(如:主动复制,被动复制)以及如何将其参数化(如:复制的个数)。     

基于残差正交判别的UPF容错算法

从改进提议分布的成片野值容错能力入手，提出了基于残差正交判别的UPF容错滤波算法，该算法将残差正交判别法UKF的野值自适应性和粒子滤波的“适者生存性”有机地结合起来．通过非线性状态估计的实验，证实了这种新的自适应粒子滤波对成片野值处理的有效性，     

基于裂痕故障块的自适应容错路由表算法

基于裂痕故障块的二维网格自适应容错路由算法是一种有效的容错算法,不仅能够解决活锁问题,而且克服了传统故障块模型中状态良好的节点不能参与路由的缺陷,但同时具有明显的缺点：每次路由到以故障块边界节点为根节点的内部树时,都需要遍历此内部树,因此算法的路由长度并不是最短的。针对上述问题,提出基于裂痕故障块的自适应容错路由表算法,其中路由表由裂痕故障块内部树上的节点创建,通过路由表上保留的有用消息决定是否遍历内部树。实验结果证明,随着网格规模的扩大,该算法最大可减少70％的平均路由长度,并且其实现简单,可以有效地延长网络寿命。     

无线传感器网络中2-连通k-支配的容错连通支配集构造

无线传感器网络可采用连通支配集的虚拟骨干技术使平面网络层次化,但传感器节点的失效和链路的断裂会导致网络失败,虚拟骨干网最好具有容错性好、可靠性高的特性.对此,提出具有容错性的2-连通 -支配集的构造算法,以节点自身和邻域信息分布式地构造 -支配节点,利用最小生成树和块-割点图将 -支配节点2-连通.理论分析和实验仿真表明此算法具有较好的算法性能比,在中等规模网络中会产生更少的具有容错性的 -支配节点,可节省传感器节点的能量消耗和网络的通信开销.     

Fault-tolerance in balanced sorting networks

Much research has been done on sorting networks but there are very few results concerning their robustness. Our starting point is the balanced sorting network introduced by Dowd et al. and its single-block robust design of Rudolph obtained at the cost of some redundancy and two permuters external to the network. In this article we introduce a new implementation which is more robust than Rudolph's network and needs no redundancy or external permuters. We also consider a class of single-stage designs with redundancy and compare the characteristics of networks discussed.     

Increasing processor utilization in hard-real-time systems with checkpoints

Often hard real-time systems require results that are produced on time despite the occurrence of processor failures. This paper considers a distributed system where tasks are periodic and each task occurs in multiple copies which are periodically synchronized in order to handle failures. The problem of preemptively scheduling a set of such tasks is discussed where every occurrence of a task has to be completely executed before the next occurrence of the same task. First, a static scheduling algorithm is proposed which uses periodic checkpoints to tolerate processor failures. Then, the performance of the algorithm is substancially improved employing a mixed strategy which constructs a schedule where high frequency tasks are duplicated, and low frequency tasks are periodically checkpointed. The performance of the solution proposed is evaluated in terms of the minimum achievable processor utilization due to the useful computation of the tasks. Moreover, analytical and simulation studies are used to reveal interesting trade-offs associated with the scheduling algorithm. In particular, if high frequency tasks are less than 70 percent of the total number of tasks then the mixed strategy yields a higher processor utilization than the task duplication scheme.     

TDC3000三重化冗余容错集成控制系统在重油催化装置的应用

介绍了TDC3000三重化冗余容错集成控制系统在压缩机机组控制系统方面的应用，该系统利用主从处理器、信号输入模块到信号输出及中间处理过程完全三熏化冗余的硬件，且利用PLC编程技术进行软件编程，实现对压缩机机组的集中统．控制，包括机组的调速、防喘振、速度与防喘振控制之间的解耦控制及压缩机组的停车联锁等。该系统在玉门炼油厂重油催化装置主风机及烟机控制方面获得了成功应用，取得了显著的经济效益。     

容错数字信号处理系统的设计方法及实现

高物可靠性的信号处理对于并行处理器的高速实时应用越来越重要。已知在状态空间模型下线性数字信号处理算法可以表示秋为阵与矢量乘积形式，在该模型下，我们假设同一种运算在主计算过程中具有相同的错误概率，即计算过程是珠，并利用矩阵划分的方法提出一种具有纠错能力的容错设计方案。