交换式以太网实时消息可调度性分析

针对交换式以太网不能满足工业数据通信的实时性要求问题,首先提出了一种改进的,在站点和交换机端均使用EDF算法的消息调度模型,并由源站点和目标站点以分布式方式对实时消息在链路的可调度性进行判定,从而简化了交换机的设计.另外,为保证实时消息在交换式以太网传输的实时性,分别给出了实时消息在发送和接收链路的可调度性判定条件,并进行了相应的理论证明.     

一种基于QoS的多任务实时集群系统负载均衡算法

负载均衡算法是多任务实时集群系统的一个关键技术。在分析了常见的轮转式均衡调度算法和任务最少优先法的优缺点基础上,针对实时集群系统处理多类任务的特点,引入了加权负载率的概念来更准确地描述各分布式集群节点的负载状况。提出了通过任务QoS映射为负载权值的思想,并给出了一种改进的任务最少优先算法——加权负载率最小法,描述了以加权负载率表为核心的多任务均衡调度算法。最后,通过仿真验证了该算法明显优于前两种算法。     

无线移动网络环境中混合式任务调度策略的研究与实现

无线移动网络具有性能不稳、易受外界干扰等特点,要求实时调度必须考虑网络变化影响.因为网络性能变化可直接导致网络延时变化,即任务耗费在网络传输上的时间发生变化,从而对任务集可调度性产生影响.传统调度算法大多未考虑网络因素.由此提出适应于网络性能不稳定环境下的混合式任务调度策略,测试结果表明该策略有利于提高混合实时任务在网络性能动态变化环境下的可调度性.     

面向容错的对地观测卫星实时任务调度研究

提出一种面向容错的对地观测卫星任务调度模型,该模型采用主版本/副版本技术可以实现对任意时刻一颗卫星失效时的容错.在容错调度模型的基础上,提出了一种卫星容错调度算法FTSS.FTSS采用重叠技术,有效提高了卫星资源利用率.此外,FTSS采用了任务合成策略可以有效减少实际执行任务的个数从而进一步提高系统的可调度性.为了验证FTSS算法的性能,本文通过模拟实验对FTSS与其它3个基准算法进行了比较分析.实验结果表明FTSS优于其它算法,适合卫星实时任务容错调度.     

EDF调度算法抢占行为的研究及其改进

通过对采用抢占式EDF算法的嵌入式系统中各实时任务抢占行为的分析,建立了一个周期性任务集的抢占模型,从数学上描述了抢占关系、可调度性、调度开销与实时任务的周期、执行时间、最终期限、启动时间等属性之间的关系.依据该抢占模型,提出了一个改进的抢占式EDF调度算法,通过将基于遗传算法的优化方法离线计算得到的实时任务启动时间作为目标系统的一个调度参数,减少抢占次数,改变抢占关系,从而提高系统的可调度能力和实时性能.最后用实验验证了改进的抢占式EDF调度算法的有效性.     

硬实时系统中基于任务同步及节能的动态调度算法

提出基于任务同步及节能的动态实时调度算法HDSA(hybrid dynamic scheduling algorithm),以有效地解决任务同步及节能的难题.HDSA 结合RM及EDF算法,在满足任务实时可调度性及任务同步的限制条件下,采用DVFS节省能耗.HDSA包含静态算法及动态算法两部分.静态算法在静态条件下,求出任务的静态速度.动态调度算法在实际运行中,固定临界区的运行速度,并充分回收、利用任务运行时的空闲执行时间,调节处理器的速度,以有效降低能耗并满足实时可调度性.同时避免高优先权任务被阻塞时,临界区继承高优先权任务的速度时所造成的处理器电压开关的频繁切换,因而能有效地降低实时任务调度的成本.实验测试表明,HDSA在调度性能上明显优于目前所知的有效算法.     

异构多处理器系统的混合任务调度算法

针对实时异构系统的任务调度问题,提出了一种异构多处理器系统的混合实时任务调度算法.该算法采用带有非周期服务器的EDF( Earliest Deadline First)算法来调度单处理器上的任务集,可充分利用处理器的计算带宽.采用启发式搜索算法来进行任务的分配,以最大剩余计算带宽为搜索指标,可确保各处理器的负载尽量平衡...     

一种改进的强分区约束的实时调度算法

研究了实时操作系统在强分区约束下的两级分区的调度问题,建立了基于时钟触发的两级分区调度算法的模型.重点论述了调度开销和分区分配方法对系统可调度性的影响,并进一步改进了算法.仿真分析证实,改进的算法能够更好地保障系统的可调度性.     

系统程序、操作系统

0013486基于确定周期性任务的进程管理及可调度性分析[刊]/陈劲林//计算机研究与发展.—2000,37(3).—307～312(D)文中讨论了基于确定周期性任务的实时系统进程管理,对确定周期性任务采用调度器生成的管理方式;通过截止期递增分类法将非周期性任务分为两类,分别采用中断内抢占调度和信号调度,提出了改进的最大紧急度优先算法,分析了目标系统的可调度性,给出了其可调度的充要条件。     

