NFRL:一种分布系统的实时容错调度算法

在硬实时系统的应用中,如果硬实时任务不能在规定的时限完成,将会产生人员伤亡, 失等严重后果,为了保证在系统出错的情况下,硬实时任务仍然在能戴止时限之前完成,必须研究实时容错技术。本文从实时容错调度算法的角度出发,提出一种基于分布式系统的实时容错调度算法,并研究了该算法的时间复杂度,同时给出一个实例说明该容错调度算法的调度过程。这种容错调算法称为“无容错需求后调度算法（ＮＦＲＬ）,该实时容错调度算法     

异构分布式控制系统中实时任务的调度算法

分布式控制系统是一种应用极为广泛的异构分布式实时系统，系统中同时存在有多种实时任务，如何将这些任务分配到各个处理器上并保证它们的时限是系统关键技术之一．在结合启发式任务分配算法和单处理器任务调度算法的基础上，提出了一种分布式控制系统的调度算法．该算法考虑了各个处理器的负载均衡，同时又能满足所有任务的时限．仿真结果表明了算法的有效性．     

副版本不可抢占的全局容错调度算法

容错是硬实时系统的关键能力,容错调度算法可以在有错误发生的情况下满足任务的实时性需求.在主副版本机制的容错调度算法中,主版本出错后留给副版本运行的时间窗口小,副版本容易错失截止期.针对副版本需要快速响应的问题,提出副版本不可抢占的全局容错调度算法FTGS-NPB（fault-tolerant global scheduling with non-preemptive backups）,赋予副版本全局最高优先级,使副版本在主版本出错后可以立刻获得处理器资源,并且在运行过程中不会被其他任务抢占.这样,副版本可以在最短时间内响应.分别基于截止期分析和响应时间分析建立了FTGS-NPB的可调度性测试,并分析了两种可调度性测试分别适用于不同的优先级分配算法.仿真实验结果表明,FTGS-NPB可以有效地减少实现容错的代价.     

REDUCING CONTROL LATENCY AND JITTER IN REAL‐TIME CONTROL

This paper analyses control computation latency and jitter, which have been largely ignored in the control community for real‐time (RT) control. The focus is on RT control systems with multiple control tasks running on a uniprocessor. Three strategies are proposed to reduce control latency and/or jitter: introduction of offsets into control task scheduling, decomposition of control tasks; and increasing the priority levels of output subtasks. Examples are given to demonstrate the effectiveness of the proposed methods.     

Data‐aware task scheduling on heterogeneous hybrid memory multiprocessor systems

In this paper, we propose a method about task scheduling and data assignment on heterogeneous hybrid memory multiprocessor systems for real‐time applications. In a heterogeneous hybrid memory multiprocessor system, an important problem is how to schedule real‐time application tasks to processors and assign data to hybrid memories. The hybrid memory consists of dynamic random access memory and solid state drives when considering the performance of solid state drives into the scheduling policy. To solve this problem, we propose two heuristic algorithms called improvement greedy algorithm and the data assignment according to the task scheduling algorithm, which generate a near‐optimal solution for real‐time applications in polynomial time. We evaluate the performance of our algorithms by comparing them with a greedy algorithm, which is commonly used to solve heterogeneous task scheduling problem. Based on our extensive simulation study, we observe that our algorithms exhibit excellent performance and demonstrate that considering data allocation in task scheduling is significant for saving energy. We conduct experiments on two heterogeneous multiprocessor systems. Copyright © 2016 John Wiley & Sons, Ltd.     

Fault-tolerance through scheduling of aperiodic tasks in hardreal-time multiprocessor systems

Real time systems are being increasingly used in several applications which are time critical in nature. Fault tolerance is an important requirement of such systems, due to the catastrophic consequences of not tolerating faults. We study a scheme that provides fault tolerance through scheduling in real time multiprocessor systems. We schedule multiple copies of dynamic, aperiodic, nonpreemptive tasks in the system, and use two techniques that we call deallocation and overloading to achieve high acceptance ratio (percentage of arriving tasks scheduled by the system). The paper compares the performance of our scheme with that of other fault tolerant scheduling schemes, and determines how much each of deallocation and overloading affects the acceptance ratio of tasks. The paper also provides a technique that can help real time system designers determine the number of processors required to provide fault tolerance in dynamic systems. Lastly, a formal model is developed for the analysis of systems with uniform tasks     

一种基于多处理机的容错实时任务调度算法

