Newsgroups: comp.parallel
From: Erik de la Iglesia <erik@joker.mil.ufl.edu>
Subject: Re: Traveling Salesman Problem
Organization: Machine Intelligence Laboratory
Date: Tue, 20 Jun 1995 15:41:43 GMT
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
Message-ID: <3s6q7n$jn0@huron.eel.ufl.edu>

Look through your library and try to find "The Connection Machine" by
Hillis. Hillis invented the Connection Machine, a massively parallel system
while at MIT before forming Thinking Machines Inc. In the book, which is
his discertation, he describes how massively parallel systems can do, among 
other things, the traveling salesman problem much faster than a serial machine.

The architecture is a little hairy and the programming is a custom LISP,
but the fundamentals are pretty clear. Now adays, connection machines are
primarily research engines, but the idea of doing an image averaging algorithm
(take average of every pixel and four neighbors) in four clock cycles regardless
of the image size, sounds pretty enticing. 



