High performance real-time scheduling of multiple mixed-criticality functions in heterogeneous distributed embedded systems

The heterogeneous distributed embedded systems integrated of multiple functions with different criticality levels are multi-functional mixed-criticality systems (MMCSs). The state-of-the-art work has studied the real-time scheduling in MMCS; however, it is not well designed in system switching mechanism and operation which may lead to missing the deadlines of high-criticality functions and redundant operation. In this study, we improve and optimize the problem by developing an algorithm called rearrangement-based scheduling for MMCS (RSM). The RSM algorithm optimizes the following two main aspects. The first aspect is optimizing system-criticality switching mechanisms, including system criticality changed up and down. The second aspect is the effective operation in system-criticality switching to reduce redundant operation. Experiments are performed, and results show that the RSM algorithm can achieve lower overall makespan and deadline miss ratios (DMRs) than the existing algorithms.

Download Full-text

Towards compositional mixed-criticality real-time scheduling in open systems

ACM SIGBED Review ◽

10.1145/2983185.2983193 ◽

2016 ◽

Vol 13 (3) ◽

pp. 49-51 ◽

Cited By ~ 1

Author(s):

Jaewoo Lee ◽

Hoon Sung Chwa ◽

Arvind Easwaran ◽

Insik Shin ◽

Insup Lee

Keyword(s):

Real Time ◽

Open Systems ◽

Real Time Scheduling ◽

Time Scheduling ◽

Mixed Criticality

Download Full-text

Scheduling Mixed-Criticality Real-Time Tasks in a Fault-Tolerant System

International Journal of Embedded and Real-Time Communication Systems ◽

10.4018/ijertcs.2015040104 ◽

2015 ◽

Vol 6 (2) ◽

pp. 65-86 ◽

Cited By ~ 3

Author(s):

Jian (Denny) Lin ◽

Albert M. K. Cheng ◽

Doug Steel ◽

Michael Yu-Chi Wu ◽

Nanfei Sun

Keyword(s):

Real Time ◽

Fault Tolerant ◽

Formal Proof ◽

Worst Case ◽

Real Time Scheduling ◽

Important Trend ◽

Time Scheduling ◽

On Line ◽

Computer Tasks ◽

Mixed Criticality

Enabling computer tasks with different levels of criticality running on a common hardware platform has been an increasingly important trend in the design of real-time and embedded systems. On such systems, a real-time task may exhibit different WCETs (Worst Case Execution Times) in different criticality modes. It is well-known that traditional real-time scheduling methods are not applicable to ensure the timely requirement of the mixed-criticality tasks. In this paper, the authors study a problem of scheduling real-time, mixed-criticality tasks with fault tolerance. An optimal, off-line algorithm is designed to guarantee the most tasks completing successfully when the system runs into the high-criticality mode. A formal proof of the optimality is given. Also, a novel on-line slack-reclaiming algorithm is proposed to recover from computing faults before the tasks' deadline during the run-time. Simulations show that an improvement of about 30% in performance is obtained by using the slack-reclaiming method.

Download Full-text