共查询到17条相似文献,搜索用时 109 毫秒
1.
开放式实时环境中的多类型实时任务并存的情况给实时调度机制带来了新的需求和挑战.提出了一种适用于开放式实时环境的3层集成调度框架,它基于服务器方式的实时调度理论,把5种既有相关性又有功能互补特征的服务器有机的集成到统一的调度机制中.可支持多种类型的实时任务及非实时任务共存于同一系统的混合调度,并且根据它们的属性自动选择最合适的服务器与之搭配.相对于现有方法,该调度框架可支持的调度对象类型更广泛,易于进行服务质量控制,并且有良好的可扩展性.因此,更适合于开放式实时环境. 相似文献
2.
开放式实时嵌入式系统中多类型实时任务并存和资源受限的情况给实时调度机制带来了新的需求和挑战。通过引入准入控制、资源管理、调度服务器、自适应调节机制等,提出了一个形式化的自适应调度模型。它能适应开放计算环境的不确定性,有控制地接受不同类型任务的运行;可根据系统资源和任务需求的最新变换情况计算带宽变化,自适应地调节任务的优先等级,使得系统运行在最优的实时性能上;该模型在某航空机载系统设计中得到了实际应用,同其它类似系统相比,该模型的应用提高了系统的调度性和系统稳定性。 相似文献
3.
针对目前嵌入式Forth操作系统中缺乏实时调度机制的问题,对基于Forth虚拟机架构的嵌入式操作系统中多任务调度的关键技术进行了研究。采用Forth虚拟机技术,新定义了一种中断任务类型来处理实时突发事件,并给出了一种新的任务调度算法来调度 Forth系统中终端任务、后台任务以及中断任务顺利运行。实验结果表明,改进后的 Forth 系统能够通过实时调度处理突发事件,并且实时响应度高,尤其适用于对实时性有要求的嵌入式环境中,以满足日趋复杂的嵌入式环境对高效操作系统和 Forth 技术的应用需求。 相似文献
4.
虚拟化技术在实时嵌入式系统中的应用日趋广泛,但是目前虚拟化环境中常见的调度与负载均衡算法并不适用于硬实时系统中。为满足多核平台上虚拟化环境中对实时任务的支持,通过对Xen虚拟化环境中的SEDF调度算法进行改进,提供了一种在多核硬件平台下虚拟化环境中的准入控制与负载均衡算法。该算法能够保证每个处理器核上的工作量不会超载,并保证每个虚拟机中任务的实时性及其服务质量。算法实现较为简单、运行时开销较小。 相似文献
5.
6.
定时器驱动的RM调度机制建模及其性能优化 总被引:1,自引:0,他引:1
在Katcher等人对定时器驱动的RM(Rate Monotonic)调度机制研究的基础上,通过对该机制下实时任务抢占行为的分析,建立了周期性任务的抢占模型,给出了直接抢占发生的充分必要条件,据此确定了任务间的抢占关系,进而精确了可调性的判定条件,然后讨论了系统的平均响应时间.依据此抢占模型,受生物界寄生现象的启发,提出了一个改善嵌入式系统实时性能的方法,将获取机制和利用机制分离,屏蔽了复杂优化计算对目标嵌入式系统性能的负面影响.最后,通过实验验证了该方法在改善抢占关系、减少抢占开销和增强系统可调度性方面的有效性,结果表明可调度利用率可以提高0.25%~6.64%。 相似文献
7.
为了增强不同安全等级的复杂嵌入式安全关键系统的高可信能力,Hades架构以"时空隔离"思想和分区机制为基础,各分区分时共享系统物理资源.针对Hades中分区的实时调度问题,提出一种固定延迟分区调度模型,并采用优先级位图算法设计了分区级和任务级两级调度机制;为了保障分区中所有实时任务的可调度性,对分区中任务组采用单调速率调度和最早截止时间优先2种调度策略,并分别给出任务可调度条件.最后,通过仿真实验进一步验证了该调度模型的有效性. 相似文献
8.
9.
开放计算环境下的实时与非实时任务不确定并发,以及多种实时约束混合的复杂约束系统,即开放混合实时系统的需求越来越广泛.通过引入接收控制、调度服务器、自适应调节机制,提出一种开放环境下的自适应实时系统调度架构--OARtS(open adaptive real-time scheduling).它能适应开放计算环境的不确定性,有控制地接受实时任务运行;可根据系统空闲计算带宽变化,自适应地调节任务的实时等级,使得系统运行在最优的实时性能上;对于软实时任务,可根据其计算带宽需求变化,自适应地调节其计算带宽分配,以适应任务执行时间时变引起的实时不确定性. 相似文献
10.
11.
It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation. 相似文献
12.
Myungryun Yoo Author Vitae 《Journal of Systems and Software》2009,82(4):619-628
Real-time tasks are characterized by computational activities with timing constraints and classified into two categories: a hard real-time task and a soft real-time task. In hard real-time tasks, tardiness can be catastrophic. The goal of hard real-time tasks scheduling algorithms is to meet all tasks’ deadlines, in other words, to keep the feasibility of scheduling through admission control. However, in the case of soft real-time tasks, slight violation of deadlines is not so critical.In this paper, we propose a new scheduling algorithm for soft real-time tasks using multiobjective genetic algorithm (moGA) on multiprocessors system. It is assumed that tasks have precedence relations among them and are executed on homogeneous multiprocessor environment.The objective of the proposed scheduling algorithm is to minimize the total tardiness and total number of processors used. For these objectives, this paper combines adaptive weight approach (AWA) that utilizes some useful information from the current population to readjust weights for obtaining a search pressure toward a positive ideal point. The effectiveness of the proposed algorithm is shown through simulation studies. 相似文献
13.
14.
15.
16.
分析了开放式实时系统双层调度框架的调度特点,指出了其仅适用于硬实时环境的缺陷。在保证硬实时应用可调度性的基础上,针对硬实时和软实时应用的不同特点提出了一种改进方案,增加了软实时应用的处理,拓展了原方案的适用范围,完善了开放式实时系统的双层调度框架,最后用理论证明与仿真实验验证了改进方案的有效性。 相似文献
17.
This paper focuses on the scheduling of tasks with hard and soft real-time constraints in open and dynamic real-time systems. It starts by presenting a capacity sharing and stealing (CSS) strategy that supports the coexistence of guaranteed and non-guaranteed bandwidth servers to efficiently handle soft tasks’ overloads by making additional capacity available from two sources: (i) reclaiming unused reserved capacity when jobs complete in less than their budgeted execution time and (ii) stealing reserved capacity from inactive non-isolated servers used to schedule best-effort jobs.CSS is then combined with the concept of bandwidth inheritance to efficiently exchange reserved bandwidth among sets of inter-dependent tasks which share resources and exhibit precedence constraints, assuming no previous information on critical sections and computation times is available. The proposed Capacity Exchange Protocol (CXP) has a better performance and a lower overhead when compared against other available solutions and introduces a novel approach to integrate precedence constraints among tasks of open real-time systems. 相似文献