Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Fault-tolerant scheduling in homogeneous real-time systems

Fault-tolerant scheduling in homogeneous real-time systems Fault-Tolerant Scheduling in Homogeneous Real-Time Systems C. M. KRISHNA, University of Massachusetts at Amherst Real-time systems are one of the most important applications of computers, both in commercial terms and in terms of social impact. Increasingly, real-time computers are used to control life-critical applications and need to meet stringent reliability conditions. Since the reliability of a real-time system is related to the probability of meeting its hard deadlines, these reliability requirements translate to the need to meet critical task deadlines with a very high probability. We survey the problem of how to schedule tasks in such a way that deadlines continue to be met despite processor (permanent or transient) or software failure. Categories and Subject Descriptors: A.1 [Introductory and Survey]; D.4.1 [Process Management]: Scheduling; D4.5 [Reliability]: Fault Tolerance; D4.7 [Organization and Design]: Real-Time Systems; J.7 [Computers in Other Systems]: Real-Time Systems General Terms: Algorithms, Reliability Additional Key Words and Phrases: Cyber-physical systems, task assignment, task scheduling, real-time systems, time redundancy ACM Reference Format: C. M. Krishna. 2104. Fault-tolerant scheduling in homogeneous real-time systems. ACM Comput. Surv. 46, 4, Article 48 (March 2014), 34 pages. DOI: http://dx.doi.org/10.1145/2534028 1. INTRODUCTION Real-time systems are an important application of computer systems. Increasingly, http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Computing Surveys (CSUR) Association for Computing Machinery

Fault-tolerant scheduling in homogeneous real-time systems

ACM Computing Surveys (CSUR) , Volume 46 (4) – Mar 1, 2014

Loading next page...
 
/lp/association-for-computing-machinery/fault-tolerant-scheduling-in-homogeneous-real-time-systems-Z4T01SsCSS

References (58)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2014 by ACM Inc.
ISSN
0360-0300
DOI
10.1145/2534028
Publisher site
See Article on Publisher Site

Abstract

Fault-Tolerant Scheduling in Homogeneous Real-Time Systems C. M. KRISHNA, University of Massachusetts at Amherst Real-time systems are one of the most important applications of computers, both in commercial terms and in terms of social impact. Increasingly, real-time computers are used to control life-critical applications and need to meet stringent reliability conditions. Since the reliability of a real-time system is related to the probability of meeting its hard deadlines, these reliability requirements translate to the need to meet critical task deadlines with a very high probability. We survey the problem of how to schedule tasks in such a way that deadlines continue to be met despite processor (permanent or transient) or software failure. Categories and Subject Descriptors: A.1 [Introductory and Survey]; D.4.1 [Process Management]: Scheduling; D4.5 [Reliability]: Fault Tolerance; D4.7 [Organization and Design]: Real-Time Systems; J.7 [Computers in Other Systems]: Real-Time Systems General Terms: Algorithms, Reliability Additional Key Words and Phrases: Cyber-physical systems, task assignment, task scheduling, real-time systems, time redundancy ACM Reference Format: C. M. Krishna. 2104. Fault-tolerant scheduling in homogeneous real-time systems. ACM Comput. Surv. 46, 4, Article 48 (March 2014), 34 pages. DOI: http://dx.doi.org/10.1145/2534028 1. INTRODUCTION Real-time systems are an important application of computer systems. Increasingly,

Journal

ACM Computing Surveys (CSUR)Association for Computing Machinery

Published: Mar 1, 2014

There are no references for this article.