Energy-Aware Non-Preemptive Scheduling of Mixed-Criticality Real-Time Task Systems

Author(s):  
Yi-Wen Zhang
IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 75110-75123 ◽  
Author(s):  
Haider Ali ◽  
Umair Ullah Tariq ◽  
Yongjun Zheng ◽  
Xiaojun Zhai ◽  
Lu Liu

Author(s):  
Jinghao Sun ◽  
Rongxiao Shi ◽  
Kexuan Wang ◽  
Nan Guan ◽  
Zhishan Guo

2020 ◽  
Vol 10 (19) ◽  
pp. 6702
Author(s):  
Eugenia Ana Capota ◽  
Cristina Sorina Stangaciu ◽  
Mihai Victor Micea ◽  
Daniel-Ioan Curiac

In mixed criticality systems (MCSs), the time-triggered scheduling approach focuses on a special case of safety-critical embedded applications which run in a time-triggered environment. Sometimes, for these types of MCSs, perfectly periodical (i.e., jitterless) scheduling for certain critical tasks is needed. In this paper, we propose FENP_MC (Fixed Execution Non-Preemptive Mixed Criticality), a real-time, table-driven, non-preemptive scheduling method specifically adapted to mixed criticality systems which guarantees jitterless execution in a mixed criticality time-triggered environment. We also provide a multiprocessor version, namely, P_FENP_MC (Partitioned Fixed Execution Non-Preemptive Mixed Criticality), using a partitioning heuristic. Feasibility tests are proposed for both uniprocessor and homogenous multiprocessor systems. An analysis of the algorithm performance is presented in terms of success ratio and scheduling jitter by comparing it against a time-triggered and an event-driven method in a non-preemptive context.


2006 ◽  
Vol 55 (12) ◽  
pp. 1588-1598 ◽  
Author(s):  
R. Jejurikar ◽  
R. Gupta
Keyword(s):  

Author(s):  
Dionisio de Niz ◽  
Karthik Lakshmanan ◽  
Ragunathan Rajkumar

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Weizhe Zhang ◽  
Hucheng Xie ◽  
Boran Cao ◽  
Albert M. K. Cheng

Energy consumption in computer systems has become a more and more important issue. High energy consumption has already damaged the environment to some extent, especially in heterogeneous multiprocessors. In this paper, we first formulate and describe the energy-aware real-time task scheduling problem in heterogeneous multiprocessors. Then we propose a particle swarm optimization (PSO) based algorithm, which can successfully reduce the energy cost and the time for searching feasible solutions. Experimental results show that the PSO-based energy-aware metaheuristic uses 40%–50% less energy than the GA-based and SFLA-based algorithms and spends 10% less time than the SFLA-based algorithm in finding the solutions. Besides, it can also find 19% more feasible solutions than the SFLA-based algorithm.


Sign in / Sign up

Export Citation Format

Share Document