容错是实时系统的重要要求,在实时系统中,若一个实时任务没在规定的时间期限内完成,则认为系统出现错误,针对多处理机实时系统提出了一种容错调度算法．算法采用了任务的主从备份技术和Ｆｉｒｓｔ－ｆｉｔ启发式方法,通过为可能因处理机故障而执行失败的实时任务预留重新运行的时间来实现容错功能;并通过对预留时间段的重叠利用和无错时预留时间的回收分配,来提高处理机的利用率和系统对任务的接收率．模拟结果表明算法是有效     

Mach3.0面向对象I／O系统

为了设计和实现嵌入式实时操作系统ＣＯＳＩＸＶ２．０／ＲＴ平台,我们对Ｍａｃｈ３．０操作系统微内核有关设备管理的源程序进行剖析。在Ｉ／Ｏ管理系统中,Ｍａｃｈ３．０采用端口和消息机制,它的Ｉ／Ｏ接口支持的设备驱动程序独立于设备。独立于位置,并且是在用户级实现的。它的面向对象设计使得代码的共享程度更高,减少了
了依靠硬件设备的代码量,提高了系统的可扩充性和可移植性。     

MINIMIZING SERVICE DELAY OF APERIODIC TASKS IN DYNAMIC‐PRIORITY NON‐PREEMPTIVE HARD REAL‐TIME SYSTEMS

A scheduling technique is presented to minimize service delay of aperiodic tasks in hard real‐time systems that employ dynamic‐priority scheduling and do not allow task preemption. In a real‐time scheduling process, the execution of periodic tasks can be deferred as long as this does not cause other tasks to violate their time constraints. However, aperiodic tasks that usually have urgent missions should complete execution as early as possible. In this paper, it is assumed that aperiodic tasks also have time constraints. Thus, the problem of deciding whether an aperiodic task with an unpredictable arrival time can be scheduled successfully or not is difficult to solve because delaying periodic tasks may cause them to fail to meet their time constraints. We present a dynamic scheduling technique to solve this problem which makes use of the symmetric property of a schedule. The maximum possible idle slot is always reserved at every scheduling point so that aperiodic tasks can be serviced immediately if the reserved idle slot is big enough to service them. The proposed technique also maximizes utilization of idle slots by reserving them for the longest possible time span.     

Improving responsiveness of time‐sensitive applications by exploiting dynamic task dependencies

In this paper, a mechanism is presented for reducing priority inversion in multiprogrammed computing systems. Contrary to well‐known approaches from the literature, this paper tackles cases where the dependency relationships among tasks cannot be known in advance to the operating system. The presented mechanism allows tasks to explicitly declare aforementioned relationships, enabling the operating system scheduler to take advantage of such information and trigger priority inheritance, resulting in reduced priority inversion. We present the prototype implementation of the concept within the Linux kernel in the form of modifications to the standard Portable Operating System Interface (POSIX) condition variable code, along with an extensive evaluation, including a quantitative assessment of the benefits for applications making use of the technique and comprehensive overhead measurements. In addition, we present an associated technique for the theoretical schedulability analysis of a system using the new mechanism, which is useful to determine whether all tasks can meet their deadlines or not, in the specific scenario of tasks interacting only through remote procedure calls and under partitioned scheduling.     

Simulation of resource synchronization in a dynamic real‐time distributed computing environment

Today, more and more distributed computer applications are being modeled and constructed using real‐time principles and concepts. In 1989, the Object Management Group (OMG) formed a Real‐Time Special Interest Group (RT SIG) with the goal of extending the Common Object Request Broker Architecture (CORBA) standard to include real‐time specifications. This group's most recent efforts have focused on the requirements of dynamic distributed real‐time systems. One open problem in this area is resource access synchronization for tasks employing dynamic priority scheduling. This paper presents two resource synchronization protocols that the authors have developed which meet the requirements of dynamic distributed real‐time systems as specified by Dynamic Scheduling Real‐Time CORBA (DSRT CORBA). The proposed protocols can be applied to both Earliest Deadline First (EDF) and Least Laxity First (LLF) dynamic scheduling algorithms, allow distributed nested critical sections, and avoid unnecessary runtime overhead. In order to evaluate the performance of the proposed protocols, we analyzed each protocol's schedulability. Since the schedulability of the system is affected by numerous system configuration parameters, we have designed simulation experiments to isolate and illustrate the impact of each individual system parameter. Simulation experiments show the proposed protocols have better performance than one would realize by applying a schema that utilizes dynamic priority ceiling update. Copyright © 2004 John Wiley & Sons, Ltd.     

分布式实时系统的容错调度算法

提出了两种分布式实时容错调度算法：副版本后调度算法（ＢＫＣＬ）及无容错需求后调度算法（ＮＦＲＬ）,并研究了算法的时间复杂度,这两种容雕工算法能同时调度具有容错需求的实时任务和无容错需求的实时任务,ＢＫＣＬ和ＮＦＲＬ所产生的调度可保证：在分布式系统中一个节点机失效的情况下,具有容错需求的实时任务仍然可在截止时间内完成,在描述了两个实时容错调度算法之后,分别证明了这两个算法的容错调度正确性。接着,阐述     

