When designing fault-tolerant systems, one can makes use of both redundancy and reconﬁgurable computing, especially when multi-processor platforms are targeted. Actually, multi-processor platforms can be less vulnerable when one processor is faulty because other processors can take over its scheduled tasks.
In this context, we investigate how to dynamically map and schedule tasks onto homogeneous faulty processors. We developed a run-time algorithm based on the primary/backup approach which is commonly used for its minimal resources utilization and high reliability. Its principal rule is that, when a task arrives, the system creates two identical copies: the primary copy and the backup copy which can be deallocated. Several policies have been studied and their performances have been analyzed. We are currently reﬁning the algorithm to reduce its complexity without decreasing performance.