Chris Metcalf
Laboratory for Computer Science
Room NE43-635
The NuMesh is a scalable, high-speed network substrate that can be used as the basis of a parallel machine for arbitrary conforming processors. The speed of the NuMesh is due in part to its extremely simple design--no examination of the data need be done to determine the routing, since it is all statically determined. However, a statically-routed network would appear to be inflexible when computing complex, non-time-bounded problems, and easily crippled in the face of localized component failures. This paper outlines one solution to these problems currently implemented to solve the Travelling Salesman Problem. The solution not only allows execution of problems with timing unknown at compile-time, but also provides a robust algorithm in the face of network or node disconnection and reconnection.