SFT:一个具有较短冻结时间的一致检查点算法

介绍了一个基于消息记录的一致检查点算法－ＳＦＴ算法,ＳＦＴ算法能够实现分布式系统的容错,该算法具有无多米诺效应,冻结时间短,开销小和重启动算法简单的优点,ＳＦＴ的ＩＰＣ机制基于ＰＶＭ,能够保证消息的有序到达,并且其消息的发送和接收操作都是原子操作,另外,ＩＰＣ机制中进程的ｉｄ值编码与所在机器无关,这样一个过程即使从故障机器迁移到其它机器上运行仍可与其它进程继续通信,为提高检查点操作的并行性,ＳＦＴ     

Garbage collection in uncoordinated checkpointing algorithms

In this paper,the hard problem of the thorough garbage collection in uncoordinated checkpointing algorithms is studied.After introduction of the traditional garbage collecting scheme,with which only obsolete checkpoints can be discarded,it is shown that this kind of traditional method may fail to discard any checkpoint in some special cases,and it is necessary and urgent to find a thorough garbage collecting method,with which all the checkpoints useless for any future rollback-recovery including the obsolete ones can be discarded.Then,th Thorough Garbage Collection Theorem is proposed and proved,which ensures th feasibility of the thorough garbage collection,and gives the method to calculate the set of the useful checkpoints as well.     

A new approach for high performance computing systems with various checkpointing schemes

Roll-forward recovery schemes were proposed to enhance the performance of fault tolerant systems employing checkpointing approach. In the roll-forward schemes, multiple processors are used for simultaneous roll-forward and validation processing. This paper proposes thesample comparison approach along with the checkpointing, which further improves the performance by reducing the overhead imposed by the checkpointing. We also develop general analytical models for estimating the availability, which are applicable for any checkpointing scheme. Performance comparisons reveal that the availabilities of the checkpointing schemes with sample comparison are higher than those of the schemes without it, while the required checkpoint interval is larger. This research was supported in part by the MIC (Ministry of Information and Communication), Korea, under the ITRC support program supervised by the UTA and CUCN 21st Century Frontier R&D Program.     

FINE: A Fully Informed aNd Efficient communication-induced checkpointing protocol for distributed systems

Communication-Induced Checkpointing (CIC) protocols are classified into two categories in the literature: Index-based and Model-based. In this paper, we discuss two data structures being used in these two kinds of CIC protocols, and their different roles in helping the checkpointing algorithms to enforce Z-cycle Free (ZCF) property. Then, we present our Fully Informed aNd Efficient (FINE) communication-induced checkpointing algorithm, which not only has less checkpointing overhead than the well-known Fully Informed (FI) CIC protocol proposed by Helary et al. but also has less message overhead. Performance evaluation indicates that our protocol performs better than many of the other existing CIC protocols.     

分布式系统的时间同步容错机制研究

网络化计算和分布式应用,对计算机系统的时间同步精度要求越来越高,高精密时间同步是分布式控制系统一切应用的基础。分布式系统必须建立统一的时间服务系统或时间服务器,以实现系统的时间统一。从时间同步着手,分析了时间同步技术——网络时间协议（NTP）和直接连接时间技术,研究了分布式系统时间同步技术及时间同步容错策略,给出了误差估算方法,并将滑动窗口演算法应用于时间同步容错策略,提出并得到时间校正值的算法,并对同步结果进行了分析。     

基于频率调节的分布式系统时间同步算法设计与实现

为了降低Internet上对NTP时间服务器的访问频率,有效缓解时间服务器资源负担过重的状况,提出了一套适用于分布式系统的基于频率调节的时间同步算法。实验表明,该算法在保障同步精度的前提下,相对于传统的建立在相位调节方式上的时间同步算法,有较好的效果。     

Finite‐time distributed control with time transformation

In this article, we propose distributed control algorithms for first‐ and second‐order multiagent systems for addressing finite‐time control problem with a priori given, user‐defined finite‐time convergence guarantees. The proposed control frameworks are predicated on a recently developed time transformation approach. Specifically, our contribution is twofold: First, a generalized time transformation function is proposed that converts the user‐defined finite‐time interval to a stretched infinite‐time interval, where one can design a distributed control algorithm on this stretched interval and then transform it back to the original finite‐time interval for achieving a given multiagent system objective. Second, for a specific time transformation function, we analytically establish the robustness properties of the resulting finite‐time distributed control algorithms against vanishing and nonvanishing system uncertainties. By contrast to existing finite‐time approaches, it is shown that the proposed algorithms can preserve a priori given, user‐defined finite‐time convergence regardless of the initial conditions of the multiagent system, the graph topology, and without requiring a knowledge of the upper bounds of the considered class of system uncertainties. Illustrative numerical examples are included to further demonstrate the efficacy of the presented results.     

