In parallel MIMD (Multiple Instruction Stream, Multiple Data Stream), the
processors are allowed to perform different types of instructions on different
data.
A brief bibliography:
 |
C.N.Fiechter.
A parallel tabu search algorithm for large traveling salesman problems.
Discrete Applied Mathematics, Vol.51, Issue 3 (July 1994). pp 243-267 |
|
H.
Muhlenbein, M. Schomisch, J. Born (1991) The parallel genetic algorithm
as function optimizer. Parallel Computing, 17, 619-632 |
|
I.
de Falco, R. del Balio, E. Tarantino, R. Vaccaro. Improving Search by
Incorporating Evolution Principles in Parallel Tabu Search,
International Conference on Evolutionary Computation (1994) |