Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 79-90 |
Number of pages | 12 |
Journal | Journal of Systems and Software |
Volume | 63 |
Issue number | 2 |
DOIs | |
State | Published - Aug 15 2002 |
All Science Journal Classification (ASJC) codes
- Software
- Information Systems
- Hardware and Architecture
Keywords
- Branch-and-bound
- COPS
- DCOM
- Distributed problem solving
- Parallel breadth-first search
- Parallel systems
- Traveling Salesman Problem