RTAI混合任务调度器的设计与实现

针对RTAI系统只能调度单一类型任务的问题,提出一种可调度多类型任务的混合任务调度器。该调度器支持CBS调度策略,并采用LXRT机制关联软实时任务和CBS服务器,根据服务器调度策略对软实时任务进行调度。实验结果表明,该混合任务调度器在保证硬实时任务正常运行的同时提高了软实时任务的服务水平。     

A Framework for Composing Real-Time Schedulers

In this paper, we present a framework for integrating real-time components in the same system, where each component has its own scheduling algorithm. There are two main reasons for this research: to allow maximum flexibility in the design of systems with different real-time activities and to reuse already existing applications without changing their scheduling policy. After defining the concept of component in our context, we present our methodology that is based on a two-level hierarchical scheduling paradigm. At the global level, a scheduler selects which component must be executed at each instant; the selected component then chooses which task has to be scheduled depending on its own scheduling strategy.     

Algorithms for scheduling real-time tasks with input error andend-to-end deadlines

This paper describes algorithms for scheduling preemptive, imprecise, composite tasks in real-time. Each composite task consists of a chain of component tasks, and each component task is made up of a mandatory part and an optional part. Whenever a component task uses imprecise input, the processing times of its mandatory and optional parts may become larger. The composite tasks are scheduled by a two-level scheduler. At the high level, the composite tasks are scheduled preemptively on one processor, according to an existing algorithm for scheduling simple imprecise tasks. The low-level scheduler then distributes the time budgeted for each composite task across its component tasks so as to minimize the output error of the composite task     

一个实时CORBA的动态调度服务模型

在实时CORBA中引入调度服务简化了实时应用的开发,但目前实时CORBA1．0所定义的调度服务使用固定优先级调度策略只能适合于一个封闭的CORBA应用系统．本文针对这一局限性,提出了一个基于客户调度器和服务调度器相协作的动态调度服务模型对其进行扩展,使得调度服务可以适用于一个更为开放的实时CORBA系统．     

基于中间件的实时内存调度

在数据密集型实时监测系统中,任务需要通过分配内存来存储和处理动态变化的信息。该文提出了一种基于中间件的新型内存调度器,通过反馈驱动来调节实时任务的内存分配,与受控任务保持平滑的连接,开放结构允许系统设计人员增加或修改内存管理策略。测试结果表明,内存调度器引起的开销较小,能有效地协调资源共享冲突。     

Visual understanding industrial workflows under uncertainty on distributed service oriented architectures

Service Oriented Architecture (SOA) is an evolution of distributed computing based on the request/reply design paradigm for synchronous and asynchronous applications. In such architectures, application developers or system integrators can build scenarios by composing one or more services without knowing the services’ underlying implementations. In this paper, we adopt a SOA framework for on-line scheduling complex industrial workflows. The proposed SOA consists of three main layers; the input layer, the benchmarking layer, the prediction layer and the scheduler. The main innovation of our SOA architecture is the prediction layer that supports computer vision tools able to visually observe how an industrial workflow is actually executed. This way, we can automatically estimate the actual execution time for a process. In particular a new self-initialized visual tracker algorithm is proposed in this paper to robustly trace workers’ trajectory in a plant via visual observations. Then, part-to-whole curve matching is presented so as to find correspondences among the traced curve and the ideal one and thus improving scheduler efficiency. The input layer interoperably describes industrial operations using the XPDL (an XML-based) format. The benchmarker evaluates much faster than real-time and in an off-line mode how long it takes for an industrial workflow to be executed on a given resource guaranteeing an almost real-time implementation of the video processing algorithms on the plant. The last component of the proposed SOA is the scheduler with the goal to assign the workflows to the available resources. In this paper, a Maximum Benefit First (MBF) scheduler is presented which maximizes the total gain received by the industry when completing execution of all the beneficial operations with minimum violations of their delivery deadlines (that is with the minimum compensations). Experiments have been conducted on a real-world industrial plant of Nissan Iberica automobile construction indicating the efficiency of the proposed system.     

A simulation-based scheduling system for real-time optimization and decision making support

This paper presents an industrial application of simulation-based optimization (SBO) in the scheduling and real-time rescheduling of a complex machining line in an automotive manufacturer in Sweden. Apart from generating schedules that are robust and adaptive, the scheduler must be able to carry out rescheduling in real time in order to cope with the system uncertainty effectively. A real-time scheduling system is therefore needed to support not only the work of the production planner but also the operators on the shop floor by re-generating feasible schedules when required. This paper describes such a real-time scheduling system, which is in essence a SBO system integrated with the shop floor database system. The scheduling system, called OPTIMISE scheduling system (OSS), uses real-time data from the production line and sends back expert suggestions directly to the operators through Personal Digital Assistants (PDAs). The user interface helps in generating new schedules and enables the users to easily monitor the production progress through visualization of production status and allows them to forecast and display target performance measures. Initial results from this industrial application have shown that such a novel scheduling system can help both in improving the line throughput efficiently and simultaneously supporting real-time decision making.     

