The main contribution of this paper is twofold. First, we present an appropriate schedulability analysis, based on response time analysis, for supporting fault-tolerant hard real-time systems. We consider systems that...
详细信息
The main contribution of this paper is twofold. First, we present an appropriate schedulability analysis, based on response time analysis, for supporting fault-tolerant hard real-time systems. We consider systems that make use of error-recovery techniques to carry out fault tolerance. Second, we propose a new priority assignment algorithm which can be used, together with the schedulability analysis, to improve system fault resilience. These achievements come from the observation that traditional priorityassignment policies may no longer be appropriate when faults are being considered. The proposed schedulability analysis takes into account the fact that the recoveries of tasks may be executed at higher priority levels. This characteristic is very important since, after an error, a task certainly has a shorter period of time to meet its deadline. The proposed priority assignment algorithm, which uses some properties of the analysis, is very efficient. We show that the method used to find out an appropriate priorityassignment reduces the search space from O(n!) to O(n(2)), where n is the number of task recovery procedures. Also, we show that the priority assignment algorithm is optimal in the sense that the fault resilience of task sets is maximized as for the proposed analysis. The effectiveness of the proposed approach is evaluated by simulation.
The design of mixed-criticality systems is often subject to mandatory certification and has been drawing considerable attention over the past few years, This letter studies fixed-priority scheduling of mixed-criticali...
详细信息
The design of mixed-criticality systems is often subject to mandatory certification and has been drawing considerable attention over the past few years, This letter studies fixed-priority scheduling of mixed-criticality systems on a uniprocessor platform but in a more general way, using different priority orderings in different execution phases and considering them collectively. Then a sufficient response-time analysis is developed and a new priorityassignment scheme is proposed. This generalized approach has potential in better schedulability performance for mixed-criticality systems. (C) 2016 Elsevier B.V. All rights reserved.
Systems as asymmetric multiprocessor platforms are considered power-efficient multiprocessor architectures,efficient task partitioning(assignment) and play a crucial role in achieving more energy efficiency at these m...
详细信息
Systems as asymmetric multiprocessor platforms are considered power-efficient multiprocessor architectures,efficient task partitioning(assignment) and play a crucial role in achieving more energy efficiency at these multiprocessor *** paper addresses the problem of energy-aware static partitioning of periodic real time tasks on heterogeneous multiprocessor platforms.A modified Particle Swarm Optimization variant based on min-min and priority assignment algorithms for task partitioning is *** proposed approach aims to minimize the overall energy consumption,meanwhile avoid deadline *** energy-aware cost function is proposed to be considered in the proposed *** simulated experiments and comparisons with related approaches have been conducted and the achieved results demonstrate that the proposed partitioning scheme significantly outperforms in terms of the number of executed iterations to accomplish a specific task in addition to the energy savings.
暂无评论