首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 153 毫秒
1.
时间冗余作为容错的重要手段被广泛应用于安全关键实时系统中。传统容错调度算法为失败任务的重运行(Re-execute)预留了大量的空闲时间,但是重运行的使用会降低系统的资源利用率。提出了一种基于检查点机制的容错调度算法CP-PRA,通过降低错误恢复需要的时间,可以有效地提高系统的资源利用率。给出了该算法的可调度奈件,并证明了其算法的正确性。  相似文献   

2.
针对硬实时系统中多种类型任务并存的特点,提出一种三级实时调度模型--TLRtS(three-level real-time scheduling).该模型将整个系统空间划分为硬实时、软实时和非实时空间,分别用来处理硬实时、软实时和非实时任务.TLRtS模型不仅可以动态加载多种实时调度算法,还可以集成相应的资源访问控制协议,解决了任务之间存在资源竞争的问题.实验结果表明,此方法既保证了所有硬实时任务严格按照其时间约束在截止期前完成,又尽可能地提高了软实时和非实时任务的服务质量.  相似文献   

3.
增强Linux内核实时任务调度性能的研究   总被引:5,自引:1,他引:5  
分析基本Linux内核的调度策略,指出其应用于实时系统时存在的不足,提出了一种增强Linux内核调度性能的实时任务调度策略和调度算法。结合任务的关键性、截止期和执行时间三要素,该调度策略通过三运行队列代替原Linux内核的单运行队列,分别对应系统的硬实时、软实时和非实时任务,保证了硬实时任务的实时性;不同于简单的FIFO调度算法,该调度算法根据任务的最小松弛时间和重要性来确定其在当前运行队列中的优先级,仿真结果表明此算法提高了实时调度性能。  相似文献   

4.
动态电源与频率调整技术能够帮助实时系统显著减少能耗,之前的研究大多聚焦于基于周期性任务的线程调度算法,却很少考虑周期性与非周期性任务混合的模型。同时,尽管基于CPU利用率的DVS算法可以从系统级上减少能耗,但不能保证实时性。本文提出一种新的算法,它结合减慢因子的DVFS调度算法与系统级的DVS技术,融合PID控制器与自适应的权衡策略为软实时系统提供更好的能耗减少方法。该算法的能耗在服务器利用率低于25%的情况下比加州大学提出的算法下降了14.2%25.9%,周期性任务超过时限率低于3%。  相似文献   

5.
针对单处理器实时系统动态调度问题进行了研究,分析任务的到达时间、执行时间、截止时间和空闲时间等任务属性的敏感度和影响度,提出了一种基于优先级表的调度算法PTBM,使相对截止期越小、空闲时间越大的任务优先级越高。对关于实时任务属性敏感度和影响度的结论验证和与传统的EDF、LLF和PTD算法的对比进行仿真实验,仿真结果表明基于优先级表设计的实时调度算法PTBM具有较高的调度成功率。该方法可应用于实时系统的实时任务的动态调度中。  相似文献   

6.
单调比率(RM)调度算法及应用   总被引:2,自引:0,他引:2  
叶明  罗克露  陈慧 《计算机应用》2005,25(4):889-891
介绍了任务死线不大于其周期的任务集调度条件分析及算法实现。这种约束条件放松, 有利于周期与非周期任务混合模型调度。同时,分析了以往调度算法中单调比率调度算法约束条件, 并指明了计算时间复杂度的缺点。因而,在RM算法基础之上提出一种实时系统调度算法及实现流 程图,并对提出的现场级实时调度算法进行了对比测试。  相似文献   

7.
结合分布式系统和实时系统的特点,分析了分布式系统任务调度算法和实时系统任务调度算法,为了能够较好地实现系统的并行性能、实时任务的调度性能以及网络的负载平衡,提出一种将分布式系统任务调度算法和实时系统任务调度算法想结合的算法,采用层次式调度算法以及动态权值的轮转调度算法和速率单调调度算法相结合,在队列权值固定的实验基础上,采用随机改变队列权值的算法,实验证明该随机改变队列权值的算法能够更好地调度任务.  相似文献   

