Date of Award
2007
Document Type
Thesis
Degree Name
Master of Science in Computer Science
Department
School of Computer Science and Engineering
First Advisor
Gomez, Ernesto
Second Advisor
Schubert, Keith Evan
Third Advisor
Yu, Tong Lai
Abstract
This research explores the idea that for certain optimization problems there is a way to parallelize the algorithm such that the parallel efficiency can exceed one hundred percent. Specifically, a parallel compiler, PC, is used to apply shortcutting techniquest to a metaheuristic Ant Colony Optimization (ACO), to solve the well-known Traveling Salesman Problem (TSP) on a cluster running Message Passing Interface (MPI). The results of both serial and parallel execution are compared using test datasets from the TSPLIB.
Recommended Citation
D'Souza, Sammy Raymond, "Parallelizing a nondeterministic optimization algorithm" (2007). Theses Digitization Project. 3084.
https://scholarworks.lib.csusb.edu/etd-project/3084
