Welcome to the InfoSci Platform
Reference Hub6
Scheduling Mixed-Criticality Real-Time Tasks in a Fault-Tolerant System

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

Jian (Denny) Lin, Albert M. K. Cheng, Doug Steel, Michael Yu-Chi Wu, Nanfei Sun
Copyright: © 2015 |Volume: 6 |Issue: 2 |Pages: 22
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781466678767|DOI: 10.4018/IJERTCS.2015040104
Cite Article Cite Article

MLA

Lin, Jian (Denny), et al. "Scheduling Mixed-Criticality Real-Time Tasks in a Fault-Tolerant System." IJERTCS vol.6, no.2 2015: pp.65-86. http://doi.org/10.4018/IJERTCS.2015040104

APA

Lin, J. D., Cheng, A. M., Steel, D., Wu, M. Y., & Sun, N. (2015). Scheduling Mixed-Criticality Real-Time Tasks in a Fault-Tolerant System. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 6(2), 65-86. http://doi.org/10.4018/IJERTCS.2015040104

Chicago

Lin, Jian (Denny), et al. "Scheduling Mixed-Criticality Real-Time Tasks in a Fault-Tolerant System," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 6, no.2: 65-86. http://doi.org/10.4018/IJERTCS.2015040104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.