具有O(n)时间复杂度的分布式请求集生成算法

在大规模完全分布式系统的互斥问题上,快速生成请求集是必要的。在基于松弛差集的相关原理上,引入了二次松弛差集的概念。经分析相关概念及定理,将原本“求差”的过程变为“求和”的过程;进而利用 “求和”步骤间的递推关系,大大减少了求和步骤,使整个算法的时间复杂度控制在O(n)。与时间复杂度同为O(n^2)的其他经典算法相比,生成的请求集长度仍保持在2n^(1/2)的数量级。     

传感器网络分簇时间跨度优化聚类算法

针对无线传感器网络（WSN）簇头节点能效低、网络能量负载不均衡问题,提出一种传感器网络分簇时间跨度优化（CTSO）聚类算法。该算法首先在簇头选举方式上关注了簇内成员数量和簇头间距的约束问题,尽可能地避免各个簇之间发生覆盖重叠,优化簇内节点能量;接着对簇头的选举周期进行优化,以任务执行周期大小作为一个时间跨度并分为多个轮,通过最小化簇头选举的轮数来减少用于选择簇头而花费在广播消息上的能量,提升簇头节点的能量利用率。实验仿真结果表明,对比基于多Agent的同质态数据汇聚路由方案以及自适应数据汇聚路由策略,CTSO算法的平均能量效率分别提高了62.0%和138.4%,节点寿命则分别提高了17%和9%。CTSO算法在提升无线传感器网络簇头能效及均衡节点能量上具有较好的效果。     

融合时间和邻域信息的矩阵分解算法

矩阵分解通过降维的方式可以在一定程度上解决数据的稀疏性问题。考虑时间信息可以根据时间信息的变化来预测用户对物品的兴趣趋势。考虑邻域关系可以产生以共同兴趣为基础的推荐。但是,现在所研究的矩阵分解当中很少综合考虑时间信息和邻域关系对用户评分预测的影响。本文提出一种融合时间和邻域信息的矩阵分解算法,此算法把时间信息与领域关系直接映射到用户-物品-时间的三维空间,通过隐含特征直接寻找他们之间的潜在关系。在MovieLens上的实验结果表明,本文提出的推荐算法在一定程度上提高了推荐结果的准确性。     

A Low Overhead Logging Scheme for Fast Recovery in Distributed Shared Memory Systems

This paper presents an efficient, writer-based logging scheme for recoverable distributed shared memory systems, in which logging of a data item is performed by its writer process, instead of every process that accesses the item logging it. Since the writer process maintains the log of data items, volatile storage can be used for logging. Only the readers' access information needs to be logged into the stable storage of the writer process to tolerate multiple failures. Moreover, to reduce the frequency of stable logging, only the data items accessed by multiple processes are logged with their access information when the items are invalidated, and also semantic-based optimization in logging is considered. Compared with the earlier schemes in which stable logging was performed whenever a new data item was accessed or written by a process, the size of the log and the logging frequency can be significantly reduced in the proposed scheme.     

非平衡有向网络下带约束的连续时间分布式优化算法设计EI北大核心CSCD

本文基于权重不平衡有向网络,对一类分布式约束优化问题进行研究,其中全局目标函数等于具有李普希兹梯度的强凸目标函数之和,并且每个智能体的状态都有一个局部约束集.每个智能体仅知道自身的局部目标函数和非空约束集.本文的目标是用分布式方法求解该问题的最优解.针对优化问题,提出了一种新的分布式投影梯度连续时间协调算法,利用拉普拉斯矩阵的零特征值对应的左特征向量消除了图的不平衡性.在某些假设下,结合凸分析理论和李雅普诺夫稳定性理论,证明了算法能够获得问题的最优解.最后,通过仿真验证了算法的有效性.     

有时间窗车辆路径问题的捕食搜索算法

