Hard aperiodic scheduling in fault tolerant cruise system-comparative evaluation with dual redundancy

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A scheduling algorithm for hard real-time systems with aperiodic task arrivals and fault tolerance can basically meet the needs of applications in the automotive or avionics domain. In these applications, weight, size and power requirements are crucial. Any resource augmentation technique to satisfy this and ensuring safe functionality under faults can bring in a paradigm shift in the design. This paper is based on a strategy for fault tolerance with task level criticality on dual processor system. An application with parallelizable task set has been used to advantage for resource augmentation under fault free condition. A processor failure (permanent fault) leads to safe recovery mechanism with graceful degradation. This paper deals with fault tolerant periodic task scheduling with arrivals of hard aperiodic events. An algorithm for aperiodic scheduling with admission control plan for hard and soft aperiodic tasks is developed and implemented on LPC2148 processors for the cruise system. A comparison is made with a traditional dual redundant system with appropriate performance metrics for evaluation.

Cite

CITATION STYLE

APA

Swetha, A., Radhamani Pillay, V., Punnekkat, S., & Dasgupta, S. (2014). Hard aperiodic scheduling in fault tolerant cruise system-comparative evaluation with dual redundancy. In Advances in Intelligent Systems and Computing (Vol. 327, pp. 589–596). Springer Verlag. https://doi.org/10.1007/978-3-319-11933-5_66

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free