Heterogeneous Computing and Parallel Genetic Algorithms
✍ Scribed by Enrique Alba; Antonio J. Nebro; José M. Troya
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 495 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
✦ Synopsis
This paper analyzes some technical and practical issues concerning the heterogeneous execution of parallel genetic algorithms (PGAs). In order to cope with a plethora of different operating systems, security restrictions, and other problems associated to multi-platform execution, we use Java to implement a distributed PGA model. The distributed PGA runs at the same time on different machines linked by different kinds of communication networks. This algorithm benefits from the computational resources offered by modern LANs and by Internet, therefore allowing researchers to solve more difficult problems by using a large set of available machines. We analyze the way in which such heterogeneous systems affect the genetic search for two problems. Our conclusion is that super-linear performance can be achieved not only in homogeneous but also in heterogeneous clusters of machines. In addition, we study some special features of the running platforms for PGAs, and basically find out that heterogeneous computing can be as efficient or even more efficient than homogeneous computing for parallel heuristics. # 2002 Elsevier Science (USA)
📜 SIMILAR VOLUMES
an Analytical Overview Of The State Of The Art, Open Problems, And Future Trends In Heterogeneous Parallel And Distributed Computing this Book Provides An Overview Of The Ongoing Academic Research, Development, And Uses Of Heterogeneous Parallel And Distributed Computing In The Context Of Scientifi
Bertoni, A. and M. Dorigo, Implicit parallelism in genetic algorithms (Research Note), Artificial Intelligence 61 (1993) 307-314. This paper is related to Holland's result on implicit parallelism. Roughly speaking, Holland showed a lower bound of the order of n3/c,VTl to the number of schemata usefu
We present efficient algorithms for designing optimal collective communication primitives for cluster-based heterogeneous computing across Asynchronous Transfer Mode (ATM) networks. The virtual path (VP) concept is known to be a powerful transport mechanism for ATM networks. In many parallel process