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. (C) 2001 Elsevier Science Inc. All rights reserved.
| Original language | English |
|---|---|
| Journal | Journal of Systems and Software |
| State | Published - 2002 |