We present a framework that utilizes Distributed Component Object Model (DCOM) for distributed problem solving. The Cooperative Problem Solving (COPS) system provides for the coding and execution of a parallel algorithm by a number of networked computers running Microsoft Windows. We show the effectiveness of the COPS system by implementing parallel breadth-first search used in conjunction with a branch-and-bound algorithm for the Traveling Salesman Problem.
All Science Journal Classification (ASJC) codes
- Information Systems
- Hardware and Architecture
- Distributed problem solving
- Parallel breadth-first search
- Parallel systems
- Traveling Salesman Problem