8.
本文基于随机模型研究了软实时系统中任务的可调度性特征,提出了期望可调度性的概念. 期望可调度性是与实时任务到达时间t相关的, 因此, 提出的方法能研究任务子集在任意给定时间间隔的可调度性特征. 本文给出了期望可调度性的条件, 如果任务的持续时间满足该条件, 则实时任务具有期望可调度性. 基于理论结果的数值分析与模拟结果是一致的,这表明当软实时系统的负载率小于69%(某些确定性模型提供的)时, 实时任务总是期望可 调度的. 这一结果也表明基于随机模型的期望可调度性方法能为软实时系统的任务可调度性分析提供一个更大的阈值和更好的适应性.  相似文献   

9.
基于软件容错的动态实时调度算法   总被引:10,自引:1,他引:10  
在硬实时系统中,由于任务超时完成将会导致灾难性后果,因而硬实时系统具有严格的时间及可靠性限制奈件.目前实时容错调度算法大部分针对硬件的容错,很少考虑软件运行的故障.提出了一种类似EDF基于软件容错的动态实时调度算法EBPA(expectation-based probing algorithm),该算法在任务执行过程中通过基于期望值的若干试探性检测步骤,提高了任务可执行性的预测,尽可能避免了任务早期的错误对后续任务的影响,因此提高了任务的完成率并同时有效地减少了浪费的CPU时间片.通过实验测试,同目前所知的同类算法相比,具有更佳的调度性能-调度成本比.  相似文献   

10.
侯爽  宋颖慧 《计算机工程》2004,30(16):67-69
通过研究实时系统中可能出现的任务类型,提出了一种实时系统任务模型和基于这个模型的多任务调度算法,分析了该算法下所有周期任务和非周期任务可调度的条件。该算法结合了DMS(Dcadlinc Monotonic Scheduling)和DD(Deadline Driven)算法,在保证系统中周期任务执行的前提下,也使非周期任务获得了,较好的响应时间。  相似文献   

11.
In this paper, we consider the generalized power model in which the focus is the dynamic power and the static power, and we study the problem of the canonical sporadic task scheduling based on the rate-monotonic (RM) scheme. Moreover, we combine with the dynamic voltage scaling (DVS) and dynamic power management (DPM). We present a static low power sporadic tasks scheduling algorithm (SSTLPSA), assuming that each task presents its worst-case work-load to the processor at every instance. In addition, a more energy efficient approach called a dynamic low power sporadic tasks scheduling algorithm (DSTLPSA) is proposed, based on reclaiming the dynamic slack and adjusting the speed of other tasks on-the-fly in order to reduce energy consumption while still meeting the deadlines. The experimental results show that the SSTLPSA algorithm consumes 26.55–38.67% less energy than that of the RM algorithm and the DSTLPSA algorithm reduces the energy consumption up to 18.38–30.51% over the existing DVS algorithm.  相似文献   

12.
提高软非周期任务响应性能的调度算法   总被引:9,自引:0,他引:9  
何军  孙玉方 《软件学报》1998,9(10):721-727
实时环境中常常既包含硬周期任务,又包含软非周期任务,引入一种改进软非周期实时任务响应时间的算法.已有的解决混合任务调度问题的方法都是基于速率单调(Rate Monotonic)策略的,其中从周期任务“挪用时间”的算法被证明优于其他所有算法.但是,速率单调算法限制了处理器的使用率,从而使周期任务的可“挪用”时间受到限制.最后期限驱动(Deadline Driven)策略DD可使潜在的处理器利用率达到100%.新算法正是在周期任务的调度中适当加入了DD策略,从而使非周期任务的响应时间得以缩短.仿真实验的结果表明,这种算法的性能优于已有的所有算法,而由它所带来的额外开销却不算很高.  相似文献   

