航空电子全双工交换式以太网故障注入方法研究

航空电子全双工交换式以太网(AFDX)是成功应用于新一代大型飞机的新型航空数据总线.针对AFDX适航性及网络容错性能研究的需要,开展了有关AFDX网络故障注入方法的研究.在AFDX实验系统上,通过软件方法进行动态故障注入,测试AFDX网络对注入故障的响应,验证了AFDX网络的可靠性、健壮性及容错性能,并为进一步研究AFDX网络性能及故障诊断提供了大量测试数据,对深入开展AFDX适航技术研究打下了基础.     

不完备XML信息系统的粗糙集模型

随着XML成为网络信息表示和交换的标准以及不确定数据的广泛存在,不确定XML数据库管理技术成为了当今研究的热点。首先,允许XML文档叶子节点的信息值为丢失的或遗漏的空值,提出不完备的XML信息系统;其次,提出节点的相容关系、限制相容关系以及阈值相容关系等概念,基于粗糙集理论分别定义这3种关系对应的粗糙集模型;最后,通过实例分析表明,限制相容关系模型能克服相容关系模型分类粗糙的缺点,阈值相容关系模型通过合理地设置阈值可达到更好的分类效果,从而提高了对XML数据的预测、分类的精确度。     

改进的对象间差异度的限制容差关系模型

不完备信息系统不能直接用经典的粗糙集理论来处理,为此,容差关系、非对称相似关系、限制容差关系、限制非对称相似关系、对象间差异度的限制非对称相似关系等扩充的粗糙集模型被相继提出。通过分析这些模型的优点和不足之处,定义了新的对象间差异度,提出了一种改进的对象间差异度的限制容差关系模型,实例结果表明基于所提出模型的划分更精确,更符合实际。     

无线传感器网络中故障容忍算法研究

针对无线传感器维护困难,改善故障容忍能力的问题,提出了一种基于故障容忍度的自适应容错拓扑控制算法。首先,阐述了节点故障容忍度衡量指标,其次,详细分析了算法的各个阶段,最后通过仿真实验与常用算法对比,结果表明,基于故障容忍度的自适应容错拓扑控制算法具有更好的控制效果,极大地提高了使用效率。     

装配公差综合领域本体知识库的构建

为了减少机械产品设计过程中的不确定性,解决装配公差信息在异构CAX系统中共享性差和传递不畅的问题,利用本体丰富的语义知识和语法结构,通过分析装配公差综合领域相关知识,采用网络本体语言OWL定义其中的概念和关系,并采用语义网规则语言SWRL定义其中的约束条件和分配经验。将基于OWL的结构化知识转换成事实、基于SWRL的约束化知识转换成规则,并在推理引擎的基础上构建装配公差综合领域本体知识库。同时开发了基于本体的装配公差综合原型系统,实现了装配公差类型和装配公差值的自动生成。     

网口容错在嵌入式设备中的设计与实现

针对嵌入式网络设备的服务可靠性问题,现有的网口容错主要采用双网卡冗余设计,研究针对单网卡多网口的情况,提出了一种网口容错方法,该方法能有效利用系统带宽资源。提出的网口容错方法包括一种网口状态检测机制和故障网口服务数据迁移方法,并设计了相应的功能模块。故障检测模块实现基于Loopback的检测方法,容错处理模块则实现在检测到故障后,可将故障网口的服务负载数据根据迁移策略迁移到其余正常网口。所提出的方法实现了对网口工作状态的快速检测和负载数据的有效容错。该方法具有应用无关性、资源占用率低的特点,通过测试验证了该方法的可行性。     

高可靠分布式容错计算机架构的研究

分布式系统因其具有分散安装、可靠性高、扩展性好、维修成本低、健壮、安全等诸多优点,国内外相继开展分布式计算机高可靠性技术的研究。本文提出了高可靠分布式容错计算机的构架设计思路,并对TTE总线的选用进行了分析论证,重点描述了成员一致性保证和余度同步等关键技术。     

Optimistic Byzantine fault tolerance

The primary concern of traditional Byzantine fault tolerance is to ensure strong replica consistency by executing incoming requests sequentially according to a total order. Speculative execution at both clients and server replicas has been proposed as a way of reducing the end-to-end latency. In this article, we introduce optimistic Byzantine fault tolerance. Optimistic Byzantine fault tolerance aims to achieve higher throughput and lower end-to-end latency by using a weaker replica consistency model. Instead of ensuring strong safety as in traditional Byzantine fault tolerance, nonfaulty replicas are brought to a consistent state periodically and on-demand in optimistic Byzantine fault tolerance. Not all applications are suitable for optimistic Byzantine fault tolerance. We identify three types of applications, namely, realtime collaborative editing, event stream processing, and services constructed with conflict-free replicated data types, as good candidates for applying optimistic Byzantine fault tolerance. Furthermore, we provide a design guideline on how to achieve eventual consistency and how to recover from conflicts at different replicas. In optimistic Byzantine fault tolerance, a replica executes a request immediately without first establishing a total order of the message, and Byzantine agreement is used only to establish a common state synchronization point and the set of individual states needed to resolve conflicts. The recovery mechanism ensures both replica consistency and the validity of the system by identifying and removing the operations introduced by faulty clients and server replicas.     

高可扩展可容错的无网格/粒子程序petaPar及其测试

petaPar 粒子模拟程序面向千万亿次级计算,在统一框架下实现两种广受关注的粒子模拟算法：光滑粒子流体动力学（Smoothed Particle Hydrodynamics,SPH）和物质点法（Material Point Method,MPM)。代码支持多种材料模型、强度模型和失效模型,适合模拟大变形、高应变率和流固耦合问题。支持纯 MPI 和 MPI+X 混合两种并行模型。系统具有可容错性,支持无人值守变进程重启。在Titan 上测试表明,petaPar 可线性扩展到 26 万 CPU 核,SPH 和 MPM 算法并行效率相对 8 192 核分别为 87% 和 90%。     

A fully informed model-based checkpointing protocol for preventing useless checkpoints

Checkpointing and rollback recovery are widely used techniques for handling failures in distributed systems. When processes involved in a distributed computation are allowed to take checkpoints independently without any coordination with each other, some or all of the checkpoints taken may not be part of any consistent global checkpoint, and hence, are useless for recovery. Communication-induced checkpointing algorithms allow processes to take checkpoints independently and also ensure that each checkpoint taken is part of a consistent global checkpoint by forcing processes to take some additional checkpoints. It is well known that it is impossible to design an optimal communication-induced checkpointing algorithm (i.e. a checkpointing algorithm that takes minimum number of forced checkpoints). So, researchers have designed communication-induced checkpointing algorithms that reduce forced checkpoints using different heuristics. In this paper, we present a communication-induced checkpointing algorithm which takes less number of forced checkpoints when compared to some of the existing checkpointing algorithms in its class.