Both these approaches have been used successfully in
solving a variety of problems. In a recent report developed
by a NASA–Langley committee chaired by Biedron et al.
(1999), coarse-grained parallelism is touted as a costeffective
and efficient method for search techniques such
as GA, response surfaces and neural nets. Later, we
present a review of a fraction of the number of GA variations
used in advancing the applicability of Gas, especially
when parallel computing is available.