13.
一种实时异构系统的集成动态调度算法   总被引:10,自引:0,他引:10  
乔颖  邹冰  方亭  王宏安  戴国忠 《软件学报》2002,13(12):2251-2258
提出了一种实时异构系统的集成动态调度算法.该算法通过一个新的任务分配策略以及软实时任务的服务质量QoS(quality of service)降级策略,不仅以统一方式完成了对实时异构系统中硬、软实时任务的集成动态调度,而且提高了算法的调度成功率.同时,还进行了大量的模拟研究.这些模拟以传统的近视算法为基准,将其应用在实时异构系统集成动态调度时的调度成功率与新算法进行比较,模拟结果表明,在多种任务参数取值下,新算法的调度成功率均高于传统的近视算法.  相似文献   

14.
Dynamic power management (DPM) and dynamic voltage scaling (DVS) are crucial techniques to reduce the energy consumption in embedded real-time systems. Many previous studies have focused on the energy consumption of the processor or I/O devices. In this paper, we focus on the problem of energy management integrating DVS and DPM techniques for periodic embedded real-time applications with rate monotonic (RM) policy and present a system level fixed priority energy-efficient scheduling (SLFPEES) algorithm. The SLFPEES algorithm consists of I/O device scheduling and job scheduling. I/O device scheduling is based on the dynamic power management with rate monotonic (DPM-RM) policy which puts devices into the sleep state when the idle interval is larger than devices break even time. Job scheduling is based on the RM policy and uses stack resource protocol (SRP) to guarantee exclusive access to the shared resources. For energy efficiency, the SLFPEES algorithm schedules the task with a lower speed and a higher speed. The experimental result shows that the SLFPEES algorithm can yield significantly energy savings with respect to the existing techniques.  相似文献   

