Abstract
In this paper we present a strategy for random search global optimization for parallel computers. The implementation on a shared memory parallel computer is coded in FORTRAN and the implementation on a distributed memory multiprocessor system is coded in C using the processor farming technique. Results on known test examples confirm the conclusions.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call