网络资源的均衡化调度算法研究

针对传统轮询算法对网络资源的均衡化调度存在负载均衡性差、网络资源浪费严重以及资源调度效果差的问题,提出一种新的网络资源均衡化调度算法。基于网络资源的均衡化算法运行过程,设计异构集群的并行计算熵的计算矩阵,实现虚拟机的调度,对调度目标的物理节点进行分析,完成网络资源多线程负载均衡调度。采用基于处理时间的网络资源负载动态均衡算法,对每个物理节点建立负载调度机制,使物理节点按照内部最优调度方式实施均衡调度,实现对网络资源的均衡化调度。实验结果表明,所提算法的调度效率高,且具有较高的负载均衡稳定性,可以减少网络资源的浪费,增强网络资源的调度效果。     

校园计算网格作业自适应调度的研究和实现

由于网格资源具有分布、异构、动态、自治等特性。使得网格作业调度成为网格计算中具有挑战性的任务之一。针对校园高性能计算资源负载不均衡、管理模式不统一的问题，提出了校园计算网格自适应调度系统的解决方案。详细研究了网格作业的白适应调度技术，设计了含有负载均衡能力的资源动态信息收集模型，并给出自适应调度算法。实现了校园范围内高性能计算资源的负载均衡和统一的资源管理。     

Reliability analysis of real-time fault-tolerant task models

One notable advantage of Model-Driven Architecture (MDA) method is that software developers could do sufficient analysis and tests on software models in the design phase, which helps construct high confidence on the expected software behaviors and performance, especially for safety-critical real-time software. Most existing literature of reliability analysis ignores the effects from those deadline requirements of tasks which are critical properties for real-time software and thus cannot be ignored. Considering the contradictory relationship between the deadline requirements and time costs of fault tolerance in real-time tasks, in this paper, we present a novel reliability model, which takes schedulability as one of the major factors affecting the reliability, to analyze reliability of the task execution model in real-time software design phase. The tasks in this reliability model has no restrictions on their distributions and thus could be distributed on a multiprocessor or on a distributed system. Furthermore, the tasks also define arrival rates of faults and fault-tolerant mechanisms to model the occurrences of non-permanent faults and the corresponding time costs of fault handling. By analyzing the probability of tasks still being schedulable in the worst-case execution scenario with faults occurring, reliability and schedulability are combined into an unified analysis framework, and two algorithms for reliability analysis are given. To make this reliability model more pragmatic, we also present an estimation technique for estimating the fault arrival rate of each task. We show through two case studies respectively the detailed derivation process under static-priority scheduling in a multiprocessor system and in the design process of avionics software, and then analyze the factors affecting the reliability analysis by setting up simulation experiments. When no assumptions of fault occurrences made on the task model, this reliability model regresses to a generic schedulability model.     

Providing Real-Time Applications With Graceful Degradation of QoS and Fault Tolerance According to$(m, k)$-Firm Model

The$(m, k)$-firm model has recently drawn a lot of attention. It provides a flexible real-time system with graceful degradation of the quality of service (QoS), thus achieving the fault tolerance in case of system overload. In this paper, we focus on the distance-based priority (DBP) algorithm as it presents the interesting feature of dynamically assigning the priorities according to the system's current state (QoS-aware scheduling). However, DBP cannot readily be used for systems requiring a deterministic$(m, k)$-firm guarantee since the schedulability analysis was not done in the original proposition. In this paper, a sufficient schedulability condition is given to deterministically guarantee a set of periodic or sporadic activities (jobs) sharing a common non-preemptive server. This condition is applied to two case studies showing its practical usefulness for both bandwidth dimensioning of the communication system providing graceful degradation of QoS and the task scheduling in an in-vehicle embedded system allowing fault tolerance.     

一个面向嵌入式系统实时性能优化的抢占模型

通过对采用RM调度策略的实时嵌入式系统抢占行为的分析，建立了一个周期性实时任务集的抢占模型，从数学上定量地刻画了因抢占而导致的额外开销与系统中各实时任务属性的关系，以及与整个实时任务集的可调度性的关系。依据该模型并借鉴生物学领域的寄生思想，提出了一个基于进化规划的性能优化方法，通过调整任务启动时间，以减少抢占次数或改变抢占关系，降低系统额外开销，提高系统实时性能；最后通过实验验证了建立在抢占模犁基础上的嵌入式系统件能优化方法的有效件。     

面向异构信号处理平台的负载均衡算法

针对当前异构信号处理平台中信号处理应用的调度算法优化目标单一且调度结果中处理器负载不均衡的问题，提出了一种基于蚁群优化算法的负载均衡算法。该算法结合蚁群优化算法的快速搜索能力和组合优化能力，以信号处理应用的调度长度和处理器负载均衡为优化目标，对初始信息素矩阵和蚂蚁的遍历顺序进行改进，提出调度长度启发因子和负载均衡启发因子对处理器选择公式进行改进，利用轮盘赌策略确定信号处理应用各子任务分配的处理器，完成信号处理应用的调度。仿真结果表明，该算法得到调度结果在调度长度和负载均衡方面均有改进，可以充分发挥各处理器性能，提高异构信号处理平台的整体效率。     