A multi-level scheduler for batch jobs on grids

This paper proposes a two-level scheduler for dynamically scheduling a continuous stream of sequential and multi-threaded batch jobs on grids, made up of interconnected clusters of heterogeneous single-processor and/or symmetric multiprocessor machines. The scheduler aims to schedule arriving jobs respecting their computational and deadline requirements, and optimizing the hardware and software resource usage. At the top of the hierarchy a lightweight meta-scheduler (MS) classifies incoming jobs according to their requirements, and schedules them among the underlying resources balancing the workload. At cluster level a Flexible Backfilling algorithm carries out the job machine associations by exploiting dynamic information about the environment. Scheduling decisions at both levels are based on job priorities computed by using different sets of heuristics. The different proposals have been compared through simulations. Performance figures show the feasibility of our approach.     

Preference-oriented real-time scheduling and its application in fault-tolerant systems

In this paper, we consider a set of real-time periodic tasks where some tasks are preferably executed as soon as possible (ASAP) and others as late as possible (ALAP) while still meeting their deadlines. After introducing the idea of preference-oriented (PO) execution, we formally define the concept of PO-optimality. For fully-loaded systems (with 100% utilization), we first propose a PO-optimal scheduler, namely ASAP-Ensured Earliest Deadline (SEED), by focusing on ASAP tasks where the optimality of ALAP tasks’ preference is achieved implicitly due to the harmonicity of the PO-optimal schedules for such systems. Then, for under-utilized systems (with less than 100% utilization), we show the discrepancies between different PO-optimal schedules. By extending SEED, we propose a generalized Preference-Oriented Earliest Deadline (POED) scheduler that can obtain a PO-optimal schedule for any schedulable task set. The application of the POED scheduler in a dual-processor fault-tolerant system is further illustrated. We evaluate the proposed PO-optimal schedulers through extensive simulations. The results show that, comparing to that of the well-known EDF scheduler, the scheduling overheads of SEED and POED are higher (but still manageable) due to the additional consideration of tasks’ preferences. However, SEED and POED can achieve the preference-oriented execution objectives in a more successful way than EDF.     

风电场数据中心Hadoop云平台作业调度算法研究

风电场数据中心包含状态监测、数据采集等实时类作业和非实时类作业,采用C/S结构存在资源利用率不平衡、管理与维护成本高等缺点。设计了一种基于Hadoop云平台的数据中心架构;针对开源Hadoop平台现有FIFO调度器不能满足实时监测系统要求,在原有FIFO调度器的基础上,设计了一种双队列的作业调度器,综合考虑作业的截止时间和优先级来进行作业调度决策,实验结果表明,与FIFO调度器相比,双队列的作业调度器在集群负载较大时能够表现出较好的性能,保证实时类作业能够优先执行,为风电机组的安全运行提供保障。     

RTAI下动态集成的资源预留调度器的设计与实现

近年来基于双内核架构增强Linux操作系统实时性的RTAI(Real-Time Application Interface)在工业控制等硬实时领域得到广泛应用。RTAI通过抢占Linux的执行来保障硬实时性,Linux被抢占的时间依赖于硬实时应用的处理器要求而每次均会有较大不同,导致Linux的执行时间不可预测,从而无法保障软实时应用的服务质量。动态集成的资源预留调度器(Dynamic Integrated Resource Reserved Scheduler,DIRRS)通过增强RTAI调度器使其支持资源预留机制,在Linux实现可动态集成的、基于服务器的调度策略,不但可以保证Linux及其以上的软实时应用,即使在有硬实时任务并发时也能得到处理器资源,而且很容易通过更换不同的服务器内核模块来实现用户自定义的调度策略。     

Inter-agent cooperation and communication for agent-based robust dynamic scheduling in steel production

This paper describes a negotiation protocol proposed for inter-agent cooperation in a multi-agent system that we developed for optimisation and dynamic integrated scheduling within steel production. The negotiation protocol is a two-level bidding mechanism based on the Contract Net Protocol. The purpose of this protocol is to allow the agents to cooperate and coordinate their local schedules in order to find globally near-optimal robust schedules, whilst minimising the disruption caused by the occurrence of unexpected real-time events. We conduct several experiments to investigate the performance of this negotiation protocol to coordinate the agents in generating good quality robust schedules. This performance is evaluated in terms of stability and utility measures used to evaluate the robustness of the steel production processes in the presence of real-time events.     

Scalability Analysis of the Hierarchical Architecture for Distributed Virtual Environments