15.
Many embedded systems are constrained by limits on power consumption, which are reflected in the design and implementation for conserving their energy utilization. Dynamic voltage scaling (DVS) has become a promising method for embedded systems to exploit multiple voltage and frequency levels and to prolong their battery life. However, pure DVS techniques do not perform well for systems with dynamic workloads where the job execution times vary significantly. In this paper, we present a novel approach combining feedback control with DVS schemes targeting hard real-time systems with dynamic workloads. Our method relies strictly on operating system support by integrating a DVS scheduler and a feedback controller within the earliest-deadline-first (EDF) scheduling algorithm. Each task is divided into two portions. The objective within the first portion is to exploit frequency scaling for the average execution time. Static and dynamic slack is accumulated for each task with slack-passing and preemption handling schemes. The objective within the second portion is to meet the hard real-time deadline requirements up to the worst-case execution time following a last-chance approach. Feedback control techniques make the system capable of selecting the right frequency and voltage settings for the first portion, as well as guaranteeing hard real-time requirements for the overall task. A feedback control model is given to describe our feedback DVS scheduler, which is used to analyze the system's stability. Simulation experiments demonstrate the ability of our algorithm to save up to 29% more energy than previous work for task sets with different dynamic workload characteristics. This work was supported in part by NSF grants CCR-0208581, CCR-0310860 and CCR-0312695. Preliminary versions of parts of this work appeared in the ACM SIGPLAN Joint Conference Languages, Compilers, and Tools for Embedded Systems (LCTES'02) and Software and Compilers for Embedded Systems (SCOPES'02) (Dudani et al., 2002), in the Workshop on Compilers and Operating Systems for Low Power 2002 (Zhu and Mueller, 2002) and in the IEEE Real-Time Embedded Technology and Applications Symposium 2004 (Zhu and Mueller, 2004a).  相似文献   

16.
Multicore processors deliver a higher throughput at lower power consumption than unicore pro- cessors. In the near future, they will thus be widely used in mobile real-time systems. There have been many research on energy-efficient scheduling of real-time tasks using DVS. These approaches must be modified for multicore processors, however, since normally all the cores in a chip must run at the same performance level. Thus blindly adopting existing DVS algorithms which do not consider the restriction will result in a waste of energy. This article suggests Dynamic Repartitioning algorithm based on existing partitioning approaches of multiprocessor systems. The algorithm dynamically balances the task loads of multiple cores to optimize power consumption during execution. We also suggest Dynamic Core Scaling algorithm which adjusts the number of active cores to reduce leakage power consumption under low load conditions. Simulation results show that Dynamic Repartitioning can produce energy savings of about 8% even with the best energy-efficient partitioning algorithm. The results also show that Dynamic Core Scaling can reduce energy consumption by about 26% under low load conditions.  相似文献   

17.
提出了一种基于分批优化的实时多处理器系统的集成动态调度算法,该算法采用在每次扩充当前局部调度时,通过对所选取的一批任务进行优化分配的策略以及软实时任务的服务质量QoS(quality of service)降级策略,以统一方式实现了对实时多处理器糸统中硬、软实时任务的集成动态调度.进行了大量的模拟研究,结果表明.在多种任务参数取值下,新算法的调度成功率均高于近视算法(Myopic Algorithm).  相似文献   

18.
Several scheduling approaches have been developed to address DVS in time-critical systems, however, overheads, precedence and exclusion relations have been neglected. This paper presents a pre-runtime scheduling method for hard real-time systems considering DVS, overheads as well as inter-task relations. The proposed method adopts a formal model based on time Petri nets in order to find a feasible schedule that satisfies timing and energy constraints.  相似文献   

19.
抢占阈值调度的功耗优化   总被引:2,自引:0,他引:2  
DVS(Dynamic Voltage Scaling)技术的应用使得任务执行时间延长进而使得处理器的静态功耗(由CMOS电路的泄露电流引起)迅速增加.延迟调度(Procrastination Scheduling)算法是近年提出用于减少静态功耗的有效方法,它通过推迟任务的正常执行来尽可能长时间地让处理器处于睡眠或关闭状态,从而避免过多的静态功耗泄露.文中针对可变电压处理器上运用抢占阈值调度策略的周期性任务集合,将节能调度和延迟调度结合起来,提出一种两阶段节能调度算法,先使用离线算法来计算每个任务的最优处理器执行速度,而后使用在线模拟调度算法来计算每个任务的延迟时间,从而动态判定处理器开启/关闭时刻.实例研究和仿真实验表明,作者的方法能够进一步降低抢占阈值任务调度算法的功耗.  相似文献   

20.
This paper explores the energy-efficient scheduling of real-time tasks on a non-ideal DVS processor in the presence of resource sharing. We assume that tasks are periodic, preemptive and may access to shared resources. When dynamic-priority and fixed-priority scheduling are considered, we use the earliest deadline first (EDF) algorithm and the rate monotonic (RM) algorithm to schedule the given set of tasks. Based on the stack resource policy (SRP), we propose an approach, called blocking-aware two-speed (BATS) algorithm, to synchronize the tasks with shared resources and to calculate appropriate execution speeds so that the shared resources can be accessed in a mutual exclusive manner and the energy consumption can be reduced. Particularly, BATS uses a static low speed to execute tasks initially, and then it switches to a high speed dynamically whenever a task blocks a higher priority task. More specifically, the processor runs at the high speed from the beginning of the blocking until the deadline of the blocked task or the processor becomes idle. In order to guarantee that the deadlines of tasks are met, the static low speed and the dynamic high speeds are derived based on the theoretical analysis of the schedulability of tasks. Compared with existing work, BATS achieves more energy saving because its dynamic high speeds are lower than that of existing work and the processor has less chance to execute tasks at the high speeds. The schedulability analysis and the properties of our proposed BATS are provided in this paper. We also evaluated the capabilities of BATS by a series of experiments, for which we have some encouraging results.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号