Scheduling replicated critical tasks in faulty networks using evolutionary strategies

Scheduling tasks in distributed systems is a difficult problem. Finding good schedules becomes even more complex when the network is faulty and there are no additional resources available. This paper presents a technique using evolutionary strategies to find task schedules in such systems. Our results indicate that good schedules can be found even when critical tasks must be replicated on distinct processors