RCS $Id: README,v 1.6 1995/08/22 23:41:28 tuna Exp $

To compile TSP:
-----------------
1. If you're running on a network of workstations, be sure that you
   have PVM installed correctly and functioning. 

2. Compile the CRL library in the directory "../../src" (see the user
   documentation in "../../doc" for details).

3. Type "make -f Makefile.CM5" to make the CM-5 TSP executable.

     -- or --

   Edit Makefile.TCPUNIX and change the definitions for PVM_ROOT and
   PVM_ARCH to whatever is appropriate for your local system. Once
   you've done so, type "make -f Makefile.TCPUNIX" to make the
   TCP/UNIX TSP executable.

4. If you're running this program with PVM and the executable isn't
   already in your path, be sure to create a soft link to the
   executable from the directory ~/pvm3/bin/$PVM_ARCH.

How to run TSP:
---------------
TSP is a simple implementation of a program which obtains a solution
to an instance of the traveling salesman problem in parallel. Some
parameters, like the number of cities and the desired path length, are
hard coded, and can be found in the file tsp.c. If you want to play
with these parameters, you will need to recompile after each change.

All versions of TSP take one argument, the number of slave
processors. (The number of slave processors should be one less than
the intended total number of processors.)

TSP gives several useful pieces of information on exit, including the
time required to solve the problem, and the number of jobs solved by
each processor. This information should give useful information on
relative processor and network speeds.
