Back to search

CSUniversity San Bernardino

Parallelizing a nondeterministic optimization algorithm

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Computer Science
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
School of Computer Science and Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • D'Souza, Sammy Raymond
Contributors dc:contributor
  • Gomez, Ernesto
  • Schubert, Keith Evan
  • Yu, Tong Lai

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://scholarworks.lib.csusb.edu/etd-project/3084

Chain of custody

source
Harvested from
CSUniversity San Bernardino
Base URL
scholarworks.lib.csusb.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

D'Souza, Sammy Raymond. Parallelizing a nondeterministic optimization algorithm. Thesis thesis, https://scholarworks.lib.csusb.edu/etd-project/3084