An algorithm for dynamic reconfiguration of a multicomputer network

The dynamic reconfiguration of the interconnection network is an advanced feature of some multicomputers to reduce the communication overhead. The authors present an algorithm for the dynamic reconfiguration of the network. Reconfiguration is limited, preserving the original topology. Long distance message passing is minimized by positioning communication partners close to each other. The algorithm is transparent to the application programmer and is not restricted to a particular class of applications, being very well suited for parallel applications whose communication pattern varies over time. The paper also presents some simulation results, showing the benefits from the new reconfiguration algorithm.<<ETX>>

[1]  Allan Gottlieb,et al.  Highly parallel computing , 1989, Benjamin/Cummings Series in computer science and engineering.

[2]  Jake K. Aggarwal,et al.  A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.

[3]  David May,et al.  The Next Generation Transputers and Beyond , 1991, EDMCC.

[4]  Michael J. Flynn,et al.  Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.

[5]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[6]  David M. Nicol,et al.  Optimal Dynamic Remapping of Data Parallel Computations , 1990, IEEE Trans. Computers.

[7]  José Manuel García Carrasco.  Desarrollo de herramientas para una programación eficiente de las redes de transputers: estudio de la reconfiguración dinámica de la red de interconexión , 1993 .

[8]  J. Duato,et al.  Parallel triangularization of a sparse matrix on a distributed-memory multiprocessor using fast Give , 1989 .

[9]  A. Klein,et al.  Performance Benefits from Locally Adaptive Interval Routing in Dynamically Switched Interconnection Networks , 1991, EDMCC.

[10]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[11]  Denis A. Nicole,et al.  Reconfigurable transputer processor architectures , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume 1: Architecture Track.

[12]  Erik Maehle,et al.  DAMP - A Dynamic Reconfigurable Multiprocessor System with a Distributed Switching Network , 1991, EDMCC.

[13]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[14]  José Duato,et al.  On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies , 1991, PARLE.