RT—Mach：基于Mach的实时微内核

ＲＴ－Ｍａｃｈ是ＣＭＵ在原标准Ｍａｃｈ微内核之上开发的实时微内核，它的目标是提供一个公用的实时计算环境。与Ｍａｃｈ相比，ＲＴ－Ｍａｃｈ增加了实时线程模型、实时同步、实时调度、实时时钟和计时器，以及实时ＩＰＣ等新特点，本文将介绍ＲＴ－Ｍａｃｈ的这些新特点。     

异构分布式实时系统中对具有前后依赖关系任务的基于动态可变调度距离容错调度算法

目前的主副版本容错调度算法大多没有考虑任务间的前后依赖关系,但实际中很多任务是具有前后依赖关系的。本文提出了一种基于主副版本动态可变调度距离的任务容错调度算法,该技术通过比较任务间的最晚开始执行时间与最早开始执行时间的差值,安排任务副版本的调度,并且基于此设计了可用于具有前后依赖关系任务调度可重叠技术。本文提出的基于动态可变调度距离的容错调度算法在尽可能让任务最早完成的情况下,提高系统的可靠性,并且优先调度关键路径任务,降低了系统的容错开销。最后通过实验证明本文算法的有效性和优异性。     

Observer‐based fault diagnosis and self‐restore control for systems with measurement delays

The problems of fault diagnosis and fault‐tolerant control are considered for systems with measurement delays. In contrast to the present fault diagnosis and fault‐tolerant control approaches, which consider only the input delay and/or state delay, the main contribution of this paper consists of proposing a new observer‐based reduced‐order fault diagnoser construction approach and a design approach to dynamic self‐restore fault‐tolerant control law for systems with measurement delays. First, the time‐delay system is transformed into a delay‐free system in form by a special functional‐based delay‐free transformation approach for measurement delays. Then, the fault diagnosis is realized online via the proposed reduced‐order fault diagnoser. Using the results of fault diagnosis, two dynamic self‐restore control laws are designed to make the system isolated from faults. A numerical example demonstrates the feasibility and validity of the proposed scheme. © 2012 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Frequency‐dependent fault detection for networked systems under uniform quantization and try‐once‐discard protocol

This paper is concerned with the frequency‐dependent fault detection scheme for networked systems under uniform quantization and try‐once‐discard protocol scheduling. By considering the communication constraint and the data node scheduling, a switched system is firstly modeled to characterize the dynamic features of the whole system. The switching function of the derived system is determined by the try‐once‐discard protocol. For this class of system, a sufficient condition to ensure the exponentially ultimately boundedness is established. With the aid of some novel analysis processes, sufficient conditions to characterize the desired finite frequency performances, which transform the frequency‐domain restrictions into time‐domain conditions, are subsequently developed. Then, the fault detection filters corresponding to the transmission nodes are synthesized by solving an optimization problem. Finally, an application to VTOL aircraft is presented to illustrate the effectiveness of the proposed fault detection strategy.     

分时EDF算法及其在多媒体操作系统中的应用

提出了一种新的CPU调度算法－－分时EDF（Earliest Deadine First)算法,该算法能保证硬实时任务不丢失死线,并易于在分时系统中实现。以分时EDF算法为基础,提出一种新的CPU层次调度算法－－HRFSFQ,该算法用于多媒体操作系统时能保证各类任务的QoS。最后通过大量实验证明了上述算法的有效性和正确性。     

Novel MPC‐Based Fault Tolerant Tracking Control Against Sensor Faults

The problem of active fault‐tolerant tracking control with control input and system output constraints is studied for a class of discrete‐time systems subject to sensor faults. A time‐varying fault‐tolerant observer is first developed to estimate the real system state from the faulty sensor output and control input signals. Then by using the estimated state at each time step, a model predictive control (MPC)‐based fault‐tolerant tracking control scheme is presented to guarantee the desired tracking performance and the given input and output constraints on the faulty system. In comparison with many existing fault‐tolerant MPC methods, its main contribution is that the proposed state estimator is designed by the simple and online numerical computation to tolerate the possible sensor faults, so that the regular MPC algorithm without fault information can be adopted for the online calculation of fault‐tolerant control signal. The potential recursive infeasibility and computational complexity due to the faults are avoided in the scheme. Additionally, the closed‐loop stability of the post‐fault system is discussed. Simulative results of an electric throttle control system verify the effectiveness of the proposed method.