1 / 14

Trivial Parallelization of an Existing EA

Trivial Parallelization of an Existing EA. Asher Freese CS401. Motivation. Many difficult problems NP-Complete 0/1 Knapsack Traveling Salesman Initial Solution: Evolutionary Algorithm Problem: EAs rarely get optimal solution

abrianna-miles
Download Presentation

Trivial Parallelization of an Existing EA

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Trivial Parallelization of an Existing EA Asher Freese CS401

  2. Motivation • Many difficult problems • NP-Complete • 0/1 Knapsack • Traveling Salesman • Initial Solution: Evolutionary Algorithm • Problem: • EAs rarely get optimal solution • Some problems are even bigger than an EA can handle in reasonable time

  3. Solution • Parallel Computing (Island Model) • Parallelization increases speed of programs • EAs are inherently parallelizable • Easy to split populations • Most suitable uses • Requires many generations to converge • Expensive fitness function

  4. Previous Research • Very Little • Proof of concept • Speed up computation of unrelated problem • Method of achieving population diversity

  5. Approach • Parallel, Island Model framework • Parallel framework takes EA class • Instantiation by main will not change • Loop • Run for some generations • Trade individuals among processes • EA class inherits parent for parallel framework

  6. Parallel EA Structure

  7. Two types of Parallelization • Purely Parellel • Each EA is completely independent • Island Model trading • EA’s mostly independent • Trade individuals occasionally

  8. Testing • N-queens problem • 0/1 Knapsack (later) • Ackley Function (later)

  9. Results

  10. Parallel Comparisons

  11. Results, cont

  12. Preliminary Conclusion • Low epoch length, bad • Low number traded individuals, good • High number of processors, good

  13. Future Work • More tests • 0/1 Knapsack • Ackley Function • Different trading algorithms • Processor niching

  14. Questions?

More Related