有时间窗车辆路径问题是当前物流配送系统研究中的热点问题,该问题具有NP难性质。难以求得最优解或满意解,在建立有时间窗车辆路径问题数学模型的基础上。设计了一种模仿动物捕食策略的捕食搜索算法．该算法利用控制搜索空间的限制大小来实现算法的局域搜索和全局搜索,具有良好的局部集中搜索和跳出局部最优的能力．通过实例计算,并与相关启发式算法比较．取得了满意的结果．     

ESPSA: A prediction-based algorithm for streaming time series segmentation

Streaming time series segmentation is one of the major problems in streaming time series mining, which can create the high-level representation of streaming time series, and thus can provide important supports for many time series mining tasks, such as indexing, clustering, classification, and discord discovery. However, the data elements in streaming time series, which usually arrive online, are fast-changing and unbounded in size, consequently, leading to a higher requirement for the computing efficiency of time series segmentation. Thus, it is a challenging task how to segment streaming time series accurately under the constraint of computing efficiency. In this paper, we propose exponential smoothing prediction-based segmentation algorithm (ESPSA). The proposed algorithm is developed based on a sliding window model, and uses the typical exponential smoothing method to calculate the smoothing value of arrived data element of streaming time series as the prediction value of the future data. Besides, to determine whether a data element is a segmenting key point, we study the statistical characteristics of the prediction error and then deduce the relationship between the prediction error and the compression rate. The extensive experiments on both synthetic and real datasets demonstrate that the proposed algorithm can segment streaming time series effectively and efficiently. More importantly, compared with candidate algorithms, the proposed algorithm can reduce the computing time by orders of magnitude.     

一种支持时间序列数据的CBR检索算法

探讨了如何为CBR（基于范例的推理）增加对一种特殊的范例类型——时间序列数据的支持．分析了基于谱分析的时间序列相似度比较算法不适用于CBR检索的缺点，并在此基础上设计了一种综合性能很好的CBR检索算法．思路是把时间序列相似度比较转化成一个卷积问题，并用DFT来简化这个卷积的计算．通过对这种CBR检索算法进行了深入的理论分析和认真的实验，结果证明，提出的算法是一个高效的算法．在这个检索算法的基础上，CBR就能够席用到时序数据的分析推理中，具有广阔的应用前景．     

A heuristic algorithm for cube packing with time schedule

Packing problem has been proved to be an NP-hard problem. Many algorithms such as simulation annealing algorithm, genetic algorithm and other heuristic algorithms have been proposed to solve twodimensional and three-dimensional packing problem. To solve the cube packing problem with time schedule, this paper first introduces some concepts such as packing level, space distance and average neighbor birth order and then proposes a greedy algorithm. The algorithm tries every feasible corner greedily to calculat...     

A heat equation for freezing processes with phase change: stability analysis and applications

In this work, the stability properties as well as possible applications of a partial differential equation (PDE) with state-dependent parameters are investigated. Among other things, the PDE describes freezing of foodstuff, and is closely related to the (potential) Burgers’ equation. We show that for certain forms of coefficient functions, the PDE converges to a stationary solution given by (fixed) boundary conditions that make physical sense. These boundary conditions are either symmetric or asymmetric of Dirichlet type. Furthermore, we present an observer design based on the PDE model for estimation of inner-domain temperatures in block-frozen fish and for monitoring freezing time. We illustrate the results with numerical simulations.     

基于super-twisting算法的多航天器姿态有限时间分布式协同控制

针对受外界干扰和执行器故障影响的多航天器姿态协同控制问题,本文设计了一种基于干扰观测器的分布式协同supper-twisting滑模控制器.首先,将各航天器的外界干扰和执行器故障看作一个集总干扰,设计自适应滑模干扰观测器对其进行估计.其次,将supper-twisting算法和积分滑模面相结合,设计一种基于多航天器姿态...     

无线传感器网络时间同步算法研究

时间同步技术是无线传感器网络中非常重要的协议之一,是保证传感器网络中各个节点协同工作的核心机制。根据有无参考节点将时间同步算法分为双向消息交换时间同步算法和分布式一致时间同步算法,其中双向消息同步机制广播消息交换算法和基于ACK帧的时间同步算法。这三类双向消息时间同步算法的时间同步消息发送数目逐级递减,能耗相对应降低;而分布式一致时间同步算法摒弃了参考节点的选择,同时同步所有的传感器节点,避免了参考节点失效而无法进行时钟同步的情况。基于现有研究的分析及归纳,最后给出了时间同步算法未来可能的研究方向。