Parallel adaptative programs are parallel computations with a dynamically
changing set of tasks. Tasks may be created or killed as a function of the
load state of the parallel machine. A task is created automatically when a
node becomes idle. When a node becomes busy, the task is killed.
A brief bibliography:
V.
Bachelet, Z. Hafidi, P.Preux and E-G.Talbi. Diversifying tabu search by
genetic algorithms. Technical Report LIL-97-13, Laboratoire
d'Informatique du Littoral, Calais,Laboratoire du Littoral, Calais,
October 1997