research-article

Resource augmentation for fault-tolerance feasibility of real-time tasks under error bursts

Authors:

Abhilash Thekkilakattil,

Sasikumar Punnekkat,

Huseyin AysanAuthors Info & Claims

RTNS '12: Proceedings of the 20th International Conference on Real-Time and Network Systems

Pages 41 - 50

https://doi.org/10.1145/2392987.2392992

Published: 08 November 2012 Publication History

Abstract

Dependability is a vital system requirement, particularly in safety critical and mission critical real-time systems, due to the potentially catastrophic consequences of failures. In most critical applications different fault tolerance mechanisms using redundancy are employed to prevent possible failures. In the case of real-time systems the system designer must ensure that the task set is feasible even under faults, which we refer to as 'fault tolerance feasibility'. Due to cost considerations, often temporal redundancy has been prevalently used to meet this objective.

In this paper we focus on guaranteeing fault-tolerance feasibility under error bursts on uni-processor systems by the usage of resource augmentation, specifically through processor speed-up. Firstly, we derive a processor demand bound based sufficient condition for a set of real-time tasks to be fault tolerance feasible under an assumption that no more than one error burst occurs during the hyper-period of the task set. Subsequently, we derive the necessary resource augmentation bounds (i.e., the processor speed-up), that guarantees the fault tolerance feasibility, if the sufficient test fails. Finally, we prove that, if the error burst length is no more than half the shortest relative deadline of the task set, the minimum processor speed-up required to guarantee fault tolerance feasibility is upper-bounded by 6.

Supplementary Material

JPG File (p41-thekkilakattil.jpg)

EDF schedule under faults with Tlength = 4

Download
106.70 KB

References

[1]

G. Attiya and Y. Hamam. Task allocation for maximizing reliability of distributed systems: A simulated annealing approach. Journal of Parallel and Distributed Computing, October 2006.

Digital Library

[2]

A. Avizienis, J.-C. Laprie, B. Randell, and C. Landwehr. Basic concepts and taxonomy of dependable and secure computing. IEEE Transactions on Dependable Secure Computing, January 2004.

Digital Library

[3]

H. Aydin. Exact fault-sensitive feasibility analysis of real-time tasks. IEEE Transactions on Computers, October 2007.

Digital Library

[4]

H. Aysan. Fault-tolerance strategies and probabilistic guarantees for real-time systems. In PhD thesis, Malardalen University, June 2012.

[5]

H. Aysan, R. Dobrin, S. Punnekkat, and R. Johansson. Probabilistic schedulability guarantees for dependable real-time systems under error bursts. In The 8th IEEE International Conference on Embedded Software and Systems, November 2011.

Digital Library

[6]

H. Aysan, A. Thekkilakattil, R. Dobrin, and S. Punnekkat. Efficient fault tolerant scheduling on controller area network (CAN). In 15th International Conference on Emerging Technologies and Factory Automation, September 2010.

[7]

J. A. Bannister and K. S. Trivedi. Task Allocation in Fault-Tolerant Distributed Systems. Acta Informatica, Springer-Verlag, 1983.

[8]

S. K. Baruah, L. E. Rosier, and R. R. Howell. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems, October 1990.

Digital Library

[9]

A. Burns, R. Davis, and S. Punnekkat. Feasibility analysis of fault-tolerant real-time task sets. In The 8th Euromicro Workshop on Real-Time Systems, June 1996.

[10]

G. C. Buttazzo. Rate monotonic vs. EDF: judgment day. Real-Time Systems Journal, January 2005.

Digital Library

[11]

M. Cirinei, A. Mancina, D. Cantini, P. Gai, and L. Palopoli. An educational open source real-time kernel for small embedded control systems. In Computer and Information Sciences. Springer Berlin / Heidelberg, 2004.

[12]

R. Davis, T. RothvoSS, S. Baruah, and A. Burns. Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. Real-Time Systems, July 2009.

Digital Library

