Fault-Tolerant Real-Time Scheduling under Execution Time Constraints

Authors:
Martin Naedele
Affiliations:
-
Venue:
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Year:
1999

Citing 0
Cited 6

A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems

Parallel Computing
Contention awareness and fault-tolerant scheduling for precedence constrained tasks in heterogeneous systems

Parallel Computing
A novel fault-tolerant scheduling algorithm for precedence constrained tasks in real-time heterogeneous systems

Parallel Computing
A hybrid policy for fault tolerant load balancing in grid computing environments

Journal of Network and Computer Applications
Adaptive energy-efficient scheduling for real-time tasks on DVS-enabled heterogeneous clusters

Journal of Parallel and Distributed Computing
Fault-tolerant scheduling in homogeneous real-time systems

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The primary/backup with deallocation approach of [Ghosh+97] is a strategy for the fault-tolerant online scheduling of hard real-time tasks. In this scheme, tasks are either rejected within a short time after the request or guaranteed to be executed even in case of a processor failure.In this paper several heuristics for the guarantee algorithm are investigated. For the first time different processor selection strategies for guarantee algorithms with execution time constraints are compared. In addition, the concept of a decision deadline is introduced which then leads to an extension of the primary and backup checking routines. The thus modified checking routines are shown to achieve a lower rejection ratio for tight task deadlines and constrained scheduler execution times than the modification making use of task slack suggested in [Ghosh+97].