| | |
Summary: ABSTRACT
Fault tolerance is often considered as a good additional
feature for multiprocessor systems but nowadays it is
becoming an essential attribute. Fault tolerance can be
achieved by the use of dedicated customized hardware that
may have the disadvantage of large cost. Another
approach to fault tolerance is to exploit existing redun-
dancy in multiprocessor systems via a task scheduling soft-
ware strategy based on time redundancy. Time redundancy
reduces the expense of additional hardware needed to
achieve fault tolerance at the expense of additional compu-
tation time, which is more affordable. In this paper we
present a general-purpose time redundant task-scheduling
scheme for real time multiprocessor systems that is capable
of tolerating various hardware and software faults. Our
experimental simulation results show that our technique is
highly effective, feasible, and promising.
Keywords: Fault tolerance, time redundancy, task
scheduling, multiprocessor systems.
1 INTRODUCTION
|