Cost-Effective and Variable-Channel FastICA Hardware Architecture and Implementation for EEG Signal Processing

Self-powered systems that interact with the physical world require computing platforms with predictable timing behavior and a low energy demand. Energy consumption can be reduced by choosing energy-efficient designs for both hardware and software components of the platform. We leverage the state-of-the-art in hardware design by adopting Heterogeneous Multi-core Processors with support for Dynamic Voltage and Frequency Scaling and Dynamic Power Management. Through experiments on one such platform, we expose the hardware characteristics that violate assumptions of conventional energy models and propose a revised model suitable for identifying the energy-efficient frequency range. We then address the problem of allocating real-time software components onto heterogeneous cores such that total energy is minimized. Our approach is to start from an analytically justified target load distribution and find a task assignment heuristic that approximates it. Our analysis shows that neither balancing the load nor assigning all load to the “cheapest” core is the best load distribution strategy, unless the cores are extremely alike or extremely different. The optimal load distribution is then formulated as a solution to a convex optimization problem. A heuristic that approximates this load distribution and an alternative method that leverages the solution explicitly are proposed as viable task assignment methods. The proposed methods are compared to state-of-the-art on simulated problem instances and in a case study of a soft-real-time application on an off-the-shelf ARM big.LITTLE heterogeneous processor.     

SET-MRTS: An empirical experiment tool for real-time scheduling and synchronization

In the real-time scheduling theory, schedulability and synchronization analyses are used to evaluate scheduling algorithms and real-time locking protocols, respectively, and the empirical synthesis experiment is one of the major methods to compare the performance of such analyses. However, since many sophisticated techniques have been adopted to improve the analytical accuracy, the implementation of such analyses and experiments is often time-consuming. This paper proposes a schedulability experiment toolkit for multiprocessor real-time systems (SET-MRTS), which provides a framework with infrastructures to implement the schedulability and synchronization analyses and the deployment of empirical synthesis experiments. Besides, with well-designed peripheral components for the input and output, experiments can be conducted easily and flexibly on SET-MRTS. This demonstration further proves the effectiveness of SET-MRTS in both functionality and availability.     

模糊聚类CIAP在雷达组网中的应用

随着雷达网络传输技术的发展,雷达网络中的数据拥塞和流量分配不均衡问题亟待解决.文中针对多个被覆线与无线AP所组成的雷达传输网络中的流量分配不均衡问题,对多链路负载均衡算法(CIAP)中的任务调度算法进行改进.算法依据网络传输链路本身的固有特性,在进行链路碎片调度时,采用模糊聚类的思想对任务调度算法进行改进,该算法根据网络中各链路的剩余带宽和链路时延对负载较大的链路的路由碎片进行实时调度.实验结果表明,与传统的基于循环招标任务调度的多链路负载均衡算法比较,改进的算法能够迅速高效地均衡雷达网络中的链路负载.     

Fine-Tuning MAC-Level Protocols for Optimized Real-Time QoS

In distributed real-time systems, meeting the real-time constraints is mandatory, but the satisfaction of other application-dependent criteria is most generally required as well. In particular, networked control systems (NCS) are known to be sensitive to communication delays such as frame response time jitters. Well-known medium access control (MAC) algorithms such as non-preemptive deadline monotonic (NP-DM) or non-preemptive earliest deadline first (NP-EDF) are efficient in terms of bandwidth usage, but they may perform poorly regarding other application-dependent performance criteria. This paper highlights a class of online scheduling policies targeted at scheduling frames at the MAC level, and it provides a schedulability analysis that is valid for all policies within the considered class. As it will be shown, these algorithms are implementable on COTS components (e.g., Controller Area Network controllers) and offer good trade-offs between feasibility and the satisfaction of other application-dependent criteria such as the response time jitter.     

Static Security Optimization for Real-Time Systems

An increasing number of real-time applications like railway signaling control systems and medical electronics systems require high quality of security to assure confidentiality and integrity of information. Therefore, it is desirable and essential to fulfill security requirements in security-critical real-time systems. This paper addresses the issue of optimizing quality of security in real-time systems. To meet the needs of a wide variety of security requirements imposed by real-time systems, a group-based security service model is used in which the security services are partitioned into several groups depending on security types. While services within the same security group provide the identical type of security service, the services in the group can achieve different quality of security. Security services from a number of groups can be combined to deliver better quality of security. In this study, we seamlessly integrate the group-based security model with a traditional real-time scheduling algorithm, namely earliest deadline first (EDF). Moreover, we design and develop a security-aware EDF schedulability test. Given a set of real-time tasks with chosen security services, our scheduling scheme aims at optimizing the combined security value of the selected services while guaranteeing the schedulability of the real-time tasks. We study two approaches to solve the security-aware optimization problem. Experimental results show that the combined security values are substantially higher than those achieved by alternatives for real-time tasks without violating real-time constraints.