This paper addresses the problem of reliability and makespan optimization of hardware task graphs in reconfigurable platforms by applying fault tolerance (FT) techniques to the running tasks based

on the exploration of the Pareto set...

for the scheduling problems. In this method, imprecise processing times are modelled as triangular fuzzy numbers (TFNs). TFNs results in a triangular fuzzy number called fuzzy makespan. Makespan is the time that needed for completion all the jobs on the machines...

determine the job-machine assignment and job sequencing on each machine. In such a way the total cost of the schedule is minimized. The cost function consists of three components, namely; machining cost, earliness/tardiness penalties and makespan related...

This paper presents an approach to optimize the reliability and makespan of hardware task graphs, running on FPGA-based reconfigurable computers, in space-mission computing applications with dynamic soft error rates (SERs). Thus, with rises...