[13]

M. L. Dertouzos. Control robotics: The procedural control of physical processes. In IFIP Congress, 1974.

[14]

R. Dobrin, H. Aysan, and S. Punnekkat. Maximizing the fault tolerance capability of fixed priority schedules. In The 14th IEEE Internationl Conference on Embedded and Real-Time Computing Systems and Applications, August 2008.

Digital Library

[15]

R. Dobrin, G. Fohler, and P. Puschner. Translating off-line schedules into task attributes for fixed priority scheduling. In Real-Time Systems Symposium, December 2001.

Digital Library

[16]

S. Ghosh, R. Melhem, and D. Mosse. Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems. IEEE Transactions on Prarallel and Distributed Systems, March 1997.

Digital Library

[17]

S. Islam, R. Lindstrom, and N. Suri. Dependability driven integration of mixed criticality SW components. Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing, April 2006.

Digital Library

[18]

B. Kalyanasundaram and K. Pruhs. Speed is as powerful as clairvoyance. Journal of ACM, July 2000.

Digital Library

[19]

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, May 1983.

[20]

B. Lisper. Trends in timing analysis. In From Model-Driven Design to Resource Management for Distributed Embedded Systems. Springer Boston, 2006.

[21]

C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. The Journal of ACM, January 1973.

Digital Library

[22]

F. Many and D. Doose. Scheduling analysis under fault bursts. In The 17th IEEE Real-Time and Embedded Technology and Applications Symposium, April 2011.

Digital Library

[23]

R. Pathan and J. Jonsson. Exact fault-tolerant feasibility analysis of fixed-priority real-time tasks. In The 16th International Conference on Embedded and Real-Time Computing Systems and Applications, April 2010.

Digital Library

[24]

A. Thekkilakattil, H. Aysan, and S. Punnekkat. Towards a contract-based fault-tolerant scheduling framework for distributed real-time systems. In The 1st International Workshop on Dependable and Secure Industrial and Embedded Systems, June 2011.

[25]

D. Zhu. Reliability-aware dynamic energy management in dependable embedded real-time systems. In In Proceedings of the 12th IEEE Real-Time and Embedded Technology and Applications Symposium, April 2006.

Digital Library

[26]

D. Zhu, R. Melhem, and D. Mosse. The effects of energy management on reliability in real-time embedded systems. In Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design, November 2004.

Digital Library

Cited By

Reghenzani FGuo ZFornaciari W(2023)Software Fault Tolerance in Real-Time Systems: Identifying the Future Research QuestionsACM Computing Surveys10.1145/358995055:14s(1-30)Online publication date: 30-Mar-2023
https://dl.acm.org/doi/10.1145/3589950
Thomas JRanjith RPillay R(2017)Guaranteeing fault tolerance in real time systems under error bursts2017 International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)10.1109/ICICICT1.2017.8342788(1480-1484)Online publication date: Jul-2017
https://doi.org/10.1109/ICICICT1.2017.8342788
Cui XWu KWei TSha E(2016)Worst-Case Finish Time Analysis for DAG-Based Applications in the Presence of Transient FaultsJournal of Computer Science and Technology10.1007/s11390-016-1626-631:2(267-283)Online publication date: 7-Mar-2016
https://doi.org/10.1007/s11390-016-1626-6
Show More Cited By

Index Terms

Resource augmentation for fault-tolerance feasibility of real-time tasks under error bursts
1. Computer systems organization
2. General and reference
  1. Cross-computing tools and techniques
    1. Reliability

Recommendations

Fault Tolerant Scheduling of Mixed Criticality Real-time Tasks under Error Bursts
Abstract
Dependability is an important requirement in hard real-time applications due to the potentially catastrophic consequences of failures. In these systems, fault tolerance mechanisms like temporal redundancy are adopted to improve reliability. Most ...
Tolerance to Multiple Transient Faults for Aperiodic Tasks in Hard Real-Time Systems

