In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks
with precedence constraints are executed in a heterogeneous environment. It provides more …

Fault-tolerance is an essential requirement for real-time systems, due to potentially
catastrophic consequences of faults. In this paper, we investigate an efficient off-line …

Nowadays, the performance of heterogeneous systems has been improved dramatically,
which also increases the complexity of heterogeneous systems, leading to the growing …

In hard real-time multiprocessor systems, it is necessary to have a fault-tolerant task
execution scheme to meet the tasks' deadlines even in the presence of a processor failure …

Fault-tolerance is an important issue in hard real-time systems due to the critical nature of
the supported tasks. One way of providing fault-tolerance is to schedule multiple copies of a …

Most existing real-time fault-tolerant scheduling algorithms for heterogeneous distributed
systems can achieve high reliability for non-preemptive and aperiodic tasks. However, the …

Some works have been done in addressing real-time fault-tolerant scheduling algorithms.
However, they all based on homogeneous distributed systems or multiprocessor systems …

In multiprocessors used for implementing real-time applications, it is strongly required to
ensure that tasks' deadlines are met in spite of faults. In this paper, we discuss fault-tolerant …

Modern safety critical real-time systems are composed of tasks of mixed criticalities and the
problem of scheduling them in a fault tolerant manner, on a distributed platform, is …

Many real-time multiprocessor scheduling techniques have been proposed to guarantee the
timely execution of periodic preemptive real-time tasks. However timeliness is usually only …