[ Bristol CS | Index ]
Travelling salesman problem
One of the examples used in "Experiments with speculative parallelism in Parlog" is an algorithm to solve the Travelling Salesman Problem. This was written in Parlog extended with a special language feature to exploit speculative parallelism. The original program could only be run using a hacked version of the JAM Parallel Parlog system on a multiprocessor machine. The program, without the use of the speculative parallelism features, has been ported to KL1 and is available here. This can be run by anyone with a Unix machine running ICOT's KLIC system.
Steve Gregory
Steve Gregory,
steve@cs.bris.ac.uk. Last modified on Friday 30 November 2001 at 14:38. © 2001 University of Bristol