Reconfigurable Wormhole Networks: A Realistic Approach

Abstract

The major problem in an interconnection network is related with the contention due to message blocking. In order to avoid this problem, many alternatives have been proposed in the literature, mainly adaptive routing, random routing and dynamic network reconfiguration. Our paper deals with dynamic reconfigurable networks. Reconfigurable networks are an alternative to reduce the negative effect that congestion produces on the performance of the network. Network reconfiguration can be done in different ways. Our researches are focused on dynamic reconfiguration. This technique consists basically of placing the different processors in the network in those positions which, at each computational moment and according to the existing communication pattern among them, are more adequate for the development of such computation.

In this paper we present the foundations of reconfigurable network architecture. The reconfiguration capacity is based on a reconfiguration algorithm distributed in each node. This algorithm is based on a cost function, requires only local information and picks up the characteristics of the reconfiguration adopted technique. We discuss these features and adjust the different parameters that the reconfiguration algorithm has. We have also studied the deadlock problem in reconfigurable interconnection networks and we detail the solution adopted in our approach. Finally, we have evaluated the performance of this technique under randomized hot-spot workload.

This work was supported in part by Spanish CICYT under Grant TIC97-0897-C04