Static Task Allocation Using (;) Evolutionary Strategies

Allocating tasks optimally in distributed systems is a NP-hard problem which has lead researchers to adopt heuristic techniques. In the past Evolutionary Strategies have been shown to be capable of eeciently determining good allocations. All of this previous work has used the (+) version of the evolutionary strategy. In this paper we show that the (;) version of evolutionary strategy can nd even better task allocations.

[1]  G. Greenwood,et al.  Scheduling replicated critical tasks in faulty networks using evolutionary strategies , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[2]  Garrison W. Greenwood,et al.  Scheduling tasks in multiprocessor systems using evolutionary strategies , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[3]  Martin T. Hagan,et al.  Mapping Signal Processing Algorithms on Parallel Architectures , 1990, J. Parallel Distributed Comput..

[4]  Garrison W. Greenwood,et al.  Scheduling tasks in real-time systems using evolutionary strategies , 1995, Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems.