Main Article Content
Abstract
The mesh topology has become a popular interconnection architecture for constructing massively parallel multi-processors. In particular, lowdimensional meshes have been used in several academic and commercial machines, such as the DASH multiprocessor.This project presents a model for designing adaptive wormhole routing algorithms for meshes. The model restricts the locations where some turns can be taken so that deadlock is avoided. In comparison with previous methods (xy routing method), the degree of routing adaptiveness provided by the model is more even for different source-destination pairs. The wireless mesh network may benefit from this feature in terms of communication efficiency. The oddeven turn model makes message routing very minimal. In addition, this property results in a smaller fluctuation of the network performance with respect to different traffic patterns.In addition, the node failure scenario is also considered so that if the path contains that node, then new alternate path from the failure node to the destination is recalculated or taken from cache if previous path information is stored.