Abstract: | A reconfigurable network termed as the reconfigurable multi-ring network (RMRN) 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 reconfiguration mechanism ensures a network diameter of O(log2 N) for an N-processor 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 passing and reconfiguration primitives for the SIMD/SPMD RMRN are designed for use as building blocks for more complex parallel algorithms. Elsewhere, the RMRN 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 the 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 nonlinear terms in Korteweg–de Vries like equations. This revised version was published online in June 2006 with corrections to the Cover Date. |