A modified mesh interconnection network for faster sorting

Abstract

In this paper, we propose a modification of the well known m x m mesh interconnection network. The modification is done by adding some more connections to some of the processors. However a processor can have at most six connections which leads O(m²)number of connections. We have implemented bitonic sorting algorithm on the network. It is shown that the time complexity of the algorithm reduces to O(√mlogm) due to this modification.