A parallel numerical algorithm on a reconfigurable multi-ring network

A reconfigurable network termed as the reconfigurable multi-ring network (R MRN) is described. The RMRN is shown to be a truly scalable network in that each node in the network has a fixed degree of connectivity and the reconf iguration mechanism ensures a network diameter of O(log(2) N) for an N-proc essor network. Algorithms for the two-dimensional mesh and the SIMD or SPMD n-cube are shown to map very elegantly onto the RMRN. Basic message passin g and reconfiguration primitives for the SIMD/SPMD RMRN are designed for us e as building blocks for more complex parallel algorithms. Elsewhere, the R MRN is shown to be a viable architecture for image processing and computer vision problems. In this paper, the RMRN is proved to be very useful for th e implementation of numerical algorithms. We describe the implementation of a nontrivial numerical scheme on the RMRN. This numerical scheme is based on the inverse scattering transform and is used to study the role of nonlin ear terms in Korteweg-de Vries like equations.