Real-time systems are being increasingly used in several applications which are time-critical in nature. Fault tolerance is an essential requirement of such systems, due to the catastrophic consequences of not tolerating faults. In this paper, we study ...
Fault tolerance evaluation and schedulability analysis
SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing

The use of real-time systems can differ from their initial design and requirements. New missions may take place in a more agressive environment and cause faults that are not managed by the initial fault tolerance mechanisms. Before attributing a new ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

RTNS '12: Proceedings of the 20th International Conference on Real-Time and Network Systems

November 2012

216 pages

ISBN:9781450314091

DOI:10.1145/2392987

General Chairs:
Liliana Cucu-Grosjean
INRIA Nancy-Grand Est, France
,
Nicolas Navet
University of Luxembourg, Luxembourg
,
Program Chairs:
Christine Rochange
University of Toulouse/IRIT, France
,
James H. Anderson
University of North Carolina

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

University of Lorraine: University of Lorraine
INRIA: Institut Natl de Recherche en Info et en Automatique
GDR ASR: GDR Architecture, Systèmes et Réseaux

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 November 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

RTNS '12

Sponsor:

University of Lorraine
INRIA
GDR ASR

RTNS '12: 20th International Conference on Real-Time and Network Systems

November 8 - 9, 2012

Pont à Mousson, France

Acceptance Rates

Overall Acceptance Rate 119 of 255 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
109
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Reghenzani FGuo ZFornaciari W(2023)Software Fault Tolerance in Real-Time Systems: Identifying the Future Research QuestionsACM Computing Surveys10.1145/358995055:14s(1-30)Online publication date: 30-Mar-2023
https://dl.acm.org/doi/10.1145/3589950
Thomas JRanjith RPillay R(2017)Guaranteeing fault tolerance in real time systems under error bursts2017 International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT)10.1109/ICICICT1.2017.8342788(1480-1484)Online publication date: Jul-2017
https://doi.org/10.1109/ICICICT1.2017.8342788
Cui XWu KWei TSha E(2016)Worst-Case Finish Time Analysis for DAG-Based Applications in the Presence of Transient FaultsJournal of Computer Science and Technology10.1007/s11390-016-1626-631:2(267-283)Online publication date: 7-Mar-2016
https://doi.org/10.1007/s11390-016-1626-6
Thekkilakattil ADobrin RPunnekkat S(2015)Fault Tolerant Scheduling of Mixed Criticality Real-time Tasks under Error BurstsProcedia Computer Science10.1016/j.procs.2015.01.02746(1148-1155)Online publication date: 2015
https://doi.org/10.1016/j.procs.2015.01.027
Haque MAydin HZhu D(2014)Real-time scheduling under fault bursts with multiple recovery strategy2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS)10.1109/RTAS.2014.6925991(63-74)Online publication date: Apr-2014
https://doi.org/10.1109/RTAS.2014.6925991
Thekkilakattil ADobrin RPunnekkat S(2014)Bounding the effectiveness of temporal redundancy in fault-tolerant real-time scheduling under error burstsProceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA)10.1109/ETFA.2014.7005170(1-8)Online publication date: Sep-2014
https://doi.org/10.1109/ETFA.2014.7005170
Thekkilakattil ABaruah SDobrin RPunnekkat S(2014)The Global Limited Preemptive Earliest Deadline First Feasibility of Sporadic Real-Time Tasks2014 26th Euromicro Conference on Real-Time Systems10.1109/ECRTS.2014.21(301-310)Online publication date: Jul-2014
https://doi.org/10.1109/ECRTS.2014.21
Thekkilakattil ADobrin RPunnekkat S(2013)Quantifying the Sub-optimality of Non-preemptive Real-Time Scheduling2013 25th Euromicro Conference on Real-Time Systems10.1109/ECRTS.2013.22(113-122)Online publication date: Jul-2013
https://doi.org/10.1109/ECRTS.2013.22

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents