lahjomri@irisa.fr (Zakaria Lahjomri) (03/01/91)
I am looking for a Traveling Salesman program on an hypercube iPSC/2 in order to compare message-based implementation versus virtual shared memory implementation. Thanks in advance. Zakaria Lahjomri
rig@eng.umd.edu (Ronald Greenberg) (03/02/91)
In article <1991Mar1.100736.15465@irisa.fr> lahjomri@irisa.fr (Zakaria Lahjomri) writes: >I am looking for a Traveling Salesman program on an hypercube iPSC/2 >in order to compare message-based implementation versus virtual >shared memory implementation. This is not exactly what you were looking for, but you can find implementatiions of some traveling salesman heuristics in *LISP for the Connection Machine in Ron Greenberg, Cindy Phillips, and Joel Wein. Euclidean traveling salesman heuristics. In Leiserson, Leighton, Plotkin, editors. Connection Machine Projects. Technical Report MIT/LCS/RSS 4, Laboratory for Computer Science, Massachusetts Institute of Technology, January 1989. -- Ron Greenberg rig@eng.umd.edu
lahjomri@irisa.fr (Zakaria Lahjomri) (03/07/91)
I am looking for a Traveling Salesman program on an hypercube iPSC/2
in order to compare message-based implementation versus virtual
shared memory implementation.
Thanks in advance.
Zakaria Lahjomri
--
=========================== MODERATOR ==============================
Steve Stevenson {steve,fpst}@hubcap.clemson.edu
Department of Computer Science, comp.parallel
Clemson University, Clemson, SC 29634-1906 (803)656-5880.mabell