Evolution-Based Scheduling of Fault-Tolerant Programs on Multiple Processors

The paper introduces a family of scheduling problems called fault-tolerant programs scheduling FTPS. Since FTPS problems are, in general, computationally di cult, a challenge is to nd e ective scheduling procedures. Three evolution-based algorithms solving three basic kinds of FTPS problems have been proposed. The problems involve scheduling multiple variant tasks on multiple identical processors under time constraints. To validate the algorithms computational experiment has been carried. Experiment results show that evolution based algorithms produce satisfactory to good solutions in reasonable time.

• Type: Conference
• Year: 1999
• Where: IPPS
• Authors: Piotr Jedrzejowicz, Ireneusz Czarnowski, Henryk Szreder, Aleksander Skakovski
• Keywords: Distributed And Parallel Computing, FTPS Problems, IPPS 1999, Programs Scheduling Ftps, Scheduling Problems