A distributed virtual environment (DVE) is a shared virtual environment where multiple users at their workstations interact with each other over a network. Some of these systems may support a large number of users, for example, multiplayer online games. An important issue is how well the system scales as the number of users increases. In terms of scalability, a promising system architecture is a two-level hierarchical architecture. At the lower level, multiple servers are deployed; each server interacts with its assigned users. At the higher level, the servers ensure that their copies of the virtual environment are as consistent as possible. Although the two-level architecture is believed to have good properties with respect to scalability, not much is known about its performance characteristics. In this paper, we develop a performance model for the two-level architecture and obtain analytic results on the workload experienced by each server. Our results provide valuable insights into the scalability of the architecture. We also investigate the issue of consistency and develop a novel technique to achieve weak consistency among copies of the virtual environment at the various servers. Simulation results on the consistency/scalability trade-off are presented.     

基于MPEG-4的嵌入式流媒体服务器设计

介绍了基于MPEG-4硬件实时编码器的嵌入式流媒体服务器的设计,阐述了系统的硬件组成,并从MPEG-4视频流封装、RTP/RTCP协议实现、开源RTSP协议库的应用和Web服务器的构建等方面介绍了软件系统的具体实现过程.此外,还对实时传输中所涉及的时间戳和QoS机制的实现方法进行了介绍.实验结果表明,该系统具有丢包率低和容错能力强等特点,适用于移动视频监控等实际应用场合.     

基于Darwin的集群流媒体服务器系统的设计与实现

在Darwin流媒体服务器的基础上,首先使用VTune工具对其调度算法进行优化;然后改进了Darwin服务器的调度算法,并增加了一个监控服务器状态的实时监控线程(monitor thread),该线程把服务器的运行状态和参数发送给调度器,调度器根据各个服务器发送过来的参数进行对比,把客户的请求分配给当前负载最小的服务器; 最后,通过搭建集群实验系统,验证了本文所做的工作是有效的.     

Verification of schedulability for real-time programs

Assume that a real-time programP ^T consisting of a number of parallel processes is executed on a system having a setPr of processors which are shared between the processes by a real-time schedulerS ^T. Assume that P^T must meet some timing deadlines. We show that such an implementation ofP ^T can be represented as a transformationL(P ^T) and that the deadlines ofP ^T will be met if they are satisfied by the timing properties of the transformed program. The condition for feasibility of a real-time program executed under a scheduler is formalized and rules are provided for verification. The schedulerS ^T can be specifiedgenerically and applied to different programs, making it unnecessary to introduce low-level operations such as scheduling primitives into the programming language. Thus real-time program specification and Schedulability can be considered in the same framework and the timing properties of a program can be determined at the specification level. By separating the specification of the scheduler from that of the program, the feasibility of an implementation can be proved by considering a scheduling policy rather than its implementation details.     

基于反馈控制的嵌入式实时系统调度算法设计

针对嵌入式实时系统在系统负载模型不确定的情况下系统的实时任务错过率过高以及调度稳定性差的问题,提出了一个基于反馈控制的调度模型.该模型主要由改进的多级队列调度器和3个控制器(准入控制器、执行等级控制器、比例积分微分(PID)控制器)组成.任务的错过率偏差反馈到PID控制器,产生相应的调整量并作用于其他两个控制器,对实时任务的执行等级进行调整, 经过调整的任务被调度器调度执行.在对模型中每个部件进行了一些结构调整和改进设计之后,将该调度模型应用于嵌入式可配置操作系统(eCos)中.实验结果表明,该模型降低了任务的时限错过率,同时解决了系统频频超载的问题.     

基于W3150A＋的嵌入式Web服务器设计

嵌入式Web服务器是实现远程监控和维护管理的一个重要技术手段。本文主要给出基于W3150A＋和ARM7的嵌入式Web服务器软、硬件设计方案,重点详述其软件的实现原理及方法,并对软件涉及的各模块进行了阐述;同时引入了嵌入式操作系统,为没有文件系统而实现Web服务器提供了一种新的思路和方法。     

基于BlazeDS消息推送的WebGIS系统设计与实现

为满足一些WebGIS应用对实时性的要求,在分析传统WebGIS采用请求/响应工作方式的不足的基础上,提出利用开源框架BlazeDS的基于HTTP协议的消息推送技术,实现WebGIS系统服务端地理信息数据的实时推送。通过服务器向客户端主动推送数据以获得更好的实时性,并使用Flex作为客户端更好的表达地理信息数据。在分析BlazeDS服务器推送技术的原理和基本过程的基础上,给出WebGIS系统体系结构,讨论其核心设计与系统实现,最后通过实例说明系统应用的可行性。     

应用服务器中Web服务支持功能的设计与实现

随着Web服务技术的发展和步人实用，主流应用服务器给应用开发人员提供了在应用服务器上开发、部署和调用Web服务的功能。叙述了通过集成开源Web服务项目Axis的设计方案，在现有的符合J2EE1．3标准的应用服务器中增加Web服务支持功能，并说明了具体的实现结构，使得应用开发人员可以在该应用服务器上开发、部署和调用Web服务。